An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Authors:
Sandra Ulrich Ngueveu;Christian Prins;Roberto Wolfler Calvo
Affiliations:
Institut Charles Delaunay - LOSI, Université de Technologie de Troyes (UTT), 12, rue Marie Curie, 10000 Troyes, France;Institut Charles Delaunay - LOSI, Université de Technologie de Troyes (UTT), 12, rue Marie Curie, 10000 Troyes, France;Laboratoire d'Informatique de l'Université Paris-Nord (LIPN) UMR 7030, 99, av. Jean-Baptiste Clément, 93430 Villetaneuse, France
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 10

The delivery man problem and cumulative matroids

Operations Research
Paths, Trees, and Minimum Latency Tours

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A Faster, Better Approximation Algorithm for the Minimum Latency Problem

SIAM Journal on Computing
Routing for Relief Efforts

Transportation Science
Energy minimizing vehicle routing problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Efficient frameworks for greedy split and new depth first search split procedures for routing problems

Computers and Operations Research
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Computers and Operations Research
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem

Computers and Operations Research
Heuristics for the traveling repairman problem with profits

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

Expert Systems with Applications: An International Journal
Effect of the initial solutions to balance routes in vehicle routing problem with time windows

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
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
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size

Computers and Operations Research
A bi-objective vehicle routing problem with time windows: A real case in Tenerife

Applied Soft Computing
A memetic algorithm for the capacitated m-ring-star problem

Applied Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

The cumulative capacitated vehicle routing problem (CCVRP) is a transportation problem which occurs when the objective is to minimize the sum of arrival times at customers, instead of the classical route length, subject to vehicle capacity constraints. This type of challenges arises whenever priority is given to the satisfaction of the customer need, e.g. vital goods supply or rescue after a natural disaster. The CCVRP generalizes the NP-hard traveling repairman problem (TRP), by adding capacity constraints and a homogeneous vehicle fleet. This paper presents the first upper and lower bounding procedures for this new problem. The lower bounds are derived from CCVRP properties. Upper bounds are given by a memetic algorithm using non-trivial evaluations of cost variations in the local search. Good results are obtained not only on the CCVRP, but also on the special case of the TRP, outperforming the only TRP metaheuristic published.