Selected Algorithmic Techniques for Parallel Optimization

The use of parallel algorithms for solving computationally hard problems becomes attractive as parallel systems, consisting of a collection of powerful processors, offer large computing power and memory storage capacity. Even though parallelism will not be able to overdue the assumed worst case exponential time or memory complexity of those problems (unless an exponential number of processors is used) [11], the average execution time of heuristic search algorithms which find good suboptimal solutions for many hard problems is polynomial. Consequently, parallel systems, possibly with hundreds or thousands of processors, give us the perspective of efficiently solving relatively large instances of hard problems.

[1]  Dirk Van Gucht,et al.  Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..

[2]  Panos M. Pardalos,et al.  Parallel Search for Combinatorial Optimization : Genetic Algorithms , Simulated Annealing , Tabu Search and GRASP ? , 1995 .

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

[4]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[5]  Edward Roe,et al.  Microcanonical optimization applied to visual processing , 1995 .

[6]  Vipin Kumar,et al.  General Branch and Bound, and its Relation to A and AO , 1984, Artif. Intell..

[7]  Bernard Mans.  Contribution a l'algorithmique non numerique parallele : parallelisation de methodes de recherche arborescentes , 1992 .

[8]  Panos M. Pardalos,et al.  Parallel Processing of Discrete Optimization Problems , 1995 .

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

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

[11]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[12]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[13]  Afonso Ferreira,et al.  Parallel best-first branch-and-bound in discrete optimization: a framework , 1995, Solving Combinatorial Optimization Problems in Parallel.

[14]  Richard M. Karp,et al.  A randomized parallel branch-and-bound procedure , 1988, STOC '88.

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

[16]  R. P. Ma,et al.  A dynamic load balancer for a parallel branch and bound algorithm , 1989, C3P.

[17]  Jonathan Eckstein,et al.  Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 , 1994, SIAM J. Optim..

[18]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[19]  J. Pekny,et al.  Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem , 1989 .

[20]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Per S. Laursen.  Parallel heuristic search - Introductions and a new approach , 1996, Solving Combinatorial Optimization Problems in Parallel.

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

[24]  L. Darrell Whitley,et al.  Optimization Using Distributed Genetic Algorithms , 1990, PPSN.

[25]  Per S. Laursen.  Simple Approches to Parallel Branch and Bound , 1993, Parallel Comput..

[26]  Richard M. Karp,et al.  Randomized parallel algorithms for backtrack search and branch-and-bound computation , 1993, JACM.

[27]  Afonso Ferreira,et al.  A Distributed Implementation of Asynchronous Parallel Branch and Bound , 1995 .

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

[29]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

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

[31]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[32]  Bernard Manderick,et al.  A Massively Parallel Genetic Algorithm: Implementation and First Analysis , 1991, ICGA.

[33]  L. G. Mitten.  Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[34]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[35]  Akihiko Konagaya,et al.  A Fine-Grained Parallel Genetic Algorithm for Distributed Parallel Systems , 1993, ICGA.

[36]  Panos M. Pardalos,et al.  Parallelized Heuristics for Combinatorial Search , 1997 .

[37]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

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

[39]  Vipin Kumar,et al.  Parallel Best-First Search of State-Space Graphs: A Summary of Results , 1988, AAAI.

[40]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[41]  Júlio S. Aude,et al.  Parallel simulated annealing: an adaptive approach , 1997, Proceedings 11th International Parallel Processing Symposium.

[42]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[43]  Reinhard Lüling,et al.  Load balancing for distributed branch & bound algorithms , 1992, Proceedings Sixth International Parallel Processing Symposium.

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

[45]  Reinhard Männer,et al.  Implementation of Standard Genetic Algorithm on MIMD Machines , 1994, PPSN.

[46]  George G. Robertson,et al.  Parallel Implementation of Genetic Algorithms in a Classifier Rystem , 1987, ICGA.

[47]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[48]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[49]  Celso C. Ribeiro,et al.  Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints , 1996, J. Heuristics.

[50]  Vipin Kumar,et al.  Efficient parallel algorithms for search problems: applications in VLSI CAD , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[51]  Benjamin W. Wah,et al.  Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.

[52]  Jens Clausen,et al.  Do Inherently Sequential Branch-and-Bound Algorithms Exist? , 1994, Parallel Process. Lett..

[53]  Toshihide Ibaraki,et al.  The Power of Dominance Relations in Branch-and-Bound Algorithms , 1977, JACM.

[54]  Joseph F. Pekny,et al.  A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems , 1992, Math. Program..

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

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

[57]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[58]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[59]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[60]  Michael Creutz,et al.  Microcanonical Monte Carlo Simulation , 1983 .

[61]  Afonso Ferreira,et al.  On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms , 1995, Parallel Process. Lett..

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

[63]  L. N. Kanal,et al.  The CDP: A unifying formulation for heuristic search, dynamic programming, and branch-and-bound , 1988 .

[64]  Jonathan Eckstein.  Control strategies for parallel mixed integer branch and bound , 1994, Proceedings of Supercomputing '94.

[65]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.