A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material

In the open vehicle routing problem (OVRP), the objective is to minimize the number of vehicles and the total distance (or time) traveled. This study primarily focuses on solving an open vehicle routing problem (OVRP) by applying a novel hybrid genetic algorithm and the Tabu search (GA-TS), which combines the GA's parallel computing and global optimization with TS's Tabu search skill and fast local search. Firstly, the proposed algorithm uses natural number coding according to the customer demands and the captivity of the vehicle for globe optimization. Secondly, individuals of population do TS local search with a certain degree of probability, namely, do the local routing optimization of all customer sites belong to one vehicle. The mechanism not only improves the ability of global optimization, but also ensures the speed of operation. The algorithm was used in Zhengzhou Coal Mine and power Supply Co., Ltd.'s transport vehicle routing optimization.

[1]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[2]  Christos D. Tarantilis,et al.  Distribution of fresh meat , 2002 .

[3]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[4]  Fred Glover,et al.  Artificial intelligence, heuristic frameworks and tabu search , 1990 .

[5]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[6]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

[7]  Bruce L. Golden,et al.  The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..

[8]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[9]  Emmanouil E. Zachariadis,et al.  An open vehicle routing problem metaheuristic for examining wide solution neighborhoods , 2010, Comput. Oper. Res..

[10]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[11]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[12]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[13]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[14]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[15]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[16]  Mingyong Lai,et al.  The open vehicle routing problem with fuzzy demands , 2010, Expert Syst. Appl..

[17]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[18]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[19]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[20]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.