期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 176, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2021.114779
关键词
Evolutionary algorithms; Multiobjective optimization; Nondominated sorting genetic algorithm II; Vehicle routing problem with time windows
类别
资金
- Council of Scientific & Industrial Research, Government of India
- Basic Science Research Program through the National Research Foundation of Korea (NRF) - Ministry of Education, Science and Technology [NRF2018R1A1A1A05079524]
This paper proposes a nondominated sorting genetic algorithm II approach to address the vehicle routing problem with time windows, known for its multiobjective characteristics. The performance of this approach is evaluated on standard benchmark instances, showing its superiority over the state-of-the-art approach for the problem.
Vehicle routing problem with time windows (VRPTW) is a pivotal problem in logistics domain as it possesses multiobjective characteristics in real-world applications. Literature contains a general multiobjective VRPTW (MOVRPTW) with five objectives along with MOVRPTW benchmark instances that are derived from real-world data. In this paper, we have proposed a nondominated sorting genetic algorithm II (NSGA-II) based approach with objective-specific variation operators to address the MOVRPTW. In the proposed NSGA-II approach, the crossover and mutation operators are designed by exploiting the problem characteristics as well as the attributes of each objective. The performance of the proposed approach is evaluated on the standard benchmark instances of the problem and compared with the state-of-the-art approach available in literature. The computational results demonstrate the superiority of our approach over the state-of-the-art approach for the MOVRPTW.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据