A tabu search with gradual evolution process

The paper investigates a new framework for executing tabu search (TS).The framework changes the nature of the problem dynamically during optimization run.The basic idea is inspired by the recent viral transmission incidents.Numerical experiments showed interesting results. We investigate a new framework for executing tabu search (TS). A unique aspect of this framework is that it performs multiple small-scale TS runs iteratively to identify the most promising area of the feasible region before executing the final TS run. The basic idea is inspired by recent viral transmission incidents, which showed that a virus would often go through an indirect and gradual evolution process to transform itself into a new form. Numerical experiments conducted with randomly-generated vehicle routing instances demonstrate interesting results.

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

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

[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]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[5]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

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

[7]  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..

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

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

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

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

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

[13]  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..

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

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