A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem

This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow mode...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation science 2013-02, Vol.47 (1), p.23-37
Hauptverfasser:	Jepsen, Mads, Spoorendonk, Simon, Ropke, Stefan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis Branch & bound algorithms branch-and-cut Costs Customers Decomposition Distribution Inventories Routing Satellites Studies Transport economics Transport infrastructure Transport planning Transportation Transportation problem (Operations research) two-echelon systems vehicle routing Vehicles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!