Advertisement

Journal of Heuristics

, Volume 8, Issue 5, pp 541–564 | Cite as

A Taxonomy of Hybrid Metaheuristics

  • E.-G. Talbi
Article

Abstract

Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in the literature. In this paper, a taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms. The taxonomy, while presented in terms of metaheuristics, is also applicable to most types of heuristics and exact optimization algorithms.

As an illustration of the usefulness of the taxonomy an annoted bibliography is given which classifies a large number of hybrid approaches according to the taxonomy.

taxonomy combinatorial optimization metaheuristics hybrid algorithms parallel algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E.H.L., F.M.I. De Bont, J.H.A. Habers, and P.J.M. Van Laarhoven. (1986). “Parallel Implementations of the Statistical Cooling Algorithms.” Integration 4, 209–238.Google Scholar
  2. Abbattista, F., N. Abbattista, and L. Caponetti. (1995). “An Evolutionary and Cooperative Agent Model for Optimization.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 668–671.Google Scholar
  3. Abramson, D., P. Logothetis, A. Postula, and M. Randall. (1997). “Application Specific Computers for Combinatorial Optimisation.” In The Australien Computer Architecture Workshop, Sydney, Australia.Google Scholar
  4. Abramson, D.A. (1992). “A Very High Speed Architecture to Support Simulated Annealing.” IEEE Computer 25, 27–34.Google Scholar
  5. Ackley, D.H. (1987). A Connectionist Machine for Genetic Hillclimbing. Boston, USA: Kluwer Academic Pub.Google Scholar
  6. Adamidis, P. and V. Petridis. (1996). “Co-Operating Populations with Different Evolution Behaviours.” In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 188–191.Google Scholar
  7. Andreatta, A.A. and C.C. Ribeiro. (1994). “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinatorial Circuits.” Operations Research 50, 1–36.Google Scholar
  8. Areibi, S. and A. Vannelli. (1994). “Advanced Search Techniques for Circuit Partitioning.” DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 77–97.Google Scholar
  9. Asveren, T. and P. Molitor. (1996). “New Crossover Methods for Sequencing Problems.” In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4, Vol. 1141 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 290–299.Google Scholar
  10. Bachelet, V., Z. Hafidi, P. Preux, and E.-G. Talbi. (1998). “Diversifying Tabu Search by Genetic Algorithms.” In INFORMS'98 on Operations Research and Management Sciences Meeting, Montréal, Canada.Google Scholar
  11. Bachelet, V., P. Preux, and E.-G. Talbi. (1996). “Parallel Hybrid Meta-heuristics: Application to the Quadratic Assignment Problem.” In Parallel Optimization Colloquium POC96, Versailles, France, pp. 233–242.Google Scholar
  12. Badeau, P., M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard. (1995). “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.” RR CRT-95-84, Centre de Recherche sur les Transports, Universitè de Montréal, Canada.Google Scholar
  13. Badeau, P., F. Guertin, M. Gendreau, J.-Y. Potvin, and E.D. Taillard. (1997). “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.” Transportation Research 5(2), 109–122.Google Scholar
  14. Banerjee, P. and M. Jones. (1986). “A Parallel Simulated Annealing Algorithm for Standard Cell Placement on a Hypercube Computer.” In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, California, USA, pp. 34–37.Google Scholar
  15. Becker, S. and Y. Le Cun. (1988). “Improving the Convergence of Back-Propagation Learning with Second-Order Methods.” In D. Touretzky, G. Hinton, and T. Sejnowski (eds.), Connectionist Models Summer School, Pittsburgh, USA, Morgan Kaufmann.Google Scholar
  16. Belding, T. (1995). “The Distributed Genetic Algorithm Revisted.” In D. Eshelmann (ed.), Sixth Int. Conf. on Genetic Algorithms. San Mateo, CA, Morgan Kaufmann.Google Scholar
  17. Belew, R.K., J. McInerny, and N.N. Schraudolph. (1991). “Evolving Networks: Using Genetic Algorithms with Connectionist Learning.” In C.G. Langton, C. Taylor, J.D. Doyne Farmer, and S. Rasmussen (eds.), Second Conf. on Artificial Life, Addison-Wesley, USA, pp. 511–548.Google Scholar
  18. Bianchini, R. and C. Brown. (1992). “Parallel Genetic Algorithms on Distributed-Memory Architecturers,” Technical Report 436, University of Rochester, Rochester, NY, USA.Google Scholar
  19. Boese, K.D., A.B. Kahng, and S. Muddu. (1994). “NewAdaptive Multi-Start Techniques for Combinatorial Global Optimizations.” Operation Research Letters 16(2), 101–113.Google Scholar
  20. Bohnenberger, O., J. Hesser, and R. Manner. (1995). “Automatic Design of Truss Structures Using Evolutionary Algorithms” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 143–147.Google Scholar
  21. Braun, H. (1990). “On Solving Traveling Salesman Problems by Genetic Algorithms.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature, Vol 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 129–133.Google Scholar
  22. Brown, D.E., C.L. Huntley, and A.R. Spillane. (1989). “A Parallel Genetic Heuristic for the Quadratic Assignment Problem.” In Third Int. Conf. on Genetic Algorithms ICGA'89, San Mateo, California, USA: Morgan Kauffmann, pp. 406–415.Google Scholar
  23. Bruns, R. (1995). “Integration of Constraint Solving Techniques in Genetic Algorithms.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 33–38.Google Scholar
  24. Bui, T.N. and B.R. Moon. (1994). “A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem.” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Special Issue on Quadratic Assignment and Related Problems 16, 99–116.Google Scholar
  25. Calégari, P., G. Coray, A. Hertz, D. Kobler, and P. Kuonen. (1999). “A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization.” Journal of Heuristics 5(2), 145–158.Google Scholar
  26. Casotto, A., F. Romeo, and A.L. Sangiovanni-Vincentelli. (1986). “A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells.” In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, California, USA, pp. 30–33.Google Scholar
  27. Chak, C.K. and G. Feng. (1995). “Accelerated Genetic Algorithms: Combined with Local Search Techniques for Fast and Accurate Global Search.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 378–383.Google Scholar
  28. Chakrapani, J. and J. Skorin-Kapov. (1993). “Massively Parallel Tabu Search for the Quadratic Assignment Problem.” Annals of Operations Research 41, 327–341.Google Scholar
  29. Charon, I. and O. Hudry. (1993). “The Noising Method: A New Method for Combinatorial Optimization.” Operations Research Letters 14, 133–137.Google Scholar
  30. Chen, H. and N.S. Flann. (1994). “Parallel Simulated Annealing and Genetic Algorithms: A Space of Hybrid Methods.” In Y. Davidor, H.-P. Schwefel, and R. Manner (eds.), Third Conf. on Parallel Problem Solving from Nature. Jerusalem, Israel, Berlin: Springer-Verlag, pp. 428–436.Google Scholar
  31. Chu, P.C. (1997). “A Genetic Algorithm Approach for Combinatorial Optimization Problems.” PhD Thesis, University of London, London, UK.Google Scholar
  32. Chvatal, V. (1979). “A Greedy Heuristic for the Set Covering Problem.” Mathematics of Operations Research 4(3), 233–235.Google Scholar
  33. Cohoon, J., S. Hedge, W. Martin, and D. Richards. (1987). “Punctuated Equilibria: A Parallel Genetic Algorithm” In J.J. Grefenstette (ed.), Second Int. Conf. on Genetic Algorithms. Cambridge, MA, USA: MIT, pp. 148–154.Google Scholar
  34. Cohoon, J., S. Hedge, W. Martin, and D. Richards. (1991). “Distributed Genetic Algorithms for the Floorplan Design Problem.” IEEE Trans. on Computer-Aided Design 10(4), 483–492.Google Scholar
  35. Cohoon, J.P., W.N. Martin, and D.S. Richards. (1990). “Genetic Algorithms and Punctuated Equilibria.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 134–141.Google Scholar
  36. Cohoon, J.P., W.N. Martin, and D.S. Richards. (1991). “A Multi-Population Genetic Algorithm for Solving the k-Partition Problem on Hypercubes.” In R.K. Belew and L.B. Booker (eds.), Fourth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 244–248.Google Scholar
  37. Colorni, A., M. Dorigo, and V. Maniezzo. (1991). “Distributed Optimization by Ant Colonies.” In European Conf. on Artificial Life. Elsevier Publishing, pp. 134–142.Google Scholar
  38. Crainic, T.D., M. Toulouse, and M. Gendreau. (1993). “Towards a Taxonomy of Parallel Tabu Search Algoithms.” Technical Report CRT-933, Centre de Recherche sur les Transports, Université deMontréal, Montréal, Canada.Google Scholar
  39. Crainic, T.G., and M. Gendreau. (1997). “A Cooperative Parallel Tabu Search for Capacitated Network Design,” Technical Report CRT-97-27, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada.Google Scholar
  40. Crainic, T.G., A.T. Nguyen, and M. Gendreau. (1997). “Cooperative Multi-Thread Parallel Tabu Search with Evolutionary Adaptive Memory.” In 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France.Google Scholar
  41. Crainic, T.G., M. Toulouse, and M. Gendreau. (1995). “Synchronous Tabu Search Parallelization Strategies for Multi-Commodity Location-Allocation with Balancing Requirements.” OR Spektrum, 17, 113–123.Google Scholar
  42. Cung, V-D., T. Mautor, P. Michelon, and A. Tavares. (1997). “A Scatter Search Based Approach for the Quadratic Assignment Problem.” In IEEE Int. Conf. on Evolutionary Computation ICEC'97, Indianapolis, USA.Google Scholar
  43. Cung, V.-D., T. Mautor, P. Michelon, and A. Tavares. (1999). “Recherche Dispersée Parallèle.” In Deuxième Congrés de la Socièté Francaise de Recherche Opératinnelle et d'Aide à la décision ROADEF'99, Autrans, France.Google Scholar
  44. Davis, L. (1985). “Job-Shop Scheduling with Genetic Algorithms.” In J.J. Grefenstette (ed.), Int. Conf. on Genetic Algorithms and their Applications, Pittsburgh, pp. 136–140.Google Scholar
  45. Dozier, G., J. Bowen, and D. Bahler. (1995). “Solving Randomly Generated Constraint Satisfaction Problems Using a Micro-Evolutionary Hybrid that Evolves a Population of Hill-Climbers.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 614–619.Google Scholar
  46. Duvivier, D., P. Preux, and E.G. Talbi. (1996). “Climbing up NP-Hard Hills.” In The Fourth Int. Conf. on Parallel Problem Solving From Nature. Berlin, Germany: Springer-Verlag, LNCS No. 1141, pp. 574–583.Google Scholar
  47. East, I.R. and J. Rowe. (1996). “Effects of Isolation in a Distributed Population Genetic Algorithm.” In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4. Vol. 1141 of LNCS, Dortmund, Germany: Springer-Verlag, pp. 408–419.Google Scholar
  48. Fahlman, S.E. (1988). “Faster-Learning Variations on Back-Propagation: An Empirical Study.” In D. Touretzky, G. Hinton, and T. Sejnowsk (eds.), Connectionist Models Summer School, Pittsburgh, PA, USA, San Mateo, CA: Morgan Kaufmann, pp. 38–51.Google Scholar
  49. De Falco, I., R. Del Balio, and E. Tarantino. (1994). “Solving the Mapping Problem by Parallel Tabu Search.” In IASTED Conf., Paris, France.Google Scholar
  50. De Falco, I., R. Del Balio, and E. Tarantino. (1995). “An Analysis of Parallel Heuristics for Task Allocation in Multicomputers.” Computing 3, 59.Google Scholar
  51. De Falco, I., R. Del Balio, E. Tarantino, and R. Vaccaro. (1994). “Improving Search by Incorporating Evolution Principles in Parallel Tabu Search.” In Int. Conf. on Machine Learning, pp. 823–828.Google Scholar
  52. Feo, T.A. and M.G.C. Resende. (1995). “Greedy Randomized Adaptive Search Procedures.” Journal of Global Optimization 6, 109–133.Google Scholar
  53. Feo, T.A., M.G.C. Resende, and S.H. Smith. (1994). “A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.” Operations Research 42, 860–878.Google Scholar
  54. Feo, T.A., K. Venkatraman, and J.F. Bard. (1991). “A GRASP for a Difficult Single Machine Scheduling Problem.” Computers and Operations Research 18, 635–643.Google Scholar
  55. Fiechter, C.-N. (1994). “A parallel Tabu Search Algorithm for Large Travelling Salesman Problems.” Discrete Applied Mathematics. Google Scholar
  56. Fleurent, C. and J.A. Ferland. (1994a). “Genetic Hybrids for the Quardratic Assignment Problem.” DI-MACS Series in Discrete Mathematics and Theoretical Computer Science 16, 173–188.Google Scholar
  57. Fleurent, C. and J.A. Ferland. (1994b). “Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability.” DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, 619–652.Google Scholar
  58. Fleurant, C. and J.A. Ferland. (1996). “Genetic and Hybrid Algorithms for Graph Coloring.” Annals of Operations Research 63.Google Scholar
  59. Foo, S.-M. (1991). “An Approach of Combining Simulated Annealing and Genetic Algorithm.” Master's Thesis, University of Illinois, Urbana-Champaign.Google Scholar
  60. Fourman, M.P. (1985). “Compaction of Symbolic Layout Using Genetic Algorithms.” In J.J. Grefenstette (ed.), Int. Conf. on Genetic Algorithms and their Applications, Pittsburgh, pp. 141–153.Google Scholar
  61. Freisleben, B. and P. Merz. (1996). “A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems.” In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 616–621.Google Scholar
  62. Glover, F. (1977). “Heuristics for Integer Programming using Surrogate Constraints.” Decision Sciences 8, 156–166.Google Scholar
  63. Glover, F. (1989). “Tabu Search-Part I.” ORSA Journal of Computing 1(3), 190–206.Google Scholar
  64. Gorges-Schleuter, M. (1989). “Asparagos, an Asynchronous Parallel Genetic Optimization Strategy.” In 3rd Int. Conf. Genetic Algorithms. Morgan Kaufmann, USA. pp. 422–427.Google Scholar
  65. Grefenstette, J.J., (1987). “Incorporating Problem Specific Knowledge into Genetic Algorithms.” In L. Davis (ed.), Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence, San Mateo, CA, USA: Morgan Kaufmann, pp. 42–60.Google Scholar
  66. Hancock, P.J.B. and L.S. Smith. (1990). “Gannet: Genetic Design of a Neural Net for Face Recognition.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 292–296.Google Scholar
  67. Hart, W.E. (1994). “Adaptive Global Optimization with Local Search.” PhD Thesis, University of California, San Diego.Google Scholar
  68. Heijligers, M.J.M. and J.A.G. Jess. (1995). “High-Level Synthesis Scheduling and Allocation Using Genetic Algorithms Based on Conctructive Topological Scheduling Techniques.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 56–61.Google Scholar
  69. Hentenryck, V.P. (1989). Constraint Satisfaction in Logic Programming. MIT Press.Google Scholar
  70. Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI, USA: Michigan Press University.Google Scholar
  71. Huntley, C.L. and D.E. Brown. (1991a). “Parallel Genetic Algorithms with Local Search.” Technical Report IPC-TR-90-006, University of Virginia, Charlottesvile, VA, USA.Google Scholar
  72. Huntley, C.L. and D.E. Brown. (1991b). “A Parallel Heuristic for Quadratic Assignment Problems.” Computers and Operations Research 18, 275–289.Google Scholar
  73. Husbands, P., F. Mill, and S. Warrington. (1990). “Genetic Algorithms, Production Plan Optimisation and Scheduling.” In H.-P. Schewefel and R. Manner (eds.), Parallel Problem Solving From Nature, Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 80–84.Google Scholar
  74. Iba, H. (1996). “Emergent Cooperation for Multiple Agents Using Genetic Programming.” In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schewefel (eds.), Parallel Problem Solving from Nature PPSN4, Vol. 1141 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 32–41.Google Scholar
  75. Ishibuchi, H. and T. Murata. (1996). “Multi-Objective Genetic Local Search Algorithm.” In IEEE Int. Conf. on Evolutionary Computation, ICEC'96, Nagoya, Japan, pp. 119–124.Google Scholar
  76. Jog, P., J.Y. Suh, and D. Van Gucht. (1989). “The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem.” In 3rd Int. Conf. Genetic Algorithms, Morgan Kaufmann, USA.Google Scholar
  77. Kim, H., Y. Hayashi, and K. Nara. (1995). “The Performance of Hybridized Algorithm of Genetic Algorithm Simulated Annealing and Tabu Search for Thermal Unit Maintenance Scheduling.” In 2nd IEEE Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 114–119.Google Scholar
  78. Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. (1983). “Optimization by Simulated Annealing.” Science 220(4598), 671–680.Google Scholar
  79. Kirkpatrick, S., and G. Toulouse. (1985). “Configuration Space Analysis of the Travelling Salesman Problem.” J. Phys. 46(1277).Google Scholar
  80. Koza, J. and D. Andre. (1995). “Parallel Genetic Programming on a Network of Transputers.” Technical Report CS-TR-95-1542, Stanford University.Google Scholar
  81. Koza, J.R. (1992). Genetic Programming. Cambridge, USA: MIT Press.Google Scholar
  82. Kragelund, L.V. (1997). “Solving a Timetabling Problem Using Hybrid Genetic Algorithms.” Software Practice and Experience 27(10), 1121–1134.Google Scholar
  83. Kroger, B., P. Schwenderling, and O. Vornberger. (1990). “Parallel Genetic Packing of Rectangles.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany. Springer-Verlag, pp. 160–164.Google Scholar
  84. Kroger, B., P. Schwenderling, and O. Vornberger. (1991). “Genetic Packing of Rectangles on Transputers.” In P. Welch et al. (eds.), Transputing 91. IOS Press.Google Scholar
  85. Krueger, M. (1993). “Méthodes d'analyse d'algorithmes d'optimisation stochastiques à l'aide d'algorithmes génétiques.” Ph.D. Thesis, Ecole Nationale Supèrieure des Télécommunications, Paris, France.Google Scholar
  86. Lawler, E.L. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, USA.Google Scholar
  87. Lee, K.-G. and S.-Y. Lee. (1992). “Efficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph Partitioning.” In T.N. Mudge (ed.), Int. Conf. on Parallel Processing. CRC Press, pp. 177–180.Google Scholar
  88. Levine, D. (1994). “AParallel Genetic Algorithm for the Set Partitioning Problem.” Ph.D. Thesis, Argonne National Laboratory, Illinois Institute of Technology, Argonne, USA.Google Scholar
  89. Liepins, G.E. and M.R. Hilliard. (1987). “Greedy Genetics.” In 2nd Int. Conf. on Genetic Algorithms: Genetic Algorithms and Their Applications, Hillsdale, NJ, USA, Lawrence Erlbaum, pp. 90–99.Google Scholar
  90. Lin, F.T., C.Y. Kao, and C.C. Hsu. (1991). “Incorporating Genetic Algorithms into Simulated Annealing.” Proc. of the Fourth Int. Symp. on AI. pp. 290–297.Google Scholar
  91. Lohmann, R. (1990). “Application of Evolution Strategy in Parallel Populations.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature.Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 198–208.Google Scholar
  92. Mahfoud, S.W. and D.E. Goldberg. (1995). “Parallel Recombinative Simulated Annealing: A Genetic Algorithm.” Parallel Computing 21, 1–28.Google Scholar
  93. Malek, M., M. Guruswamy, M. Pandya, and H. Owens. (1989). “Serial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem.” Annals of Operations Research 21, 59–84.Google Scholar
  94. Mariano, C.E. and E. Morales. (1998). “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.Google Scholar
  95. Martin, O.C. and S.W. Otto. (1996). “Combining Simulated Annealing with Local Search Heuristics.” Annals of Operations Research 63, 57–75.Google Scholar
  96. Martin, O.C., S.W. Otto, and E.W. Felten. (1992). “Large-Step Markoy Chains for the TSP: Incorporating Local Search Heuristics.” Operation Research Letters 11, 219–224.Google Scholar
  97. Muhlenbein, H., M. Georges-Schleuter, and M. Kramer. (1998). “Evolution Algorithms in Combinatorial Optimization.” Parallel Computing 7, 65–85.Google Scholar
  98. Muhlenbein, H., M. Schomisch, and J. Born. (1991). “The Parallel Genetic Algorithm as Function Optimizer.” Parallel Computing 17, 619–632.Google Scholar
  99. Niar, S. and A. Freville. (1997). “A Parallel Tabu Search Algorithm for the 0-1 Multidimensional Knapsack Problem.” In Int. Parallel Processing Symposium, Geneva, Switzerland. IEEE Society.Google Scholar
  100. Nissen, V. (1994). “Solving the Quadratic Assignment problem with Clues from Nature.” IEEE Transactions on Neural Networks 5(1), 66–72.Google Scholar
  101. O'Reilly, U.-M. and F. Oppacher. (1995). “Hybridized Crossover-Based Techniques for Program Discovery.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 573–578.Google Scholar
  102. Osman, I.H. and G. Laporte. (1996). “Metaheuristics: A Bibliography.” Annals of Operations Research 63, 513–628.Google Scholar
  103. Papadimitriou, C.H. and K. Steiglitz. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall.Google Scholar
  104. Petty, C.B., M.R. Leuze, and J.J. Grefenstette. (1987). “A Parallel Genetic Algorithm.” In Proc. of the Second Int. Conf. on Genetic Algorithms. Cambridge: MIT, pp. 155–161.Google Scholar
  105. Piramuthu, S. (1990). “Feature Construction for Back-Propagation.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature, Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 264–268.Google Scholar
  106. Porto, S.C.S. and C. Ribeiro. (1996). “Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling Under Precedence Constraints.” Journal of Heuristics 1(2), 207–223.Google Scholar
  107. Potter, W.D., J.A. Miller, B.E. Tonn, R.V. Gandham, and C.N. Lapena. (1992). “Improving the Reliability of Heuristic Multiple Fault Diagnosis via the Ec-based Genetic Algorithm.” Int. J. Artificial Intell., Neural Networks, Complex Problem-Solving Technol. 2, 5–23.Google Scholar
  108. Potter, W.D., J.A. Miller, and O.R. Weyrich. (1990). “A Comparison of Methods for Diagnostic Decision Making.” Expert Syst. Applicat. Int. J. 1, 425–436.Google Scholar
  109. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer systeme nach prizipien der biologischen evolution. Formann-Holzboog Verlag, Stuttgart, Germany.Google Scholar
  110. Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford, UK: Black Scientific Publications.Google Scholar
  111. Rego, C. and C. Roucairol. (1996). “A Parallel Tabu Search Algorithm for the Vehicle Routing Problem.” In I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer, Norwell, MA, USA, pp. 253–295.Google Scholar
  112. Rose, J.S., D.R. Blythe, W.M. Snelgrove, and Z.G. Vranecic. (1986). “Fast, High Quality VLSI Placement on a MIMD Multiprocessor.” In IEEE Int. Conf. on Computer-Aided Design, Santa Clara, pp. 42–45.Google Scholar
  113. Rudolph, G. “Global Optimization by Means of Distributed Evolution Strategies.” (1990). In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 209–213.Google Scholar
  114. Rumelhart, D.E., G.E. Hinton, and R.J. Williams. (1986). “Learning Internal Representations by Error Propagation.” In D.E. Rumelhart and J.L. McClelland (eds.), Parallel Distributed Processing, Vol. 1, MIT Press, USA, pp. 318–362.Google Scholar
  115. Salami, M. and G. Cain. (1996). “Genetic Algorithm Processor on Reprogrammable Architectures.” In Fifth Annual Conference on Evolutionary Programming EP'96, San Diego, California, USA, MIT Press.Google Scholar
  116. Shahookar, K. and P. Mazumder. (1990). “A Genetic Approach to Standard Cell Placement Using Metagenetic Parameter Optimization.” IEEE Trans. Computer-Aided Design 9(5), 500–511.Google Scholar
  117. Shoukry, A. and M. Aboutabl. (1996). “Neural Network Approach for Solving the Maximal Common Subgraph Problem.” IEEE Trans. on Systems, Man, and Cybernetics 26(5), 785–790.Google Scholar
  118. Sloot, P.M., J.A. Kandorp, and A. Schoneveld. (1995). “Dynamic Complex Systems: A New Approach to Parallel Computing in Computational Physics.” Technical Report TR-CS-95-08, University of Amsterdam, Netherlands.Google Scholar
  119. Sprave, J. (1999). “A Unified Model of Non-panmictic Population Structures in Evolutionary Algorithms.” In Proc. of the 1999 Congress on Evolutionary Computation, Vol. 2, Piscataway, NJ, IEEE Press, pp. 1384–1391.Google Scholar
  120. Stutzle, T. and H.H. Hoos. (1997). “The MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization.” In 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France, INRIA, pp. 191–193.Google Scholar
  121. Suh, J.Y. and D. Van Gucht. (1987). “Incorporating Heuristic Information into Genetic Search.” In 2nd Int. Conf. Genetic Algorithms, Lawrence Erlbaum Associates, USA, pp. 100–107.Google Scholar
  122. Sun, Z. and Q. Wan. (1995). “A Modified Genetic Algorithm: Meta-leval Control of Migration in Distributed Ga.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 312–316.Google Scholar
  123. Taillard, E. (1993). “Parallel Iterative Search Methods for Vehicle Routing Problem.” Networks 23, 661–673.Google Scholar
  124. Taillard, E.D. and L.M. Gambardella. (1997). “An Ant Approach for Structured Quadratic Assignment Problems.” In C. Roucairol, I.H. Osman, S. Martello, and S. Voss (eds.), 2nd Int. Conf. on Metaheuristics, Sophia Antipolis, France, INRIA, pp. 217–222.Google Scholar
  125. Talbi, E.G., T. Muntean, and I. Samarandache. (1994). “Hybridation des AlgorithmesGénétiquesAvec la Recherche Tabou.” In Evolution Artificielle EA94, Toulouse, France.Google Scholar
  126. Tanese, R. (1987). “Parallel genetic Algorithms for a Hypercube.” In Proc. of the Second Int. Conf. on Genetic Algorithms, MIT, Cambridge, MA, USA, pp. 177–183.Google Scholar
  127. Thiel, J. and S. Voss. (1994). “Some Experiences on Solving Multiconstraint Zero-one Knapsack Problems with Genetic Algorithms.” INFOR 32(4), 226–242.Google Scholar
  128. Ulder, N.L.J., E.H.L. Aarts, H.-J. Bandelt, P.J.M. Van Laarhoven, and E. Pesch. (1990). “Genetic Local Search Algorithms for the Traveling Salesman Problem.” In H.-P. Schewefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 109–116.Google Scholar
  129. Vaessens, R., E. Aarts, and J. Lenstra. (1992). “A Local Search Template.” In R. Manner and B. Manderick (eds.), Parallel Problem Solving From Nature. Belgique, pp. 67–76.Google Scholar
  130. Voigt, H.-M., J. Born, and I. Santibanez-Koref. (1990). “Modelling and Simulation of Distributed Evolutionary Search Processes for Function Optimization.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany, Springer-Verlag, pp. 373–380.Google Scholar
  131. Von Laszewski, G. and H. Muhlenbein. (1990). “Partitioning a Graph with Parallel Genetic Algorithm.” In H.-P. Schwefel and R. Manner (eds.), Parallel Problem Solving from Nature. Vol. 496 of LNCS, Dortmund, Germany. Springer-Verlag, pp. 165–169.Google Scholar
  132. Voss, S. (1993). “Tabu Search: Applications and Prospects.” In Network Optimization Problems, World Scientific, USA, pp. 333–353.Google Scholar
  133. Wang, L.-H., C.-Y. Kao, M. Ouh-Young, and W.-C. Chen, (1995). “Molecular Binding: A Case Study of the Population-Based annealing Genetic Algorithms.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 50–55.Google Scholar
  134. Yang, S.Y., L.-J. Park, C.H. Park, and J.W. Ra. (1995). “A Hybrid Algorithm Using Genetic Algorithm and Gradient-Based Algorithm for Iterative Microwave Inverse Scattering.” In IEEE Int. Conf. on Evolutionary Computation ICEC'95, Perth, Australia, pp. 450–455.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • E.-G. Talbi
    • 1
  1. 1.Laboratoire d'Informatique Fondamentale de Lille, URA CNRS 369, Cité scientifiqueVilleneuve d'Ascq CedexFrance

Personalised recommendations