共 31 条
A Multi-Objective Learning Whale Optimization Algorithm for Open Vehicle Routing Problem with Two-Dimensional Loading Constraints
被引:3
作者:
Zhang, Yutong
[1
]
Li, Hongwei
[2
]
Wang, Zhaotu
[3
]
Wang, Huajian
[4
]
机构:
[1] Kunming Univ Sci & Technol, Fac Sci, Kunming 650032, Peoples R China
[2] Huaxin Consulting Co Ltd, Hangzhou 430074, Peoples R China
[3] Northeastern Univ, Sch Minor Educ, Shenyang 110819, Peoples R China
[4] Qufu Normal Univ, Coll Engn, Rizhao 276826, Peoples R China
来源:
关键词:
open vehicle routing problem;
two-dimensional loading problem;
multi-objective learning whale optimization algorithm;
three-dimensional probability matrix;
TABU SEARCH;
D O I:
10.3390/math12050731
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
With the rapid development of the sharing economy, the distribution in third-party logistics (3PL) can be modeled as a variant of the open vehicle routing problem (OVRP). However, very few papers have studied 3PL with loading constraints. In this work, a two-dimensional loading open vehicle routing problem with time windows (2L-OVRPTW) is described, and a multi-objective learning whale optimization algorithm (MLWOA) is proposed to solve it. As the 2L-OVRPTW is integrated by the routing subproblem and the loading subproblem, the MLWOA is designed as a two-phase algorithm to deal with these subproblems. In the routing phase, the exploration mechanisms and learning strategy in the MLWOA are used to search the population globally. Then, a local search method based on four neighborhood operations is designed for the exploitation of the non-dominant solutions. In the loading phase, in order to avoid discarding non-dominant solutions due to loading failure, a skyline-based loading strategy with a scoring method is designed to reasonably adjust the loading scheme. From the simulation analysis of different instances, it can be seen that the MLWOA algorithm has an absolute advantage in comparison with the standard WOA and other heuristic algorithms, regardless of the running results at the scale of 25, 50, or 100 datasets.
引用
收藏
页数:24
相关论文