A branch-and-cut approach for the vehicle routing problem with loading constraints

作者：

Highlights：

•

• A Branch-and-Cut Approach is proposed for the VRP with Loading Constraints.

• Several techniques are used such as metaheuristics, constraint programming and ILP.

• This problem arises in real-life problems in the area of transportation of goods.

• We improved previous results from literature.

摘要

•A Branch-and-Cut Approach is proposed for the VRP with Loading Constraints.•Several techniques are used such as metaheuristics, constraint programming and ILP.•This problem arises in real-life problems in the area of transportation of goods.•We improved previous results from literature.

论文关键词：Vehicle routing,Two-dimensional packing,Three-dimensional packing,Branch-and-cut,Combinatorial optimization

论文评审过程：Received 16 December 2014, Revised 11 October 2015, Accepted 12 October 2015, Available online 18 November 2015, Version of Record 28 November 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.10.013