A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints

This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously infeasible route can become feasible by adding a new customer if...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research
Hauptverfasser:	Tamke, Felix, Linß, Florian, Kuttner, Leopold, Buscher, Udo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.10.2025
Schlagworte:	Branch-and-cut Constraint programming Container loading Routing Routing Branch-and-cut Container loading Constraint programming
ISSN:	0377-2217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!