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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research
Main Authors:	Tamke, Felix, Linß, Florian, Kuttner, Leopold, Buscher, Udo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2025
Subjects:	Branch-and-cut Constraint programming Container loading Routing Routing Branch-and-cut Container loading Constraint programming
ISSN:	0377-2217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!