A comprehensive study of vehicle routing problem with time windows using an improved multi-objective evolutionary algorithms

V. Bugcy Mettilda, N. Meenal

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.

Full Text: PDF

Published: 2021-05-19

How to Cite this Article:

V. Bugcy Mettilda, N. Meenal, A comprehensive study of vehicle routing problem with time windows using an improved multi-objective evolutionary algorithms, J. Math. Comput. Sci., 11 (2021), 3927-3948

Copyright © 2021 V. Bugcy Mettilda, N. Meenal. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS