摘要
This paper addresses a variant of the vehicle routing problem with time windows where the goal is to maximize the quality of service delivered to the customer. In the literature, this problem contains three objectives targeted at improving the quality of service. In this paper, we have proposed two evolutionary approaches, viz., a steady-state grouping genetic algorithm and a discrete differential evolution algorithm, to address this problem. The crossover and mutation operators are designed by considering the characteristics of each objective. The proposed approaches are incorporated with various heuristics that provide a set of better initial solutions in comparison to purely random initial solutions. We have also proposed two bounds for each objective. The approaches presented in this paper are tested on the Solomon instances which are considered as the standard benchmark instances for the vehicle routing problem with time windows in the literature. The proposed approaches are compared with the state-of-the-art approach available in the literature. The computational results demonstrate that our approaches are better in terms of solution quality and execution time than the state-of-the-art approach.
学科与关键词
- NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windowsSrivastava, Gaurav; Singh, Alok; Mallipeddi, Rammohan*EXPERT SYSTEMS WITH APPLICATIONS, 2021, 176: 114779.被引 57
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windowsTan, KC; Chew, YH; Lee, LHComputational Optimization and Applications, 2006, 34(1): 115-151.被引 162
- Solving many-objective delivery and pickup vehicle routing problem with time windows with a constrained evolutionary optimization algorithmOu, Junwei; Liu, Xiaolu*; Xing, Lining; Lv, Jimin; Hu, Yaru; Zheng, Jinhua; Zou, Juan; Li, MengjunEXPERT SYSTEMS WITH APPLICATIONS, 2024, 255: 124712.
