Title
A Hybrid Multiobjective Memetic Algorithm for Multiobjective Periodic Vehicle Routing Problem With Time Windows
Abstract
Periodic vehicle routing problem with time windows (PVRPTWs) is an important combinatorial optimization problem that can be applied in different fields. It is essentially a multiobjective optimization problem due to the problem nature. In this paper, a typical multiobjective PVRPTW with five objectives is first defined and new nonsymmetric real-world multiobjective PVRPTW instances are generated. Then, a hybrid multiobjective memetic algorithm is proposed for solving multiobjective PVRPTW. In the proposed algorithm, a two-phase strategy is devised to improve the comprehensive performance in terms of the convergence and diversity. In this strategy, several extreme solutions near an approximate Pareto front (PF) are identified at Phase I, and then the approximate PF is extended at Phase II. The proposed algorithm is extensively tested on both real-world instances and traditional instances. Experiment results show that the proposed algorithm outperforms two representative competitor algorithms on most of the instances. The effectiveness of the two-phase strategy is also confirmed.
Year
DOI
Venue
2020
10.1109/TSMC.2018.2861879
IEEE Transactions on Systems, Man, and Cybernetics: Systems
Keywords
DocType
Volume
Optimization,Delays,Approximation algorithms,Convergence,Biological cells,Search problems,Memetics
Journal
50
Issue
ISSN
Citations 
11
2168-2216
5
PageRank 
References 
Authors
0.38
43
5
Name
Order
Citations
PageRank
Jiahai Wang160449.01
Wenbin Ren250.38
Zizhen Zhang310017.27
Han Huang4223.38
Yuren Zhou572149.79