An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Authors:
Glaydston Mattos Ribeiro;Gilbert Laporte
Affiliations:
CIRRELT and HEC Montréal, Canada H3T 2A7 and Federal University of Espírito Santo, São Mateus - ES, 29932-540, Brazil;CIRRELT and HEC Montréal, Canada H3T 2A7
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 5

The delivery man problem and cumulative matroids

Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine

Journal of Scheduling
A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling
Routing for Relief Efforts

Transportation Science
An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Computers and Operations Research
The Delivery Man Problem with time windows

Discrete Optimization

A two-phase metaheuristic for the cumulative capacitated vehicle routing problem

Computers and Operations Research
Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows

Expert Systems with Applications: An International Journal
The consultation timetabling problem at Danish high schools

Journal of Heuristics
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
Short communication: Comments on "Albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320": A proposal of good practice

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.