Parallel Hybrid Metaheuristics

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 347-370

  Cotta, Carlos ^a,b   Talbi, El Ghazali ^c,d   Alba, Enrique ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b Campus de Teatinos   (Spain)

^c UNIV LILLE   (France)

^d ECOLE CENTRALE DE LILLE   (France)

Author keywords

Approximation algorithms; Historical notes; Multiple solution search algorithms; Parallel hybrid metaheuristics; Single solution search algorithms

Indexed keywords

EID: 33750089347     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch15     Document Type: Chapter

References (140)

1. E. H. L. Aarts, F. M. I. De Bont, J. H. A. Habers, and P. J. M. Van Laarhoven. Parallel implementations of the statistical cooling algorithms. Integration, 4:209-238,1986.
2. E. H. L. Aarts and M. G. A. Verhoeven. Genetic local search for the traveling salesman problem. In T. Back, D.B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionavy Computation, pages G9.5: 1-7. Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997.
3. F. Abbattista, N. Abbattista, and L. Caponetti. An evolutionary and cooperative agent model for optimization. In IEEE Int. Conf. on Evolutionary Computation ICEC'95, pages 668-671, Perth, Australia, Dec 1995.
4. P. Adamidis and V. Petridis. Co-operating populations with different evolution behaviours. In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, pages 188-191, Nagoya, Japan, May 1996.
5. E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Diaz, I. Dorta, J. Gabarro, J. Gonzalez, C. Leon, L. Moreno, J. Petit, J. Roda, A. Rojas, and F. Xhafa. Mallba: A library of skeletons for combinatorial optimisation. In B. Monien and R. Feldman, editors, Euro-Par 2002 Parallel Processing, volume 2400 of Lecture Notes in Computer Science, pages 927-932. Springer-Verlag, Berlin Heidelberg, 2002.
6. E. Alba, C. Cotta, F. Chicano, and A.J. Nebro. Parallel evolutionary algorithms in telecommunications: Two case studies. In Proceedings of the CACIC'02, Buenos Aires, Argentina, 2002.
7. E. Alba and J.M. Troya. Influence of the migration policy in parallel distributed GAS with structured and panmictic populations. Applied Intelligence, 12(3): 163-181,2000.
8. D. Aldous and U. Vazirani. "Go with the winners" algorithms. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 492-501, Los Alamitos, CA, 1994. IEEE.
9. T. Asveren and P. Molitor. New crossover methods for sequencing problems. In H-M.Voigt, W. Ebeling, I. Rechenberg, and H-P. Schewefel, editors, Parallel Problem Solving from Nature PPSN4, volume 1141 of LNCS, pages 290-299, Dortmund, Germany, Sept 1996. Springer-Verlag.
10. V. Bachelet, Z. Hafidi, P. Preux, and E-G. Talbi. Diversifying tabu search by genetic algorithms. In INFORMS'98 on Operations Research and Management Sciences meeting, Montreal, Canada, Apr 1998.
11. V. Bachelet, P. Preux, and E-G. Talbi. Parallel hybrid meta-heuristics: application to the quadratic assignment problem. In Parallel Optimization Colloquium POC96, pages 233-242, Versailles, France, Mar 1996.
12. P. Badeau, M. Gendreau, F. Guertin, J-Y. Potvin, and E. Taillard. A parallel tabu search heuristic for the vehicle routing problem with time windows. RR CRT-95-84, Centre de Recherche sur les Transports, Universiti de Montrial, Canada, Dec 1995.
13. P. Badeau, F. Guertin, M. Gendreau, J-Y. Potvin, and E. D. Taillard. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research, 5(2): 109-122, 1997.
14. P. Banerjee and M. Jones. A parallel simulated annealing algorithm for standard cell placement on a hypercube computer. In IEEE Int. Con$ on Computer-Aided Design, pages 34-37, Santa Clara, California, USA, Nov 1986.
15. R. Bianchini and C. Brown. Parallel genetic algorithms on distributed-memory architectures. Technical Report 436, University of Rochester, Rochester, NY, USA, Aug 1992.
16. D. E. Brown, C. L. Huntley, and A. R. Spillane. A parallel genetic heuristic for the quadratic assignment problem. In Third Int. Con$ on Genetic Algorithms ICGA'89, pages 406-415. Morgan Kauffmann, San Mateo, California, USA, July 1989.
17. A. Casotto, F. Romeo, and A. L. Sangiovanni-Vincentelli. A parallel simulated annealing algorithm for the placement of macro-cells. In ZEEE Int. Con$ on Computer-Aided Design, pages 30-33, Santa Clara, California, USA, Nov 1986.
18. J. Chakrapani and J. Skorin-Kapov. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research, 41: 327-341, 1993.
19. H. Chen and N. S. Flann. Parallel simulated annealing and genetic algorithms:A space of hybrid methods. In Y. Davidor, H-P. Schwefel, and R. Manner, editors, Third Con$ on Parallel Problem Solving from Nature, pages 428-436, Jerusalem, Israel, Oct 1994. Springer-Verlag.
20. P. C. Chu. A genetic algorithm approach for combinatorial optimization problems. PhD thesis, University of London, London, UK, 1997.
21. J. Cohoon, S. Hedge, W. Martin, and D. Richards. Distributed genetic algorithms for the floorplan design problem. IEEE Trans. on Computer-Aided Design, 10(4):483-492, Apr 1991.
22. A. Colomi, M. Dorigo, and V. Maniezzo. Distributed optimization by ant colonies. In European Con$ on Artijicial Life, pages 134-142. Elsevier Publishing, 1991.
23. D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, 1999.
24. C. Cotta. A study of hybridisation techniques and their application to the design of evolutionary algorithms. AI Communications, 11(3-4):223-224, 1998.
25. C. Cotta, E. Alba, R. Sagarna, and P. Larraiiaga. Adjusting weights in artificial neural networks using evolutionary algorithms. In P. Larraiiaga and J.A. Lozano, editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pages 350-373. Kluwer Academic Publishers, Boston MA, 2001.
26. C. Cotta, J.F. Aldana, A.J. Nebro, and J.M. Troya. Hybridizing genetic algorithms with branch and bound techmques for the resolution of the TSP. In D.W. Pearson, N.C. Steele, and R.F. Albrecht, editors, Artificial Neural Nets and Genetic Algorithms 2, pages 277-280, Wien New York, 1995. Springer-Verlag.
27. C. Cotta and P. Moscato. Evolutionary computation: Challenges and duties. In A. Menon, editor, Frontiers of Evolutionaiy Computation, pages 53-72. Kluwer Academic Publishers, Boston MA, 2004.
28. C. Cotta and J. Muruzabal. Towards a more efficient evolutionary induction of bayesian networks. In J.J. Merelo et al., editors, Parallel Problem Solving From Nature VII, volume 2439 of Lecture Notes in Computer Science, pages 730-739. Springer-Verlag, Berlin, 2002.
29. C. Cotta and J.M. Troya. Genetic forma recombination in permutation flowshop problems. Evolutionary Computation, 6(1):25-44, 1998.
30. C. Cotta and J.M. Troya. A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In G.D. Smith, N.C. Steele, and R.F. Albrecht, editors, Artificial Neural Nets and Genetic Algorithms 3, pages 251-255, Wien New York, 1998. Springer-Verlag.
31. C. Cotta and J.M. Troya. Embedding branch and bound within evolutionary algorithms. Applied Intelligence, 18(2): 137-153, 2003.
32. T. G. Crainic, M. Toulouse, and M. Gendreau. Towards a taxonomy ofparallel tabu search algorithms. Technical Report CRT-933, Centre de Recherche sur les Transports, Universite de Montreal, Montreal, Canada, Sep 1993.
33. T. G. Crainic and M. Gendreau. A cooperative parallel tabu search for capacitated network design. Technical Report CRT-97-27, Centre de recherche sur les transports, Universite de Montreal, Montreal, Canada, Canada, 1997.
34. T. G. Crainic, A. T. Nguyen, and M. Gendreau. Cooperative multi-thread parallel tabu search with evolutionary adaptive memory. 2nd Int. Con6 on Metaheuristics, Sophia Antipolis, France, July 1997.
35. T. G. Crainic, M. Toulouse, and M. Gendreau. Synchronous tabu search parallelization strategies for multi-commodity location-allocation with balancing requirements. OR Spektrum, 17: 113-123, 1995.
36. W. Crompton, S. Hurley, and N.M. Stephen. A parallel genetic algorithm for frequency assignment problems. In Proceedings of IMACS SPRAN"94, pages 81-84, 1994.
37. V-D. Cung, T. Mautor, P. Michelon, and A. Tavares. Recherche dispersee parallele. In Deuxi2me Congrts de la SociPt6 Francnise de Recherche Operationnelle et d'Aide a la decision ROADEF'99, Autrans, France, Jan 1999.
38. L.D. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New YorkNY, 1991.
39. R. Dawkins. The Selfish Gene. Clarendon Press, Oxford, 1976.
40. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1998.
41. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SZAM Journal on Computing, 24(4):873-921, August 1995.
42. S. Droste, T. Jansen, and I. Wegener. Perhaps not a free lunch but at least a free appetizer. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jahela, and R. E. Smith, editors, Proceedings of the First Genetic and Evolutionaly Computation Conference (GECCO '99), pages 833-839, San Francisco CA, 13-17 1999. Morgan Kaufmann Publishers, Inc.
43. I. De Falco, R. Del Balio, and E. Tarantino. Solving the mapping problem by parallel tabu search. In IASTED Conf, Paris, France, 1994.
44. I. De Falco, R. Del Balio, and E. Tarantino. An analysis of parallel heuristics for task allocation in multicomputers. Computing, 3, 59 1995.
45. I. De Falco, R. Del Balio, E. Tarantino, and R. Vaccaro. Improving search by incorporating evolution principles in parallel tabu search. In Znt. Conf on Machine Learning, pages 823-828, 1994.
46. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109-133, 1995.
47. T. A. Feo, M. G. C. Resende, and S. H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42:860-878. 1994.
48. T. A. Feo, K. Venkatraman, and J.F. Bard. A GRASP for a difficult single machine scheduling problem. Computers and Operations Research, 18: 635-643, 1991.
49. C-N. Fiechter. A parallel tabu search algorithm for large travelling salesman problems. Discrete Applied Mathematics, 51 :243-267, 1994.
50. C. Fleurant and J. A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63: 437-461, 1996.
51. C. Fleurent and J. A. Ferland. Genetic hybrids for the quadratic assignment problem. DZMACS Series in Discrete Mathematics and Theoretical Computer Science, 16: 173-188, 1994.
52. S-M. Foo. An approach of combining simulated annealing and genetic algorithm. Master's thesis, University of Illinois, Urbana-Champaign, 1991.
53. A. P. French, A. C. Robinson, and J. M. Wilson. Using a hybrid geneticaigorithmlbranch and bound approach to solve feasibility and optimization integer programming problems. Journal of Heuristics, 7(6): 551-564, 2001.
54. M.R. Garey and D.S Johnson. Computers and Intractability: A Guide to the Theoly of NP-Completeness. Freeman and Co., San Francisco CA, 1979.
55. F. Glover. Heuristics for integer programming using surrogate constraints. Decision Sciences, 8: 156-166, 1977.
56. F. Glover. Tabu search-part I. ORSA Journal of Computing, 1(3): 190-206, 1989.
57. F. Glover. Scatter search and path relinking. In D. Come, M. Dorigo, and F. Glover, editors, New Methods in Optimization, pages 291-316. McGraw-Hill, London, 1999.
58. F. Glover and G. Kochenberger. Handbook ofMetaheuristics. Kluwer Academic Publishers, Boston MA, 2003.
59. M. Gorges-Schleuter. ASPARAGOS: An asynchronous parallel genetic optimization strategy. In J. David Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 422-427. Morgan Kaufmann Publishers, 1989.
60. M. Hifi. A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems. Journal of the Operational Research Society, 48(6): 612-622, 1997.
61. D. S. Hochbaum. Approximation algorithms for NP-hardproblems. International Thomson Publishing, 1996.
62. T. Hogg and C. P. Williams. Solving the really hard problems with cooperative search. In Proc. of AAAI93, pages 231-236, Menlo Park, CA, 1993. AAAI Press.
63. J. H. Holland. Adaptation in natural and artijicial systems. Michigan Press University, Ann Arbor, MI, USA, 1975.
64. C. L. Huntley and D. E. Brown. Parallel genetic algorithms with local search. Technical Report IPC-TR-90-006, University of Virginia, Charlottesville, VA, USA, July 1991.
65. C. L. Huntley and D. E. Brown. A parallel heuristic for quadratic assignment problems. Computers and Operations Research, 18: 275-289, 1991.
66. P. Husbands, F. Mill, and S. Warrington. Genetic algorithms, production plan optimisation and scheduling. In H-P. Schewefel and R. Manner, editors, Parallel Problem Solving From Nature, volume 496 of LNCS, pages 80-84, Dortmund, Germany, Oct 1990. Springer-Verlag.
67. T. Ichimura and Y. Kuriyama. Learning of neural networks with parallel hybrid ga using a royal road function. In 1998 IEEE International Joint Conference on Neural Networks, volume 2, pages 1131-1136, New York, NY, 1998. IEEE.
68. P. Jog, J. Y. Suh, and D. Van Gucht. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In 3rd Int. ConJ Genetic Algorithms. Morgan Kaufmann, USA, 1989.
69. J.D. Kelly and L. Davis. A hybrid genetic algorithm for classification. In Proceedings of the Twelveth International Joint Conference on Artificial Intelligence, pages 645-650, Sidney, Australia, 1991. Morgan Kaufmann.
70. J.D. Kelly and L. Davis. Hybridizing the genetic algorithm and the k-nearest neighbors classification algorithm. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 377-383, San Diego, CA, 1991. Morgan Kaufmann.
71. H. Kim, Y. Hayashi, and K. Nara. The performance of hybridized algorithm of genetic algorithm simulated annealing and tabu search for thermal unit maintenance scheduling. In 2nd IEEE Con$ on Evolutionary Computation ICEC'95, pages 114-119, Perth, Australia, Dec 1995.
72. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, May 1983.
73. J. Koza and D. Andre. Parallel genetic programming on a network of transputers. Technical Report CS-TR-95-1542, Stanford University, 1995.
74. J. R. Koza. Geneticprogramming. MIT Press, Cambridge, USA, 1992.
75. B. Kroger, P. Schwenderling, and O. Vornberger. Parallel genetic packing of rectangles. In H-P. Schwefel and R. Manner, editors, Parallel Problem solving f;om nature, volume 496 of LNCS, pages 160-164, Dortmund, Germany, Oct 1990. Springer-Verlag.
76. B. Kroger, P. Schwenderling, and O. Vornberger. Genetic paclung of rectangles on transputers. In P. Welch et al., editor, Transputing 91. 10s Press, 1991.
77. M. Krueger. Methodes d 'analyse d'algorithmes d 'optimisation stochastiques a 1 'aide d 'algorithmes gendtiques. PhD thesis, Ecole Nationale Superieure des TClCcommunications, Paris, France, Dec 1993.
78. M. Laguna and R. Marti. Scatter Search. Methodology and Implementations in C. Kluwer Academic Publishers, Boston MA, 2003.
79. P. Larraiiaga and J.A. Lozano. Estimation of Distribution Algorithms. A New Tool for Evolutionavy Computation. Kluwer Academic Publishers, Boston MA, 2001.
80. G. Von Laszewski and H. Muhlenbein. Partitioning a graph with parallel genetic algorithm. In H-P. Schwefel and R. Manner, editors, Parallel Problem solving from nature, volume 496 of LNCS, pages 165-169, Dortmund, Germany, Oct 1990. Springer-Verlag.
81. E. L. Lawler. Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, USA, 1976.
82. K-G. Lee and S-Y. Lee. Efficient parallelization of simulated annealing using multiple markov chains: An application to graph partitioning. In T. N. Mudge, editor, Int. Con$ on Parallel Processing, pages 177-180. CRC Press, 1992.
83. D. Levine. A parallel genetic algorithm ,for the set partitioning problem. PhD thesis, Argonne National Laboratory, Illinois Institute of Technology, Argonne, USA, May 1994.
84. D. Levine. A parallel genetic algorithm for the set partitioning problem. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 23-35. Kluwer Academic Publishers, 1996.
85. F. T. Lin, C. Y. Kao, and C. C. Hsu. Incorporating genetic algorithms into simulated annealing. Proc. of the Fourth Int. Symp. on AI, pages 290-297, 1991.
86. M. Lozano, F. Herrera, N. Krasnogor, and D. Molina. Real-coded memetic algorithms with crossover hill-climbing. Evolutionary Computation, 12(3):273-302,2004.
87. S. W. Mahfoud and D. E. Goldberg. Parallel recombinative simulated annealing:A genetic algorithm. Parallel computing, 21: 1-28, 1995.
88. M. Malek, M. Guruswamy, M. Pandya, and H. Owens. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of Operations Research, 21 :59-84, 1989.
89. C. E. Mariano and E. Morales. A multiple objective ant-q algorithm for the design of water distribution irrigation networks. In First International Workshop on Ant Colony Optimization ANTS '98, Bruxelles, Belgique, Oct 1998.
90. O. C. Martin and S. W. Otto. Combining simulated annealing with local search heuristics. Annals of Operations Research, 6357-75, 1996.
91. O. C. Martin, S. W. Otto, and E. W. Felten. Large-step markov chains for the TSP:Incorporating local search heuristics. Operation Research Letters, 11 :219-224, 1992.
92. Z. Michalewicz. A hierarchy of evolution programs: An experimental study. Evolutionary Computation, 1(1):51-76, 1993.
93. Z. Michalewicz. Decoders. In T. Back, D.B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages C5.3: 1-3. Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997.
94. D. Montana and L. Davis. Training feedforward neural networks using genetic algorithms. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 762-767, San Mateo, CA, 1989. Morgan Kaufmann.
95. P. Moscato. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA, 1989.
96. P. Moscato. Memetic algorithms: A short introduction. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 219-234. McGraw-Hill, 1999.
97. P. Moscato and C. Cotta. A gentle introduction to memetic algorithms. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 105-144. Kluwer Academic Publishers, Boston MA, 2003.
98. P. Moscato, C. Cotta, and A. Mendes. Memetic algorithms. In G.C. Onwubolu and B.V. Babu, editors, New Optimization Techniques in Engineering, pages 53-85. Springer-Verlag, Berlin Heidelberg, 2004.
99. P. Moscato and M.G. Norman. A memetic approach for the traveling salesman problem: Implementation of a computational ecology for combinatorial optimization on message-passing systems. In M. Valero, E. Onate, M. Jane, J.L. Lamba, and B. Suarez, editors, Parallel Computing and Transputer Applications, pages 187-194. 10s Press, Amsterdam, 1992.
100. H. Muhlenbein, M. Gorges-Schleuter, and O. Kramer. Evolution Algorithms in Combinatorial Optimization. Parallel Computing, 7: 65-88, 1988.
101. H. Muhlenbein, M. Schomisch, and J. Born. The parallel genetic algorithm as function optimizer. Parallel Computing, 17: 619-632, 1991.
102. Y. Nagata and S. Kobayashl. Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In T. Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, East Lansing, EUA, pages 450-457, San Mateo, CA, 1997. Morgan Kaufmann.
103. S. Niar and A. Freville. A parallel tabu search algorithm for the 0-1 multidimensional knapsack problem. In Int. Parallel Processing Symposium, Geneva, Switzerland, 1997. IEEE Society.
104. H.P. Nii. Blackboard systems, part one: The blackboard model of problem solving and the evolution of blackboard architectures. AIMagazine, 7(2): 38-53, 1986.
105. V. Nissen. Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Networks, 5(1):66-72, Jan 1994.
106. M.G. Norman and P. Moscato. A competitive and cooperative approach to complex combinatorial search. Technical Report Caltech Concurrent Computation Program, Report. 790, California Institute of Technology, Pasadena, California. USA, 1989. Expanded version published at the Proceedings of the 20th Informatics and Operations Research Meeting, Buenos Aires (20th JAIIO), Aug. 1991, pp. 3.15-3.29.
107. U-M. O'Reilly and F. Oppacher. Hybridized crossover-based techniques for program discovery. In IEEE Int. Con$ on Evolutionary Computation ICEC'95, pages 573-578, Perth, Australia, Dec 1995.
108. I. H. Osman and G. Laporte. Metaheuristics: A bibliography. Annals of Operations Research, 63:513-628, 1996.
109. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
110. M. Peinado and T. Lengauer. Parallel "go with the winners algorithms" in the LogP Model. In IEEE Computer Society Press, editor, Proceedings of the 11th International Parallel Processing Symposium, pages 656-664. Los Alamitos, California, 1997.
111. C. B. Pettey, M. R. Leuze, and J. J. Grefenstette. A parallel genetic algorithm. Proc. of the Second Int. Con[ on Genetic algorithms, MIX Cambridge, pages 155-161, July 1987.
112. S. C. S. Porto and C. Ribeiro. Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. Journal of Heuristics, 1(2): 207-223, 1996.
113. W.J. Pullan. Structure prediction of benzene clusters using a genetic algorithm. Journal of Chemical Information and Computer Sciences, 37(6): 1189-1193, 1997.
114. N.J. Radcliffe and P.D. Suny. Fitness Variance of Formae and Performance Prediction. In L.D. Whitley and M.D. Vose, editors, Proceedings of the Third Workshop on Foundations of Genetic Algorithms, pages 51-72, San Francisco, 1994. Morgan Kaufmann.
115. I. Rechenberg. Evolutionsstrategie : Optimierung technischer systeme nach prizipien der biologischen evolution. Formann-Holzboog Verlag, Stuttgart, Germany, 1973. Scientific Publications, Oxford, UK, 1993.
116. C. R. Reeves. Modern heuristic techniques for combinatorialproblems. Black Scientific Publications, Oxford, UK, 1993.
117. C. Rego and C. Roucairol. A parallel tabu search algorithm for the vehicle routing problem. In I. H. Osman and J. P. Kelly, editors, Meta-Heuristics:Theoly and Applications, pages 253-295. Kluwer, Nonvell, MA, USA, 1996.
118. J. S. Rose, D. R. Blythe, W. M. Snelgrove, and Z. G. Vranecic. Fast, high quality VLSI placement on a MIMD multiprocessor. In IEEE Int. Conf on Computer-Aided Design, pages 42-45, Santa Clara, Nov 1986.
119. F. Rothlauf, Representations for Genetic and Evolutionaly Algorithms. Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg New York, 2002.
120. D.E. Rumelhart, G.E. Hinton, and R.J. Williams. Learning representations by backpropagating errors. Nature, 323 : 533-536, 1986.
121. K. Shahookar and P. Mazumder. A genetic approach to standard cell placement using meta-genetic parameter optimization. IEEE Trans. on Computer-Aided Design, 9(5):500-511, May 1990.
122. P. M. Sloot, J. A. Kandorp, and A. Schoneveld. Dynamic complex systems: A new approach to parallel computing in computational physics. Technical Report TR-CS-95-08, University of Amsterdam, Netherlands, 1995.
123. R.H. Storer, S.D. Wu, and R. Vaccari. New search spaces for sequencing problems with application to job-shop scheduling. Management Science, 38: 1495-1509, 1992.
124. T. Stutzle and H. H. Hoos. The MAX-MIN ant system and local search for combinatorial optimization problems: Towards adaptive tools for global optimization. In 2nd Int. Conf on Metaheuristics, pages 191-193, Sophia Antipolis, France, July 1997. INRIA.
125. J. Y. Suh and D. Van Gucht. Incorporating heuristic information into genetic search. In 2rd Int. Con$ Genetic Algorithms, pages 100-107. Lawrence Erlbaum Associates, USA, 1987.
126. E. Taillard. Parallel iterative search methods for vehicle routing problem. Networks, 23: 661-673, 1993.
127. E. D. Taillard and L. Gambardella. Adaptive memories for the quadratic assignment problem. Technical Report 87-97, IDSIA, Lugano, Switzerland, 1997.
128. E.-G. Talbi. A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8(5):541-564,2002.
129. E. G. Talbi, T. Muntean, and I. Samarandache. Hybridation des algorithmes genetiques avec la recherche tabou. In Evolution Artificielle EA94, Toulouse, France, Sep 1994.
130. S. Talukdar, L. Baerentzen, A. Gove, and P. de Souza. Asynchronous teams:Cooperation schemes for autonomous agents. Journal of Heuristics, 4(4):295-321,1998.
131. S.N. Talukdar, S.S. Pyo, and T. Giras. Asynchronous procedures for parallel processing. IEEE Transactions on PAS, PAS-102(11), 1983.
132. R. Tanese. Parallel genetic algorithms for a hypercube. Proc. ofthe Second Int. Conf: on Genetic algorithms, MIZ Cambridge, MA, USA, pages 177-183, July '1987.
133. J. Thiel and S. Voss. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR, 32(4):226-242, Nov 1994.
134. N. L. J. Ulder, E. H. L. Aarts, H-J. Bandelt, P. J. M. Van Laarhoven, and E. Pesch. Genetic local search algorithms for the traveling salesman problem. In H-P. Schewefel and R. Manner, editors, Parallel Problem Solving From Nature, volume 496 ofLNCS, pages 109-116, Dortmund, Germany, Oct 1990. Springer-Verlag.
135. H-M. Voigt, J. Born, and I. Santibanez-Koref. Modelling and simulation of distributed evolutionary search processes for function optimization. In H-P. Schwefel and R. Manner, editors, Parallel Problem solving from nature, volume 496 of LNCS, pages 373-380, Dortmund, Germany, Oct 1990. Springer-Verlag.
136. S. Voss. Network optimizationproblems, chapter Tabu search: Applications and prospects, pages 333-353. World Scientific, USA, 1993.
137. L-H. Wang, C-Y. Kao, M. Ouh-young, and W-C. Chen. Molecular binding: A case study of the population-based annealing genetic algorithms. In IEEE Int. Con$ on Evolutionary Computation ICEC'95, pages 50-55, Perth, Australia, Dec 1995.
138. D. Whitley. Functions as permutations: Implications for no free lunch, walsh analysis and summary statistics. In Marc Schoenauer, Kalyanmoy Deb, Gunter Rudolph, Xin Yao, Evelyne Lutton, Juan Julian Merelo, and Hans-Paul Schwefel, editors, Parallel Problem Solving from Nature-PPSN VI, pages 169-178, Berlin, 2000. Springer.
139. D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997.
140. C.R. Zacharias, M.R. Lemes, and A.D. Pino. Combining genetic algorithm and simulated annealing: a molecular geometry optimization study. THEOCHEM Journal ofMolecular Structure, 430(29-39), 1998.