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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research
Hlavní autori:	Tamke, Felix, Linß, Florian, Kuttner, Leopold, Buscher, Udo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2025
Predmet:	Branch-and-cut Constraint programming Container loading Routing Routing Branch-and-cut Container loading Constraint programming
ISSN:	0377-2217
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!