A comprehensive study of vehicle routing problem with time windows using an improved multi-objective evolutionary algorithms
Abstract
The vehicle routing problem with time windows (VRPTW) which has both capacity and time constraints is an extension of vehicle routing problem (VRP). The problem is solved by optimizing routes for the vehicles so as to meet all given constraints as well as to minimize travelling distance and number of vehicles. This paper proposes to analyze a multi objective evolutionary algorithm (MOEA) that incorporates Various heuristics for local exploitation in the evolutionary search and the concept of pareto’s optimality to solve multi objective optimization in VRPTW. In this paper we model VRPTW as a modified version specialized for a multi objective context, using Evolutionary Algorithm to get a set of pareto optimal solutions considering three objectives, the number of vehicles, the total travel distance and the total delivery time at the same time. This new approach is validated with very good results and the comparison is performed on a standard benchmark problems showing that the algorithm outperforms highly competitive results compared with previously published studies.
Copyright ©2024 JMCS