A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

Xiangyi Zhang, Lu Chen, Michel Gendreau and André Langevin

European Journal of Operational Research, 2022, vol. 302, issue 1, 259-269

Abstract: In this study, we develop a branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints. A separation algorithm is proposed to simultaneously identify infeasible set inequalities and weak capacity inequalities for fractional solutions. Classic capacitated vehicle routing problem (CVRP) inequalities are adopted as well. A branch-and-cut (B&C) algorithm is built to solve the problem. Experimental results illustrate that the algorithm is competitive. In particular, we solve 6 instances to optimality for the first time. Extensive computational analysis is also conducted to reveal the impact of infeasible set inequalities, the branching strategy, and the packing algorithms on the B&C algorithm.

Keywords: Routing; Two-dimensional loading constraints; Branch and cut; Contraction algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221721011061
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:302:y:2022:i:1:p:259-269

DOI: 10.1016/j.ejor.2021.12.050

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().