Local search algorithms for combinatorial problems - analysis, improvements, and new applications

Hochschulkennziffer D17 iv Acknowledgments There are several important periods in our life. The transition between these periods sometimes is smooth and softly; sometimes the end of a period marked is by some event. In the scientific life one such event is the defense of the PhD thesis. This book represents the outcome of a three years period of research efforts and is the summary of my contributions as an individual researcher ... or is it really? When taking a glance back, the outcome of this research has strongly been influenced by many people who accompanied me during the whole or part of the work in my private and academic life. Therefore, is this also the occasion to very warmly thank these people and to acknowledge their support. In the first place I thank my parents with all my heart. They have given me continuous support during all the years, have guided me through the early years of my life, and always have provided a stable environment. In the same breath I deeply thank my dearest partner Josefina Santangelo for sharing the recent years of my life with me. Living together with her has been a great pleasure and she has influenced me very positively all over these years. For the research work in the recent years the personal and scientific interaction with Holger Hoos has been most stimulating, for what I'm very indebted to him. We had a marvelous time discussing common research issues, working together on several projects, and writing joint papers. Research would have been less fun without him. I very warmly thank my thesis adviser Prof. Wolfgang Bibel for the support during and after this work, for providing the necessary scientific freedom to carry out this research, and for his patience during this time. I am also very grateful to Hesham Khalil who has been of invaluable help in the later stages of writing this thesis. This thesis would not be the way it is without his support. I also like to thank very much the current and the past members of the Intellectics Group for many interesting discussions and their help during this time; in particular I like to thank I am also indepted to Marco Dorigo for the comments on my first papers, interesting discussions on ant colony optimization, and especially for the excellent time and the very fruitful cooperation during my stay at IRIDIA …

[1]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[2]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[3]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[4]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[5]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[6]  Vittorio Maniezzo,et al.  Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[7]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[8]  Kenneth Dean Boese,et al.  Models for iterative global optimization , 1996 .

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

[10]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[11]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[12]  Thomas Stützle,et al.  Evaluating Las Vegas Algorithms: Pitfalls and Remedies , 1998, UAI.

[13]  Jakob Krarup,et al.  Computer-aided layout design , 1978 .

[14]  Karl Ernst Osthaus.  Van de Velde , 1920 .

[15]  Alain Hertz,et al.  A TUTORIAL ON TABU SEARCH , 1992 .

[16]  Rainer E. Burkard,et al.  Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..

[17]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[18]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[19]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[20]  Jin-Kao Hao,et al.  Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.

[21]  Andrew J. Parkes,et al.  Tuning Local Search for Satisfiability Testing , 1996, AAAI/IAAI, Vol. 1.

[22]  Holger H. Hoos,et al.  Characterizing the Run-time Behavior of Stochastic Local Search , 1998 .

[23]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[24]  Norman M. Sadeh,et al.  Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..

[25]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

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

[28]  Hans W. Guesgen,et al.  A Perspective of Constraint-Based Reasoning , 1992, Lecture Notes in Computer Science.

[29]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[30]  Tad Hogg,et al.  Expected Gains from Parallelizing Constraint Solving for Hard Problems , 1994, AAAI.

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

[32]  Fred W. Glover,et al.  Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..

[33]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[34]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[35]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

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

[37]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[38]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[39]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[40]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

[41]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[42]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[43]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[44]  R. Dechter.  to Constraint Satisfaction , 1991 .

[45]  Peter Brucker,et al.  Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..

[46]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[47]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.

[48]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[49]  Ron Shonkwiler,et al.  Parallel Genetic Algorithms , 1993, ICGA.

[50]  Thomas Stützle.  Lokale Suchverfahren für Constrain Satisfaction Probleme: die min conflicts Heuristik und Tabu Search , 1997, Künstliche Intell..

[51]  Roberto Battiti,et al.  Reactive Search, a history-based heuristic for MAX-SAT , 1996 .

[52]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[53]  Holger H. Hoos,et al.  Characterising the behaviour of stochastic local search , 1999 .

[54]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

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

[56]  John N. Hooker,et al.  Needed: An Empirical Science of Algorithms , 1994, Oper. Res..

[57]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[58]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[59]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[60]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[61]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

[62]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[63]  A. Mobius,et al.  COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.

[64]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[65]  William M. Spears,et al.  Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.

[66]  Wansoo T. Rhee.  A note on asymptotic properties of the quadratic assignment problem , 1988 .

[67]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[68]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[69]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[70]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[71]  Giorgio Ausiello,et al.  Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .

[72]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[73]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[74]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[75]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[76]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[77]  Holger H. Hoos,et al.  GSAT versus Simulated Annealing , 1994, ECAI.

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

[79]  Roberto Battiti,et al.  Approximate Algorithms and Heuristics for MAX-SAT , 1998 .

[80]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[81]  Holger H. Hoos,et al.  Improving the Ant System: A Detailed Report on the MAX-MIN Ant System , 1996 .

[82]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[83]  Thomas Stützle,et al.  Tabu Search vs. Random Walk , 1997, KI.

[84]  M. Gorges-Schleuter.  Asparagos96 and the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[85]  Irina Rish,et al.  Summarizing CSP Hardness with Continuous Probability Distributions , 1997, AAAI/IAAI.

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

[87]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[88]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[89]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[90]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[91]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[92]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[93]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[94]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[95]  Nigel Dodd,et al.  Slow annealing versus multiple fast annealing runs - an empirical investigation , 1990, Parallel Comput..

