Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems

•Novel Constraint Programming (CP) models are proposed for the 3l-CVRP.•CP based decomposition models are more effective than the MIP model.•A hybrid CP model is proposed for large-size problems.•New best solutions are obtained for 36 benchmark instances. This paper presents constraint programming-b...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 171; S. 108505
Hauptverfasser:	Küçük, Mustafa, Topaloglu Yildiz, Seyda
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.09.2022
Schlagworte:	Constraint programming Container loading problem Decomposition Time windows Vehicle routing problem Time windows Decomposition Container loading problem Constraint programming Vehicle routing problem
ISSN:	0360-8352, 1879-0550
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!