The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints

Zongyi Chen, Mingkang Yang, Yijun Guo, Yu Liang, Yifan Ding and Li Wang
Additional contact information
Zongyi Chen: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China
Mingkang Yang: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China
Yijun Guo: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China
Yu Liang: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China
Yifan Ding: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China
Li Wang: School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China

Sustainability, 2020, vol. 12, issue 17, 1-21

Abstract: Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.

Keywords: vehicle routing problem; 3D loading; split delivery; time window; tabu search algorithm (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.mdpi.com/2071-1050/12/17/6987/pdf (application/pdf)
https://www.mdpi.com/2071-1050/12/17/6987/ (text/html)

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:gam:jsusta:v:12:y:2020:i:17:p:6987-:d:404920

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().