Lower and upper bounds for the two-echelon capacitated location-routing problem

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2012-12, Vol.39 (12), p.3185-3199
Hauptverfasser:	Contardo, Claudio, Hemmelmayr, Vera, Crainic, Teodor Gabriel
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive large neighbourhood search Algorithms Applied sciences Branch-and-cut Computational efficiency Exact sciences and technology Inequalities Logistics Lower bounds Mathematical models Operational research and scientific management Operational research. Management science Operations research Optimization Two-echelon capacitated location routing problem Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!