4.7 Article

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

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 302, 期 1, 页码 259-269

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2021.12.050

关键词

Routing; Two-dimensional loading constraints; Branch and cut; Contraction algorithm

资金

  1. Canadian Natural Sciences and Engineering Research Council (NSERC)
  2. National Natural Science Foundation of China (NSFC) [52175475, 51775347]

向作者/读者索取更多资源

In this study, a branch-and-cut algorithm is developed for the vehicle routing problem with two-dimensional loading constraints. The algorithm is shown to be competitive through experimental results, and extensive computational analysis is conducted to investigate the impact of different factors on the algorithm.
In this study, we develop a branch-and-cut algorithm for the vehicle routing problem with twodimensional 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. (c) 2022 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据