| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347635 | Computers & Operations Research | 2012 | 8 Pages |
Abstract
The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the classical capacitated vehicle routing problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compared with two recently published memetic algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Glaydston Mattos Ribeiro, Gilbert Laporte,