[96]  ČernýV..  Thermodynamical approach to the traveling salesman problem , 1985 .

[97]  Nobuhiro Yugami,et al.  Improving Repair-Based Constraint Satisfaction Methods by Value Propagation , 1994, AAAI.

[98]  Alvin C. M. Kwan,et al.  Validity of Normality Assumption in CSP Research , 1996, PRICAI.

[99]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[100]  David S. Johnson,et al.  Data structures for traveling salesmen , 1993, SODA '93.

[101]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

[102]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[103]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[104]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[105]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[106]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[107]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

[108]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

[109]  Martina Gorges-Schleuter,et al.  Explicit Parallelism of Genetic Algorithms through Population Structures , 1990, PPSN.

[110]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[111]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[112]  G. R. Schreiber,et al.  Cut Size Statistics of Graph Bisection Heuristics , 1999, SIAM J. Optim..

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

[114]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[115]  Holger H. Hoos,et al.  A Characterization of GSAT's Performance on a Class of Hard Structured Problems , 1996 .

[116]  Toby Walsh,et al.  Local Search and the Number of Solutions , 1996, CP.

[117]  Eugene C. Freuder,et al.  Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.

[118]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[119]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[120]  R. Brady.  Optimization strategies gleaned from biological evolution , 1985, Nature.

[121]  Helena Ramalhinho Dias Lourenço,et al.  Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem , 1996 .

[122]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[123]  Michel Gendreau,et al.  Toward a Taxonomy of Parallel Tabu Search Heuristics , 1997, INFORMS J. Comput..

[124]  Luca Maria Gambardella,et al.  Results of the first international contest on evolutionary optimisation (1st ICEO) , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[125]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[126]  Ravindra K. Ahuja,et al.  Use of Representative Operation Counts in Computational Testing of Algorithms , 1996, INFORMS J. Comput..

[127]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[128]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[129]  Christos H. Papadimitriou,et al.  The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..

[130]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[131]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[132]  Roberto Battiti,et al.  Parallel biased search for combinatorial optimization: genetic algorithms and TABU , 1992, Microprocess. Microsystems.

[133]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

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

[135]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[136]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[137]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[138]  Marco Dorigo,et al.  From Natural to Artificial Swarm Intelligence , 1999 .

[139]  Bart Selman,et al.  Algorithm Portfolio Design: Theory vs. Practice , 1997, UAI.

[140]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

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

[142]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[143]  Vassilis Zissimopoulos,et al.  Autocorrelation Coefficient for the Graph Bipartitioning Problem , 1998, Theor. Comput. Sci..

[144]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[145]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[146]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[147]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[148]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[149]  David Zuckerman,et al.  Optimal Speedup of Las Vegas Algorithms , 1993, Inf. Process. Lett..

[150]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[151]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[152]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .

[153]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[154]  John W. Dickey,et al.  Campus building arrangement using topaz , 1972 .

[155]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[156]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[157]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[158]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[159]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[160]  Tim Walters,et al.  Repair and Brood Selection in the Traveling Salesman Problem , 1998, PPSN.

[161]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

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

[163]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[164]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[165]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[166]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[167]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[168]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[169]  Giovanni Manzini,et al.  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..

[170]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[171]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[172]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

[173]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[174]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[175]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[176]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[177]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[178]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[179]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[180]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[181]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[182]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[183]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[184]  Volker Nissen,et al.  Solving the quadratic assignment problem with clues from nature , 1994, IEEE Trans. Neural Networks.

[185]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[186]  Mark W. Krentel,et al.  Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[187]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[188]  Bernd Freisleben,et al.  New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.

[189]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

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

[191]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

[192]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[193]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[194]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[195]  Thomas Stützle,et al.  Improvements on the Ant-System: Introducing the MAX-MIN Ant System , 1997, ICANNGA.

[196]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[197]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.

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

[199]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[200]  Rainer E. Burkard,et al.  Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..

[201]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[202]  Emile H. L. Aarts,et al.  Sequential and parallel local search algorithms for job shop scheduling , 1997 .

[203]  Erwin Pesch,et al.  Genetic Local Search in Combinatorial Optimization , 1994, Discret. Appl. Math..

[204]  Frank Werner,et al.  On the heuristic solution of the permutation flow shop problem by path algorithms , 1993, Comput. Oper. Res..

[205]  R. Battiti,et al.  Simulated annealing and Tabu search in the long run: A comparison on QAP tasks☆ , 1994 .

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

[207]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[208]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[209]  A. Cohen.  An Introduction to Probability Theory and Mathematical Statistics , 1979 .

[210]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[211]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[212]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[213]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

[214]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[215]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[216]  William E. Hart,et al.  A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing , 1995, Evolutionary Programming.

[217]  Richard J. Wallace,et al.  Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems , 1996, CP.

[218]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[219]  Ulrich Faigle,et al.  Some Convergence Results for Probabilistic Tabu Search , 1992, INFORMS J. Comput..

[220]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[221]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[222]  Andrew B. Kahng,et al.  Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods , 1995, INFORMS J. Comput..

[223]  David R. Karger,et al.  Near-optimal intraprocedural branch alignment , 1997, PLDI '97.

[224]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[225]  Dirk Van Gucht,et al.  Incorporating Heuristic Information into Genetic Search , 1987, International Conference on Genetic Algorithms.