4.7 Article

Hybrid multiobjective evolutionary algorithm considering combination timing for multi-type vehicle routing problem with time windows

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 171, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2022.108435

关键词

Multiobjective evolutionary algorithm; Vehicle routing problem with time windows; Multi-type vehicle; Hybrid algorithm; Combination timing

资金

  1. National Natural Science Foundation of China [U1904107, 61772173]
  2. Innovative Funds Plan of Henan University of Technology [2020ZKCJ02]
  3. Science & Technology Research Project of Henan Province [202102210131]
  4. Innovative Research Team (in Science and Technology) in University of Henan Province [21IRTSTHN018]
  5. Zhengzhou Science and Technology Collaborative Innovation Project [21ZZXTCX19]
  6. Ministry of Education
  7. Japan Society of Promotion of Science (JSPS) [19K12148]

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

This study proposes a hybrid multiobjective evolutionary algorithm based on combination timing to solve the multi-type vehicle routing problem with time windows. The algorithm combines global search and local search in different evolutionary stages to achieve the goal of minimizing the number of vehicles and wasting time simultaneously.
Vehicle routing problem (VRP) has been a classical combinatorial optimization challenge, which has been extensively investigated in recent decades. As a VRP typical variant, multi-type vehicle routing problem with time windows (MT-VRPTW) has been concerned with multiple types of heterogeneous fleets of vehicles, within the delivery time window and limited capacity constraints. For such complicated multiobjective optimization problems, hybrid multiobjective evolutionary algorithm (HMOEA) has become an effective method, however, the research on hybrid algorithms and combination timing is still challenging. This study proposes a hybrid multiobjective evolutionary algorithm based on combination timing (HMOEA-CT) to solve MT-VRPTW with the criteria of minimizing the number of vehicles and wasting time simultaneously. The HMOEA-CT combines a fast convergence in multiple directions (FCMDs)-based global search and a problem-specific difference (PSD)-based local search in different evolutionary stages. The FCMD is assumed to be the global exploration search strategy, which converges faster at the center and edge regions of the Pareto front. The PSD is used to improve the local exploitation search ability by directing poor-performing individuals closer to better-performing individuals. Furthermore, the PSD cooperates with FCMD at the right time according to the different evolutionary stages to improve efficiency. Experimental results on Solomon benchmark problems demonstrate the competitive performance comparison of the HMOEA-CT with traditional multiobjective evolutionary algorithms.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据