期刊
SWARM AND EVOLUTIONARY COMPUTATION
卷 39, 期 -, 页码 310-322出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.swevo.2017.11.001
关键词
Multi-objective VRPTW; Pateto optimal front; Tissue P system; PDVA; DGEM; VNEM
资金
- National Natural Science Foundation of China [61179032]
- Special Scientific Research Fund of Food Public Welfare Profession of China [201513004-3]
- Research and Practice Project of Graduate Education Teaching Reform of Wuhan Polytechnic University [YZ2015002]
- Humanities and Social Sciences Fund Project of Hubei Provincial Education Department [17Y071]
Multi-objective vehicle routing problem with time windows (VRPTW) has important applications in engineering and computer science, and it is a NP-hard problem. In the last decade, numerous new methods for multi objective VRPTW have sprung up. However, the calculation speed of most algorithms is not fast enough, and on the other hand, these algorithms did not give a complete Pareto optimal front, although their results are excellent. Hence, in this paper, a tissue P system with three cells based MOEA, termed PDVA, is proposed to solve the multi-objective VRPTW. In PDVA, two mechanisms, the discrete glowworm evolution mechanism (DGEM) and the variable neighborhood evolution mechanism (VNEM), are used as sub-algorithms in two cells respectively to balance the exploration and exploitation reasonably. Simultaneously, some special strategies are used to enhance the performance of the proposed algorithm. The following experiments are presented to test the proposed algorithm. First, the influence of the parameters on the performance of the algorithm is investigated. Second, the validity of the algorithm is highlighted when compared to the DGEM-VNEM algorithm. Third, the quality and diversity of the solutions are improved when compared to the other popular algorithms. These results and comparisons on test instances demonstrate the competitiveness of PDVA in solving multi-objective VRPTW in terms of both quantity and speed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据