The Life Span Method — a new variant of local search —

In this paper, we present a variant of local search, namely the Life Span Method (LSM), for generic combinatorial optimization problems. The LSM can be seen as a variation of tabu search introduced by Glover [18, 19]. We outline applications of the LSM to several combinatorial optimization problems such as the maximum stable set problem, the traveling salesman problem, the quadratic assignment problem, the graph partitioning problem, the graph coloring problem, and the job-shop scheduling problem.

[1]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[2]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[3]  F. Glover.  Tabu Search Fundamentals and Uses , 1995 .

[4]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 2000, Springer Berlin Heidelberg.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[13]  Michel Gendreau,et al.  Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..

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

[15]  Alain Hertz,et al.  Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph , 1990, Comput. Oper. Res..

[16]  Katsuki Fujisawa,et al.  Experimental Analyses of the Life Span Method for the Maximum Stable Set Problem , 1995 .

[17]  N. E. Collins,et al.  Simulated annealing - an annotated bibliography , 1988 .

[18]  Zbigniew Michalewicz,et al.  Evolutionary Computation and Heuristics , 1996 .

[19]  Sheldon Howard Jacobson,et al.  Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control , 1996 .

[20]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[21]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[22]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[23]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[24]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[25]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[26]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[27]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[28]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[29]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[30]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[31]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[32]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[33]  Béla Bollobás,et al.  Random Graphs , 1985 .

[34]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[35]  K. Fujisawa.  Experimental Analyses of the Life Span Method for the Quadratic Assignment Problem , 1995 .

[36]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[37]  Katsuki Fujisawa,et al.  An Application of Tabu Search to the Graph Partitioning Problem and its Experimental Analysis , 1994 .

[38]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[39]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[40]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..