A new ILP-based refinement heuristic for Vehicle Routing Problems

In this paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to cover all customers while satisfying, for each route, both a capacity and a total-distance-travelled limit. Our starting...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2006-02, Vol.105 (2-3), p.471-499
Hauptverfasser:	DE FRANCESCHI, Roberto, FISCHETTI, Matteo, TOTH, Paolo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Assignment problem Costs Digital Object Identifier Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Linear programming Mathematical models Mathematical programming Neighborhoods Operational research and scientific management Operational research. Management science Studies Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!