Bi-Objective Splitting Delivery VRP with Loading Constraints and Restricted Access

裴季源1,2; 胡呈鹏1,2; 刘佳琳1,2; Mei, Yi3; 姚新1,2

10.1109/SSCI50451.2021.9659967

2021

2021 IEEE Symposium Series on Computational Intelligence

978-1-7281-9049-5

2021 IEEE Symposium Series on Computational Intelligence (SSCI)

01-09

2021.12.05-2021.12.07

Orlando, Florida, USA

345 E 47TH ST, NEW YORK, NY 10017 USA

IEEE

The splitting delivery vehicle routing problem with 3-dimensional loading constraints (3L-SDVRP) is an important and challenging VRP variant. The problem consists of two sub-problems: the routing and 3D bin packing, each of which is NP-hard by itself. Compared with CVRP, 3L-SDVRP is much closer to the reality. There have been many studies on 3L-SDVRP. However, to our best knowledge, no complete mathematical model has been formalised with comprehensive loading constraints and there are still some real-world factors ignored in the existing studies. In this paper, we consider a more realistic 3L-SDVRP model with restricted access provided by the 2021 HUAWEI Logistics Competition, which is different from existing problem models in two aspects. First, this problem considers the total travel cost and average loading rate simultaneously. Second, this problem has additional constraints related to certain special pickup points. These differences make existing optimisation approaches not directly applicable. A major contribution of this paper is the formal mathematical model developed for this new 3L-SDVRP. In addition, we propose a genetic algorithm with an efficient fitness evaluation. The proposed algorithm has been demonstrated to significantly outperform the baseline solver provided by the competition in solving the problem instances from the competition and the ones adapted from benchmark datasets of related problems.

3L-SDVRP capacitated vehicle routing problem 3D packing splitting delivery combinatorial optimisation

第一 ; 通讯

英语

CPCI-S ; EI

National Natural Science Foundation of China[61906083]

Computer Science ; Engineering ; Operations Research & Management Science ; Mathematics

Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic ; Operations Research & Management Science ; Mathematics, Applied

WOS:000824464300148

20221011761146

Genetic algorithms ; Loading ; Vehicle routing

Materials Handling Methods:691.2 ; Combinatorial Mathematics, Includes Graph Theory, Set Theory:921.4 ; Optimization Techniques:921.5

人工提交

1.南方科技大学，斯发基斯可信自主系统研究院
2.南方科技大学，计算机科学与工程系
3.School of Engineering and Computer Science, Victoria University of Wellington

Pei JY,Hu CP,Liu JL,et al. Bi-Objective Splitting Delivery VRP with Loading Constraints and Restricted Access[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2021:01-09.