An Incremental Evolutionary Approach to Tabu Search

Based on recent viral transmission events in the swine species, we present a new framework to implement and execute tabu search (TS). The framework mimics the gradual evolutionary process observed when certain flu viruses move from one host population to another. It consists of three steps: (1) executing TS on a smaller subset of the original problem, (2) using one of its promising solutions as an initial solution for a marginally larger problem, and (3) repeating this process until the original problem is reached and solved. Numerical experiments conducted with randomly-generated vehicle routing instances demonstrate interesting results.

[1]  Pablo Cortés,et al.  A viral system algorithm to optimize the car dispatching in elevator group control systems of tall buildings , 2013, Comput. Ind. Eng..

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

[3]  Toshio Fukuda,et al.  Virus-evolutionary genetic algorithm with subpopulations: application to trajectory generation of redundant manipulator through energy optimization , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[4]  Song-Yop Hahn,et al.  A study on comparison of optimization performances between immune algorithm and other heuristic algorithms , 1998 .

[5]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[6]  Yuchun Xu,et al.  Development of a fuel consumption optimization model for the capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[7]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[8]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[9]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[10]  Michael Rubinovitch.  A Probabilistic Model for Optimal Project Scheduling , 1972, Oper. Res..

[11]  C. Hall Barbosa,et al.  Image reconstruction of spherical inclusions in ferromagnetic structures using the generalized inverse , 1998 .

[12]  Hitoshi Kanoh,et al.  Solving real-world vehicle routing problems with time windows using virus evolution strategy , 2010, Int. J. Knowl. Based Intell. Eng. Syst..

[13]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[14]  Shiyou Yang,et al.  An improved Tabu search for the global optimizations of electromagnetic devices , 2001 .

[15]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[16]  Yoshinori Suzuki,et al.  A tabu search with gradual evolution process , 2016, Comput. Ind. Eng..