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

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & industrial engineering Ročník 171; s. 108505
Hlavní autoři:	Küçük, Mustafa, Topaloglu Yildiz, Seyda
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.09.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!