An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem |
| |
| Authors: | Glaydston Mattos Ribeiro Gilbert Laporte |
| |
| Affiliation: | a CIRRELT and HEC Montréal, Canada H3T 2A7
b Federal University of Espírito Santo, São Mateus - ES, 29932-540, Brazil |
| |
| 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. |
| |
| Keywords: | Cumulative objective Metaheuristics Adaptive large neighborhood search Disaster relief |
| 本文献已被 ScienceDirect 等数据库收录！ |
