An Or-opt NSGA-II algorithm for multi-objective Vehicle Routing Problem with Time Windows

This paper focuses on a multi-objective model of Vehicle Routing Problem with Time Windows (VRPTW), where the total distance, the vehicle number, and the time penalty of customers are taken into account. NSGA-II has been performed as an efficient algorithm in solving multi-objective problems, and the Or-opt heuristic is well-known as one of the classic optimization algorithms. A hybrid algorithm involving both two algorithms above is introduced in this article. Data from the distribution center in Utica (Michigan, US.) has been tested with this hybrid algorithm in MATLAB. Faster running speed has been proved and some improvements in solutions have been shown.

[1]  Kay Chen Tan,et al.  A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems , 2006, Eur. J. Oper. Res..

[2]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

[3]  Aravind Seshadri,et al.  A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II , 2000 .

[4]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[5]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[6]  Kazutoshi Sakakibara,et al.  A Multiobjectivization Approach for Vehicle Routing Problems , 2007, EMO.

[7]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[8]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[9]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[10]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[11]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[12]  Jeng-Jong Lin,et al.  A GA-based Multi-Objective Decision Making for Optimal Vehicle Transportation , 2008, J. Inf. Sci. Eng..

[13]  Nicolas Jozefowiez,et al.  Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem , 2002, PPSN.

[14]  Ronald H. Ballou,et al.  Research perspectives in vehicle routing and scheduling , 1986 .

[15]  Gilbert Laporte,et al.  Improvements to the Or-opt heuristic for the symmetric travelling salesman problem , 2007, J. Oper. Res. Soc..

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[17]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[18]  Lawrence Bodin,et al.  Twenty Years of Routing and Scheduling , 1990, Oper. Res..

[19]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[20]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[21]  Tadahiko Murata,et al.  Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions , 2005 .

[22]  Nicolas Jozefowiez,et al.  Enhancements of NSGA II and Its Application to the Vehicle Routing Problem with Route Balancing , 2005, Artificial Evolution.

[23]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.