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

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 se...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2012-03, Vol.39 (3), p.728-735
Hauptverfasser:	Mattos Ribeiro, Glaydston, Laporte, Gilbert
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive large neighborhood search Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Benchmarking Comparative analysis Computer science control theory systems Cumulative objective Customers Disaster relief Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Logistics Metaheuristics Operational research and scientific management Operational research. Management science Operations research Optimization Optimization algorithms Route optimization Searching Studies Theoretical computing Vehicles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2011.05.005