Memetic Algorithms

  • Pablo Moscato
  • Carlos Cotta
  • Alexandre Mendes
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 141)

Abstract

Back in the late 60s and early 70s, several researchers laid the foundations of what we now know as Evolutionary Algorithms (EAs) (Fogel et al. 1966; Holland 1975; Rechenberg 1973; Schwefel 1965). In these almost four decades, and despite some hard beginnings, most researchers interested in search or optimization — both from the applied and the theoretical standpoints — have grown to know and accept the existence — and indeed the usefulness — of these techniques. This has been also the case for other related techniques, such as Simulated Annealing (SA) (Kirkpatrick et al. 1983), Tabu Search (TS) (Glover and Laguna 1997), etc. The name metaheuristics is used to collectively term these techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbass H (2001) A memetic Pareto evolutionary approach to artificial neural networks. Lecture Notes in Computer Science 2256: 1–12CrossRefGoogle Scholar
  2. Aggarwal C, Orlin J, Tai R (1997) Optimized crossover for the independent set problem. Operations Research 45: 226–234MathSciNetMATHCrossRefGoogle Scholar
  3. Aguilar J, Colmenares A (1998) Resolution of pattern recognition problems using a hybrid genetic/random neural network learning algorithm. Pattern Analysis and Applications 1: 52–61MATHCrossRefGoogle Scholar
  4. Abdinnour H (1998) A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research 106: 489–499MATHCrossRefGoogle Scholar
  5. Areibi S (2000) An integrated genetic algorithm with dynamic hill climbing for VLSI circuit partitioning. Proceedings of Data Mining with Evolutionary Algorithms, pp 97–102Google Scholar
  6. Areibi S (2001) Memetic algorithms for VLSI physical design: Implementation issues.Google Scholar
  7. Proceedings of the 2nd WOMA — Workshop on Memetic Algorithms, pp 140–145Google Scholar
  8. Areibi S (2002) The performance of memetic algorithms on physical design. Submitted to the Journal of Applied Systems Studies.Google Scholar
  9. Augugliaro A, Dusonchet L, Riva-Sanseverino E (1998) Service restoration in compensated distribution networks using a hybrid genetic algorithm. Electric Power Systems Research 46: 59–66CrossRefGoogle Scholar
  10. Aygun K, Weile D, Michielssen E (1997) Design of multi-layered periodic strip gratings by genetic algorithms. Microwave and Optical Technology Letters 14: 81–85CrossRefGoogle Scholar
  11. Basseur M, Seynhaeve F, Talbi E (2002) Design of multi-objective evolutionary algorithms: Application to the flow-shop scheduling problem. Proceedings of the CEC’02 — Congress on Evolutionary Computation, pp 1151–1156Google Scholar
  12. Bayley M, Jones G, Willett P, Williamson M (1998) Genfold: A genetic algorithm forGoogle Scholar
  13. folding protein structures using NMR restraints. Protein Science 7:491–499Google Scholar
  14. Beasley J, Chu P (1996) A genetic algorithm for the set covering problem. European Journal of Operational Research 94:393–404Google Scholar
  15. Beasley J, Chu P (1998) A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4: 63–86MATHCrossRefGoogle Scholar
  16. Becker B, Drechsler R (1994) Ofdd based minimization of fixed polarity Reed-Muller expressions using hybrid genetic algorithms. Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processor, pp 106–110Google Scholar
  17. Berger J, Salois M, Begin R (1998) A hybrid genetic algorithm for the vehicle routing problem with time windows. Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pp 114–127Google Scholar
  18. Berretta R, Cotta C, Moscato P (2001) Forma analysis and new heuristic ideas for the number partitioning problem. Proceedings of the 4th MIC — Metaheuristic International Conference, pp 337–341Google Scholar
  19. Berretta R, Moscato P (1999) The number partitioning problem: An open challenge for evolutionary computation? In: New Ideas in Optimization. McGraw-Hill, pp 261–278Google Scholar
  20. Blesa M, Moscato P, Xhafa F (2001) A memetic algorithm for the minimum weighted kcardinality tree subgraph problem. Proceedings of the 4`h MIC — Metaheuristic International Conference, pp 85–90Google Scholar
  21. Bos A (1998) Aircraft conceptual design by genetic/gradient-guided optimization. Engineering Applications of Artificial Intelligence 11: 377–382CrossRefGoogle Scholar
  22. Brown D, Huntley C, Spillane A (1989) A Parallel Genetic Heuristic for the Quadratic Assignment Problem. Proceedings of the 3rd ICGA — International Conference on Genetic Algorithms, pp 406–415Google Scholar
  23. Bui T, Moon B (1996) Genetic algorithm and graph partitioning. IEEE Transactions on Computers 45: 841–855MathSciNetMATHCrossRefGoogle Scholar
  24. Bui T, Moon B (1998) GRCA: A hybrid genetic algorithm for circuit ratio-cut partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17: 193–204Google Scholar
  25. Buriol L, Resende M, Ribeiro C, Thorup M (2002) A memetic algorithm for OSPF routing. Proceedings of the 6th INFORMS Telecommunications Conference, pp 187–188Google Scholar
  26. Burke E, Jackson K, Kingston J, Weare R (1997) Automated timetabling: The state of the art. The Computer Journal 40: 565–571Google Scholar
  27. Burke E, Newall J (1997) A phased evolutionary approach for the timetable problem: An initial study. Proceedings of the ICONIP/ANZIIS/ANNES’97 Conference, pp 10381041Google Scholar
  28. Burke E, Newall J, Weare R (1996) A memetic algorithm for university exam timetabling. Lecture Notes in Computer Science 1153: 241–250CrossRefGoogle Scholar
  29. Burke E, Newall J, Weare R (1998) Initialisation strategies and diversity in evolutionary timetabling. Evolutionary Computation 6: 81–103CrossRefGoogle Scholar
  30. Burke E, Smith A (1997) A memetic algorithm for the maintenance scheduling problem. Proceedings of the ICONIP/ANZIIS/ANNES’97 Conference, pp 469–472Google Scholar
  31. Burke E, Smith A (1999a) A memetic algorithm to schedule grid maintenance. Proceedings of the CIMCA’99 — International Conference on Computational Intelligence for Modelling Control and Automation, pp 122–127Google Scholar
  32. Burke E, Smith A (1999b) A multi-stage approach for the thermal generator maintenance scheduling problem. Proceedings of the CEC’99 — Congress on Evolutionary Computation, pp 1085–1092Google Scholar
  33. Burke E, Elliman DG, Weare RF (1995) A hybrid genetic algorithm for highly constrained timetabling problems. Proceedings of the 6`h ICGA — International Conference on Genetic Algorithms, pp 605–610Google Scholar
  34. Cadieux S, Tanizaki N, Okamura T (1997) Time efficient and robust 3-D brain image centering and realignment using hybrid genetic algorithm. Proceedings of the 36`h SICE Annual Conference, pp 1279–1284Google Scholar
  35. Caorsi S, Massa A, Pastorino M, Rafetto M, Randazzo A (2002) A new approach to microwave imaging based on a memetic algorithm. Proceedings of the PIERS’02 — Progress in Electromagnetics Research Symposium. InvitedGoogle Scholar
  36. Can R, Hart W, Krasnogor N, Hirst J, Burke E, Smith J (2002) Alignment of protein structures with a memetic evolutionary algorithm. Proceedings of the GECCO’02 — Genetic and Evolutionary Computation Conference, pp 1027–1034Google Scholar
  37. Carrizo J, Tinetti F, Moscato P (1992) A computational ecology for the quadratic assignment problem. Proceedings of the 21’ Meeting on Informatics and Operations Research.Google Scholar
  38. Cavalieri S, Gaiardelli P (1998) Hybrid genetic algorithms for a multiple-objective scheduling problem. Journal of Intelligent Manufacturing 9: 361–367CrossRefGoogle Scholar
  39. Chaiyaratana N, Zalzala A (1999) Hybridisation of neural networks and genetic algorithms for time-optimal control. Proceedings of the CEC’99 — Congress on Evolutionary Computation, pp 389–396Google Scholar
  40. Cheng R, Gen M (1996) Parallel machine scheduling problems using memetic algorithms. Proceedings of the IEEE SMC’96 — International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems, pp 2665–2670Google Scholar
  41. Cheng R, Gen M (1997) Parallel machine scheduling problems using memetic algorithms. Computers & Industrial Engineering 33: 761–764CrossRefGoogle Scholar
  42. Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms. II. Hybrid genetic search strategies. Computers & Industrial Engineering 37: 51–55Google Scholar
  43. Chu P, Beasley J (1997) A genetic algorithm for the generalised assignment problem. Computers & Operations Research 24: 17–23MathSciNetMATHCrossRefGoogle Scholar
  44. Ciuprina G, loan D, Munteanu I (2002) Use of intelligent-particle swarm optimization in electromagnetics. IEEE Transactions on Magnetics 38: 1037–1040CrossRefGoogle Scholar
  45. Clark D, Westhead D (1996) Evolutionary algorithms in computer-aided molecular design. Journal of Computer-aided Molecular Design 10: 337–358CrossRefGoogle Scholar
  46. Coll P, Duran G, Moscato P (1999) On worst-case and comparative analysis as design principles for efficient recombination operators: A graph coloring case study. In: New Ideas in Optimization. McGraw-Hill, pp 279–294Google Scholar
  47. Conradie A, Mikkulainen R, Aldrich C (2002) Intelligent process control utilising symbiotic memetic neuro-evolution. Proceedings of the CEC’02 — Congress on Evolutionary Computation, pp 623–628Google Scholar
  48. Costa D (1995) An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR 33: 161–178Google Scholar
  49. Costa D, Dubuis N, Hertz A (1995) Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs. Journal of Heuristics 1: 105128Google Scholar
  50. Cotta C (1997) On resampling in nature-inspired heuristics (In Spanish). Proceedings of the 7th Conference of the Spanish Association for Artificial Intelligence, pp 145–154Google Scholar
  51. Cotta C (1998) A study of hybridisation techniques and their application to the design of evolutionary algorithms. AI Communications 11: 223–224Google Scholar
  52. Cotta C, Moscato P (2002) Inferring phylogenetic trees using evolutionary algorithms. Lecture Notes in Computer Science 2439: 720–729CrossRefGoogle Scholar
  53. Cotta C, Muruzâbal J (2002) Towards a more efficient evolutionary induction of bayesian networks. Lecture Notes in Computer Science 2439: 730–739CrossRefGoogle Scholar
  54. Cotta C, Troya J (1998) Genetic forma recombination in permutation flowshop problems. Evolutionary Computation 6: 25–44CrossRefGoogle Scholar
  55. Cotta C, Troya J (1998) A hybrid genetic algorithm for the 0–1 multiple knapsack problem. In: Artificial Neural Nets and Genetic Algorithms 3. Springer-Verlag, pp 251–255Google Scholar
  56. Cotta C, Troya J (2000) Using a hybrid evolutionary-A* approach for learning reactive behaviors. Lecture Notes in Computer Science 1803: 347–356CrossRefGoogle Scholar
  57. Cotta C, Troya J (2001) A comparison of several evolutionary heuristics for the frequency assignment problem. Lecture Notes in Computer Science 2084: 709–716CrossRefGoogle Scholar
  58. Cotta C, Troya J (2002) Embedding branch and bound within evolutionary algorithms. Applied Intelligence. To be publishedGoogle Scholar
  59. Crain T, Bishop R, Fowler W, Rock K (1999) Optimal interplanetary trajectory design via hybrid genetic algorithm/recursive quadratic program search. Proceedings of the 9th AAS/AIAA Space Flight Mechanics Meeting, pp 99–133Google Scholar
  60. Dandekar T, Argos P (1996) Identifying the tertiary fold of small proteins with different topologies from sequence and secondary structure using the genetic algorithm and extended criteria specific for strand regions. Journal of Molecular Biology 256: 645–660Google Scholar
  61. Davidor Y (1991) Epistasis variance: A viewpoint on GA-hardness. In: Foundations of Genetic Algorithms. Morgan Kaufmann, pp 23–35Google Scholar
  62. Davidor Y, Ben-Kiki 0 (1992) The interplay among the genetic algorithm operators: Information theory tools used in a holistic way. Proceedings of 2nd PPSN — Parallel Problem Solving From Nature, pp 75–84Google Scholar
  63. Davis L (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold Computer Library, New YorkGoogle Scholar
  64. Dawkins R (1976) The selfish gene. Oxford University Press, OxfordGoogle Scholar
  65. De Causmaecker P, Van Den Berghe G, Burke E (1999) Using tabu search as a local heuristic in a memetic algorithm for the nurse rostering problem. Proceedings of the 13th Conference on Quantitative Methods for Decision Making, abstract only, poster presentationGoogle Scholar
  66. De Souza P, Garg R, Garg V (1998) Automation of the analysis of Mossbauer spectra. Hyperfine Interactions 112: 275–278CrossRefGoogle Scholar
  67. Deaven D, Ho K (1995) Molecular-geometry optimization with a genetic algorithm. Physical Review Letters 75: 288–291CrossRefGoogle Scholar
  68. Deaven D, Tit N, Morris J, Ho K (1996) Structural optimization of Lennard-Jones clusters by a genetic algorithm. Chemical Physics Letters 256: 195–200CrossRefGoogle Scholar
  69. Dellaert N, Jeunet J (2000) Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. International Journal of Production Research 38: 1083–1099MATHCrossRefGoogle Scholar
  70. Desjarlais J, Handel T (1995) New strategies in protein design. Current Opinion in Biotechnology 6: 460–466CrossRefGoogle Scholar
  71. Doll R, VanHove M (1996) Global optimization in LEED structure determination using genetic algorithms. Surface Science 355: L393 — L398CrossRefGoogle Scholar
  72. Dome R, Hao J (1998) A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science 1498: 745–754CrossRefGoogle Scholar
  73. Dos Santos Coelho L, Rudek M, Junior OC (2001) Fuzzy-memetic approach for prediction of chaotic time series and nonlinear identification. Proceedings of the 6th On-line World Conference on Soft Computing in Industrial ApplicationsGoogle Scholar
  74. Eiben A, Raue P-E, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. Lecture Notes in Computer Science 866: 78–87CrossRefGoogle Scholar
  75. Fang J, Xi Y (1997) A rolling horizon job shop rescheduling strategy in the dynamic environment. International Journal of Advanced Manufacturing Technology 13: 227232Google Scholar
  76. Fleurent C, Ferland J (1997) Genetic and hybrid algorithms for graph coloring. Annals of Operations Research 63: 437–461CrossRefGoogle Scholar
  77. Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial Intelligence through Simulated Evolution. John Wiley & Sons, New YorkMATHGoogle Scholar
  78. França P, Mendes A, Moscato P (1999) Memetic algorithms to minimize tardiness on a single machine with sequence-dependent setup times. Proceedings of the DSI’99 — 5th International Conference of the Decision Sciences Institute, pp 1708–1710Google Scholar
  79. França P, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 132: 224–242MathSciNetMATHCrossRefGoogle Scholar
  80. Freisleben B, Merz P (1996a) A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. Proceedings of the ICEC’96 —International Conference on Evolutionary Computation, pp 616–621Google Scholar
  81. Freisleben B, Merz P (1996b) New Genetic Local Search Operators for the Traveling Salesman Problem. Lecture Notes in Computer Science 1141: 890–900CrossRefGoogle Scholar
  82. Fu R, Esfarjani K, Hashi Y, Wu J, Sun X, Kawazoe Y (1997) Surface reconstruction of Si (001) by genetic algorithm and simulated annealing method. Science Reports of The Research Institutes Tohoku University Series A-Physics Chemistry And Metallurgy 44: 77–81Google Scholar
  83. Garcia B, Mahey P, LeBlanc L (1998) Iterative improvement methods for a multiperiod network design problem. European Journal of Operational Research 110:150–165Google Scholar
  84. Gen M, Ida K, Yinzhen L (1998) Bicriteria transportation problem by hybrid genetic algorithm. Computers & Industrial Engineering 35: 363–366Google Scholar
  85. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, BostonMATHCrossRefGoogle Scholar
  86. Goldberg DE (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-WesleyGoogle Scholar
  87. Goldberg D, Lingle Jr R (1985) Alleles, loci and the traveling salesman problem. Proceedings of 1nd ICGA — International Conference on Genetic Algorithms, pp 154159Google Scholar
  88. Goldstein A, Lesk A (1975) Common feature techniques for discrete optimization. Computer Science Tech. Report 27, Bell Tel. Labs.Google Scholar
  89. Gottlieb J (2000) Permutation-based evolutionary algorithms for multidimensional knapsack problems. Proceedings of the ACM Symposium on Applied Computing, pp 408–414Google Scholar
  90. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, Boston, MA Gonçalves JF (2001) A memetic algorithm for the examination timetabling problem. Proceedings of Optimization 2001 Conference, pp 23–25Google Scholar
  91. Gorges-Schleuter M (1989) ASPARAGOS: An asynchronous parallel genetic optimization strategy. Proceedings of the 3`d ICGA — International Conference on Genetic Algorithms, pp 422–427Google Scholar
  92. Gorges-Schleuter M (1991) Genetic Algorithms and Population Structures - A Massively Parallel Algorithm. PhD thesis, University of Dortmund, GermanyGoogle Scholar
  93. Gorges-Schleuter M (1997) Asparagos96 and the traveling salesman problem. Proceedings of the ICEC’97 — International Conference on Evolutionary Computation, pp 171–174Google Scholar
  94. Grimbleby J (1999) Hybrid genetic algorithms for analogue network synthesis. Proceedings of the CEC ’ 99 — Congress on Evolutionary Computation, pp 1781–1787Google Scholar
  95. Gunn J (1997) Sampling protein conformations using segment libraries and a genetic algorithm. Journal of Chemical Physics 106: 4270–4281CrossRefGoogle Scholar
  96. Guotian M, Changhong L (1999) Optimal design of the broad-band stepped impedance transformer based on the hybrid genetic algorithm. Journal of Xidian University 26: 812Google Scholar
  97. Haas O, Burnham K, Mills J (1998) Optimization of beam orientation in radiotherapy using planar geometry. Physics in Medicine and Biology 43: 2179–2193CrossRefGoogle Scholar
  98. Haas O, Burnham K, Mills J, Reeves C, Fisher M (1996) Hybrid genetic algorithms applied to beam orientation in radiotherapy. Proceedings of the 4`’ European Congress on Intelligent Techniques and Soft Computing Proceedings, pp 2050–2055Google Scholar
  99. Hadj-Alouane A, Bean J, Murty K (1999) A hybrid genetic/optimization algorithm for a task allocation problem. Journal of Scheduling 2: 189–201MathSciNetMATHCrossRefGoogle Scholar
  100. Hansen P, Mladenovic N (2001) Variable neighborhood search: Principles and applications. European Journal of Operational Research 130: 449–467Google Scholar
  101. Harris S, Ifeachor E (1998) Automatic design of frequency sampling filters by hybrid genetic algorithm techniques. IEEE Transactions on Signal Processing 46: 3304–3314CrossRefGoogle Scholar
  102. Hart W, Belew R (1991) Optimizing an arbitrary function is hard for the genetic algorithm. Proceedings of the 4th ICGA — International Conference on Genetic Algorithms, pp 190–195Google Scholar
  103. Hartke B (1993) Global geometry optimization of clusters using genetic algorithms. Journal of Physical Chemistry 97: 9973–9976CrossRefGoogle Scholar
  104. Hifi M (1997) A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems. Journal of the Operational Research Society 48: 612–622MATHGoogle Scholar
  105. Hirsch R, Mullergoymann C (1995) Fitting of diffusion-coefficients in a 3-compartment sustained-release drug formulation using a genetic algorithm. International Journal of Pharmaceutics 120: 229–234CrossRefGoogle Scholar
  106. Ho K, Shvartsburg A, Pan B, Lu Z, Wang C, Wacker J, Fye J, Jarrold M (1998) Structures of medium-sized silicon clusters. Nature 392, 6676: 582–585CrossRefGoogle Scholar
  107. Hobday S, Smith R (1997) Optimisation of carbon cluster geometry using a genetic algorithm. Journal of The Chemical Society-Faraday Transactions 93:3919–3926Google Scholar
  108. Hodgson R (2000) Memetic algorithms and the molecular geometry optimization problem. Proceedings of the CEC’00 — Congress on Evolutionary Computation, pp 625–632Google Scholar
  109. Hodgson R (2001) Memetic algorithm approach to thin-film optical coating design. Proceedings of the 2nd WOMA — Workshop on Memetic Algorithms, pp 152–157Google Scholar
  110. Hofmann R (1993) Examinations on the algebra of genetic algorithms. Master Thesis, Technische Universitat Munchen, Institut fur InformatikGoogle Scholar
  111. Holland J (1975) Adaptation in Natural and Artificial Systems. The University of Michigan PressGoogle Scholar
  112. Holstein D, Moscato P (1999) Memetic algorithms using guided local search: A case study. In: New Ideas in Optimization. McGraw-Hill, pp 235–244Google Scholar
  113. Hopper E, Turton B (1999) A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering 37: 375–378CrossRefGoogle Scholar
  114. Huhn M (1997) An optimal stop criterion for genetic algorithms: A bayesian approach. Proceedings of the 7`h ICGA — International Conference on Genetic Algorithms, pp 135–143Google Scholar
  115. Ichimura T, Kuriyama Y (1998) Learning of neural networks with parallel hybrid GA using a Royal Road function. Proceedings of the IJCNN’98 — International Joint Conference on Neural Networks, pp 1131–1136Google Scholar
  116. Jih W, Hsu Y (1999) Dynamic vehicle routing using hybrid genetic algorithms. Proceedings of the CEC ‘89 — Congress on Evolutionary Computation, pp 453–458Google Scholar
  117. Jones G, Willett P, Glen R, Leach A, Taylor R (1997) Development and validation of a genetic algorithm for flexible docking. Journal of Molecular Biology 267: 727–748CrossRefGoogle Scholar
  118. Jones T (1995) Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, USAGoogle Scholar
  119. Karp R (1972) Reducibility among combinatorial problems. In: Complexity of Computer Computations. Plenum, New York, pp 85–103CrossRefGoogle Scholar
  120. Kariuki B, Serrano-Gonzalez H, Johnston R, Harris K (1997) The application of a genetic algorithm for solving crystal structures from powder diffraction data. Chemical Physics Letters 280: 189–195CrossRefGoogle Scholar
  121. Kassotakis I, Markaki M, Vasilakos A (2000) A hybrid genetic approach for channel reuse in multiple access telecommunication networks. IEEE Journal on Selected Areas in Communications 18: 234–243CrossRefGoogle Scholar
  122. Katayama K, Hirabayashi H, Narihisa H (1998) Performance analysis for crossover operators of genetic algorithm. Transactions of the Institute of Electronics, Information and Communication Engineers J81D-I, 6: 639–650Google Scholar
  123. Kersting S, Raidl G, Ljubic I (2002) A memetic algorithm for vertex-biconnectivity augmentation. Lecture Notes in Computer Science 2279: 101–110CrossRefGoogle Scholar
  124. Kim T, May G (1999) Intelligent control of via formation by photosensitive BCB for MCM-L/D applications. IEEE Transactions on Semiconductor Manufacturing 12: 503515Google Scholar
  125. Kirkpatrick S, Gellat DC, Vecchi M (1983) Optimization by simulated annealing. Science 220: 671–680MathSciNetMATHCrossRefGoogle Scholar
  126. Knödler K, Poland J, Zell A, Mitterer A (2002) Memetic algorithms for combinatorial optimization problems in the calibration of modern combustion engines. Proceedings of the GECCO’99 — Genetic and Evolutionary Computation Conference, pp 687Google Scholar
  127. Krasnogor N (1999) Coevolution of genes and memes in memetic algorithms. Proceedings of the Graduate Student Workshop, Orlando, Florida, USA, July, pp 371Google Scholar
  128. Krasnogor N (2002) Studies on the Theory and Design Space of Memetic Algorithms. Ph.D. Thesis, Faculty of Engineering, Computer Science and Mathematics. University of the West of England, United KingdomGoogle Scholar
  129. Krasnogor N, Blackburne B, Burke EK, Hirst JD (2002) Multimeme algorithms for protein structure prediction. Lecture Notes in Computer Science 2439: 769–778CrossRefGoogle Scholar
  130. Krasnogor N, Smith J (2000) A memetic algorithm with self-adaptive local search: TSP as a case study. Proceedings of the GECCO’00 — Genetic and Evolutionary Computation Conference, pp 987–994Google Scholar
  131. Krasnogor N, Smith J (2001) Emergence of profitable search strategies based on a simple inheritance mechanism. Proceedings of the GECCO’01 — Genetic and Evolutionary Computation Conference, pp 432–439Google Scholar
  132. Krasnogor N, Smith J (2002) Multimeme algorithms for the structure prediction and structure comparison of proteins. Proceedings of the GECCO’02 — Genetic and Evolutionary Computation Conference, pp 42–44Google Scholar
  133. Krishna K, Narasimha-Murty M (1999) Genetic k-means algorithm. IEEE Transactions on Systems, Man and Cybernetics, Part B 29: 433–439Google Scholar
  134. Krishna K, Ramakrishnan K, Thathachar M (1997) Vector quantization using genetic k-means algorithm for image compression. Proceedings of the 1997 International Conference on Information, Communications and Signal Processing, pp 1585–1587Google Scholar
  135. Krzanowski R, Raper J (1999) Hybrid genetic algorithm for transmitter location in wireless networks. Computers, Environment and Urban Systems 23: 359–382Google Scholar
  136. Landree E, Collazo-Davila C, Marks L (1997) Multi-solution genetic algorithm approach to surface structure determination using direct methods. Acta Crystallographica Section B–Structural Science 53: 916–922CrossRefGoogle Scholar
  137. Lazar G, Desjarlais J, Handel T (1997) De novo design of the hydrophobic core of ubiquitin. Protein Science 6: 1167–1178CrossRefGoogle Scholar
  138. Lee C (1994) Genetic algorithms for single machine job scheduling with common due date and symmetric penalties. Journal of the Operations Research Society of Japan 37: 8395Google Scholar
  139. Levine D (1996) A parallel genetic algorithm for the set partitioning problem. In: Meta-Heuristics: Theory & Applications. Kluwer Academic Publishers, pp 23–35CrossRefGoogle Scholar
  140. Li F, Morgan R, Williams D (1996) Economic environmental dispatch made easy with hybrid genetic algorithms. Proceedings of the International Conference on Electrical Engineering, pp 965–969Google Scholar
  141. Li L, Darden T, Freedman S, Furie B, Baleja J, Smith H, Hiskey R, Pedersen L (1997) Refinement of the NMR solution structure of the gamma-carboxyglutamic acid domain of coagulation factor IX using molecular dynamics simulation with initial Ca2+ positions determined by a genetic algorithm. Biochemistry 36: 2132–2138CrossRefGoogle Scholar
  142. Li S (1997) Toward global solution to map image estimation: Using common structure of local solutions. Lecture Notes in Computer Science 1223: 361–374CrossRefGoogle Scholar
  143. Liaw C (2000) A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research 124: 28–42MathSciNetMATHCrossRefGoogle Scholar
  144. Lin S (1965) Computer solutions of the traveling salesman problem. Bell System Technical Journal 10: 2245–2269Google Scholar
  145. Lin S, Kernighan B (1973) An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research 21: 498–516MathSciNetMATHCrossRefGoogle Scholar
  146. Ling S (1992) Integrating genetic algorithms with a prolog assignment program as a hybrid solution for a polytechnic timetable problem. Proceedings of 2u PPSN–Parallel Problem Solving from Nature, pp 321–329Google Scholar
  147. Lorber D, Shoichet B (1998) Flexible ligand docking using conformational ensembles. Protein Science 7: 938–950CrossRefGoogle Scholar
  148. Louis S, Yin X, Yuan Z (1999) Multiple vehicle routing with time windows using genetic algorithms. Proceedings of the CEC’99–Congress on Evolutionary Computation, pp 1804–1808Google Scholar
  149. MacKay A (1995) Generalized crystallography. THEOCHEM–Journal of Molecular Structure 336: 293–303CrossRefGoogle Scholar
  150. Maddox J (1995) Genetics helping molecular-dynamics. Nature 376, 6537:209–209 Mathias K, Whitley D (1992) Genetic operators, the fitness landscape and the travelingGoogle Scholar
  151. salesman problem. Proceedings of the 2“d PPSN - Parallel Problem Solving From Nature, pp 221–230Google Scholar
  152. Mathias K, Whitley L (1994) Noisy function evaluation and the delta coding algorithm. Proceedings of the SPIE’94–The International Society for Optical Engineering, pp 53–64Google Scholar
  153. May A, Johnson M (1994) Protein-structure comparisons using a combination of a genetic algorithm, dynamic-programming and least-squares minimization. Protein Engineering 7: 475–485CrossRefGoogle Scholar
  154. Mendes A, França P, Moscato P (2001) NP-Opt: An optimization framework for NP problems. Proceedings of the POM’01 — International Conference of the Production and Operations Management Society, pp 82–89Google Scholar
  155. Mendes A, França P, Moscato P (2002a) Fitness landscapes for the total tardiness single machine scheduling problem. Neural Network World — an International Journal on Neural and Mass-Parallel Computing and Information Systems 2: 165–180Google Scholar
  156. Mendes A, Muller F, França P, Moscato P (2002b) Comparing meta-heuristic approaches for parallel machine scheduling problems. Production Planning & Control 13: 1–6CrossRefGoogle Scholar
  157. Merkle L, Lamont G, Gates GJ, Pachter R (1996) Hybrid genetic algorithms for minimization of a polypeptide specific energy model. Proceedings of the ICEC’96 — International Conference on Evolutionary Computation, pp 396–400Google Scholar
  158. Merz P (2002) A comparison of memetic recombination operators for the traveling salesman problem. Proceedings of the GECCO’02 — Genetic and Evolutionary Computation Conference, pp 472–479Google Scholar
  159. Merz P, Freisleben B (1997a) A Genetic Local Search Approach to the Quadratic Assignment Problem. Proceedings of the 7th ICGA — International Conference on Genetic Algorithms, pp 465–472Google Scholar
  160. Merz P, Freisleben B (1997b) Genetic Local Search for the TSP: New Results. Proceedings of the ICEC’97 — International Conference on Evolutionary Computation, pp 159–164Google Scholar
  161. Merz P, Freisleben B (1998a) Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem. Lecture Notes in Computer Science 1498: 765–774CrossRefGoogle Scholar
  162. Merz P, Freisleben B (1998b) On the Effectiveness of Evolutionary Search in High-Dimensional NK-Landscapes. Proceedings of the ICEC’98 — International Conference on Evolutionary Computation, pp 741–745Google Scholar
  163. Merz P, Freisleben B (1999a). A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem. Proceedings of the CEC’99 — Congress on Evolutionary Computation, pp 2063–2070Google Scholar
  164. Merz P, Freisleben B (1999b) Fitness landscapes and memetic algorithm design. In: New Ideas in Optimization. McGraw-Hill, pp 245–260Google Scholar
  165. Merz P, Freisleben B (2000) Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning. Evolutionary Computation 8: 61–91Google Scholar
  166. Merz P, Freisleben B (2002a) Greedy and local search heuristics for the unconstrained binary quadratic programming problem. Journal of Heuristics 8: 197–213MATHCrossRefGoogle Scholar
  167. Merz P, Freisleben B (2002b) Memetic algorithms for the traveling salesman problem.Google Scholar
  168. Merz P, Katayama K (2002) Memetic algorithms for the unconstrained binary quadratic programming problem. Bio Systems. To be publishedGoogle Scholar
  169. Merz P, Zell A (2002) Clustering gene expression profiles with memetic algorithms. Lecture Notes in Computer Science 2439: 811–820CrossRefGoogle Scholar
  170. Meza J, Judson R, Faulkner T, Treasurywala A (1996) A comparison of a direct search method and a genetic algorithm for conformational searching. Journal of Computational Chemistry 17: 1142–1151CrossRefGoogle Scholar
  171. Mignotte M, Collet C, Pérez P, Bouthemy P (2000) Hybrid genetic optimization and statistical model based approach for the classification of shadow shapes in sonar imagery. IEEE Transactions on Pattern Analysis and Machine Intelligence 22: 129–141CrossRefGoogle Scholar
  172. Miller D, Chen H, Matson J, Liu Q (1999) A hybrid genetic algorithm for the single machine scheduling problem. Journal of Heuristics 5: 437–454MATHCrossRefGoogle Scholar
  173. Miller S, Hogle J, Filman D (1996) A genetic algorithm for the ab initio phasing of icosahedral viruses. Acta Crystallographica Section D — Biological Crystallography 52: 235–251CrossRefGoogle Scholar
  174. Min L, Cheng W (1998) Identical parallel machine scheduling problem for minimizing the makespan using genetic algorithm combined with simulated annealing. Chinese Journal of Electronics 7: 317–321Google Scholar
  175. Ming X, Mak K (2000) A hybrid hopfield network-genetic algorithm approach to optimal process plan selection. International Journal of Production Research 38:1823–1839Google Scholar
  176. Monfroglio A (1996a) Hybrid genetic algorithms for a rostering problem. Software — Practice and Experience 26: 851–862Google Scholar
  177. Monfroglio A (1996b) Hybrid genetic algorithms for timetabling. International Journal of Intelligent Systems 11: 477–523MATHCrossRefGoogle Scholar
  178. Monfroglio A (1996c) Timetabling through constrained heuristic search and genetic algorithms. Software — Practice and Experience 26: 251–279CrossRefGoogle Scholar
  179. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report C3P 826, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, USAGoogle Scholar
  180. Moscato P (1993) An Introduction to Population Approaches for Optimization and Hierarchical Objective Functions: The Role of Tabu Search. Annals of Operations Research 41: 85–121MATHCrossRefGoogle Scholar
  181. Moscato P (1999) Memetic algorithms: A short introduction. In: New Ideas in Optimization, McGraw-Hill, pp 219–234Google Scholar
  182. Moscato P, Norman M (1992) A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems. In: Parallel Computing and Transputer Applications. IOS Press, pp 177–186Google Scholar
  183. Moscato P, Tinetti F (1992) Blending heuristics with a population-based approach: A memetic algorithm for the traveling salesman problem. Technical Report 92–12, Universidad Nacional de La Plata, C.C. 75, 1900 La Plata, ArgentinaGoogle Scholar
  184. Murata T, Ishibuchi H (1994) Performance evaluation of genetic algorithms for flowshop scheduling problems. Proceedings of the CEC’94 — Conference on Evolutionary Computation, pp 812–817Google Scholar
  185. Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering 30: 1061–1071CrossRefGoogle Scholar
  186. Musil M, Wilmut M, Chapman N (1999) A hybrid simplex genetic algorithm for estimating geoacoustic parameters using matched-field inversion. IEEE Journal of Oceanic Engineering 24: 358–369CrossRefGoogle Scholar
  187. Nagata Y, Kobayashi S (1997) Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. Proceedings of the 7th ICGA — International Conference on Genetic Algorithms, pp 450–457Google Scholar
  188. Niesse J, Mayne H (1996) Global geometry optimization of atomic clusters using a modified genetic algorithm in space-fixed coordinates. Journal of Chemical Physics 105: 4700–4706CrossRefGoogle Scholar
  189. Nordstrom A, Tufekci S (1994) A genetic algorithm for the talent scheduling problem. Computers & Operations Research 21: 927–940CrossRefGoogle Scholar
  190. Norman M, Moscato P (1989). A competitive and cooperative approach to complex combinatorial search. Technical Report 790, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, California, USAGoogle Scholar
  191. Novaes A, De-Cursi J, Graciolli 0 (2000) A continuous approach to the design of physical distribution systems. Computers & Operations Research 27: 877–893MATHCrossRefGoogle Scholar
  192. Oliver I, Smith D, Holland J (1987) A study of permutation crossover operators on the traveling salesperson problem. Proceedings of the 2nd International Conference on Genetic Algorithms and their Applications, pp 224–230Google Scholar
  193. Osmera P (1995) Hybrid and distributed genetic algorithms for motion control. Proceedings of the 4`h International Symposium on Measurement and Control in Robotics, pp 297300Google Scholar
  194. Ostermark R (1999a) A neuro-genetic algorithm for heteroskedastic time-series processes: empirical tests on global asset returns. Soft Computing 3: 206–220CrossRefGoogle Scholar
  195. Ostermark R (1999b) Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm. Computers & Operations Research 26: 623–635CrossRefGoogle Scholar
  196. Ostermark R (1999c) Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm. Computational Economics 13:103–115Google Scholar
  197. Ozcan E, Mohan C (1998) Steady state memetic algorithm for partial shape matching. Lecture Notes in Computer Science 1447:527–536Google Scholar
  198. Ozdamar L (1999) A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) 29: 44–59Google Scholar
  199. Pacey M, Patterson E, James M (2001) A photoelastic technique for characterising fatigue crack closure and the effective stress intensity factor. Zeszyty Naukowe Politechniki Opolskiej, Seria: Mechanika z.67, kol. 269 /2001Google Scholar
  200. Pacey M, Wang X, Haake S, Patterson E (1999) The application of evolutionary and maximum entropy algorithms to photoelastic spectral analysis. Experimental Mechanics 39: 265–273CrossRefGoogle Scholar
  201. Paechter B, Cumming A, Norman M, Luchian H (1996) Extensions to a Memetic timetabling system. Lecture Notes in Computer Science 1153: 251–265CrossRefGoogle Scholar
  202. Paechter B, Rankin R, Cumming A (1998) Improving a lecture timetabling system for university wide use. Lecture Notes in Computer Science 1408: 156–165CrossRefGoogle Scholar
  203. Papadimitriou C, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New JerseyMATHGoogle Scholar
  204. Pastorino M, Caorsi S, Massa A, Randazzo A (2002) Reconstruction algorithms for electromagnetic imaging. Proceedings of IEEE Instrumentation and Measurement Technology Conference, pp 1695–1700Google Scholar
  205. Poland J, Knödler K, Mitterer A, Fleischhauer T, Zuber-Goos F, Zell A (2001). Evolutionary search for smooth maps in motor control unit calibration. Lecture Notes in Computer Science 2264: 107–116Google Scholar
  206. Pratihar D, Deb K, Ghosh A (1999) Fuzzy-genetic algorithms and mobile robot navigation among static obstacles. Proceedings of the CEC’99 — Congress on Evolutionary Computation, pp 327–334Google Scholar
  207. Pucello N, Rosati M, D’Agostino G, Pisacane F, Rosato V, Celino M (1997) Search of molecular ground state via genetic algorithm: Implementation on a hybrid SIMDMIMD platform. International Journal of Modern Physics C 8: 239–252Google Scholar
  208. Pullan, W (1997) Structure prediction of benzene clusters using a genetic algorithm. Journal of Chemical Information and Computer Sciences 37: 1189–1193Google Scholar
  209. Quagliarella D, Vicini A (1998) Hybrid genetic algorithms as tools for complex optimisation problems. Proceedings of the Second Italian Workshop on Fuzzy Logic, pp 300–307Google Scholar
  210. Quintero A, Pierre S (2003) A multi-population memetic algorithm to optimize the assignment of cells to switches in cellular mobile networks. Submitted for publication Radcliffe N (1992) Non-linear genetic representations. Proceedings of the 2nd PPSN — Parallel Problem Solving From Nature, pp 259–268Google Scholar
  211. Radcliffe N (1994) The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10: 339–384MathSciNetMATHCrossRefGoogle Scholar
  212. Radcliffe N, Surly P (1994a) Fitness Variance of Formae and Performance Prediction. Proceedings of the 3rd FOGA — Workshop on Foundations of Genetic Algorithms, pp 51–72Google Scholar
  213. Radcliffe N, Surry P (1994b) Formal Memetic Algorithms. Lecture Notes in Computer Science 865: 1–16CrossRefGoogle Scholar
  214. Raidl G, Julstron B (2000) A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem. Proceedings of the ACM Symposium on Applied Computing 2000, pp 440–445Google Scholar
  215. Ramat E, Venturini G, Lente C, Slimane M (1997) Solving the multiple resource constrained project scheduling problem with a hybrid genetic algorithm. Proceedings of the 7`h ICGA — International Conference on Genetic Algorithms, pp 489–496Google Scholar
  216. Rankin R (1996) Automatic timetabling in practice. In: Practice and Theory of Automated Timetabling. First International Conference. Springer-Verlag, pp 266–279CrossRefGoogle Scholar
  217. Raymer M, Sanschagrin P, Punch W, Venkataraman S, Goodman E, Kuhn L (1997) Predicting conserved water-mediated and polar ligand interactions in proteins using a k-nearest-neighbors genetic algorithm. Journal of Molecular Biology 265: 445–464CrossRefGoogle Scholar
  218. Rechenberg I (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart, GermanyGoogle Scholar
  219. Reeves C (1996) Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research 63: 371–396MATHCrossRefGoogle Scholar
  220. Reich C (2000) Simulation of imprecise ordinary differential equations using evolutionary algorithms. Proceedings of the ACM Symposium on Applied Computing 2000, pp 428–432Google Scholar
  221. Ridao M, Riquelme J, Camacho E, Toro M (1998). An evolutionary and local search algorithm for planning two manipulators motion. Lecture Notes in Computer Science 1416: 105–114Google Scholar
  222. Rodrigues A, Ferreira JS (2001) Solving the rural postman problem by memetic algorithms.Google Scholar
  223. Proceedings of the 4th MIC — Metaheuristic International Conference, pp 679–684Google Scholar
  224. Ruff C, Hughes S, Hawkes D (1999) Volume estimation from sparse planar images using deformable models. Image and Vision Computing 17:559–565Google Scholar
  225. Runggeratigul S (2001) A memetic algorithm to communication network design taking into consideration an existing network. Proceedings of the 4th MIC — Metaheuristic International Conference, pp 91–96Google Scholar
  226. Sakamoto A, Liu X, Shimamoto T (1997) A genetic approach for maximum independent set problems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E80A, 3: 551–556Google Scholar
  227. Schnecke V, Vomberger 0 (1997) Hybrid genetic algorithms for constrained placement problems. IEEE Transactions on Evolutionary Computation 1: 266–277CrossRefGoogle Scholar
  228. Schwefel HP (1965) Kybernetische Evolution als Strategie der experimentellen Forschung in der Stromungstechnik. Diplomarbeit, Technische Universitat Berlin, GermanyGoogle Scholar
  229. Shankland K, David W, Csoka T (1997) Crystal structure determination from powder diffraction data by the application of a genetic algorithm. Zeitschrift Fur Kristallographie 212: 550–552CrossRefGoogle Scholar
  230. Shankland K, David W, Csoka T, McBride L (1998) Structure solution of ibuprofen from powder diffraction data by the application of a genetic algorithm combined with prior conformational analysis. International Journal of Pharmaceutics 165: 117–126CrossRefGoogle Scholar
  231. Smith J (2002) Co-evolving memetic algorithms: Initial investigations. Lecture Notes in Computer Science 2439: 537–548CrossRefGoogle Scholar
  232. Srinivasan D, Cheu R, Poh Y, Ng A (2000) Development of an intelligent technique for traffic network incident detection. Engineering Applications of Artificial Intelligence 13: 311–322CrossRefGoogle Scholar
  233. Surry P, Radcliffe N (1996) Inoculation to initialise evolutionary search. Lecture Notes in Computer Science 1143: 269–285CrossRefGoogle Scholar
  234. Syswerda G (1989) Uniform crossover in genetic algorithms. Proceedings of the 3rd ICGA — International Conference on Genetic Algorithms, pp 2–9Google Scholar
  235. Taguchi T, Yokota T, Gen M (1998) Reliability optimal design problem with interval coefficients using hybrid genetic algorithms. Computers & Industrial Engineering 35: 373–376CrossRefGoogle Scholar
  236. Tam K, Compton R (1995) GAMATCH–a genetic algorithm-based program for indexing crystal faces. Journal of Applied Crystallography 28: 640–645CrossRefGoogle Scholar
  237. Topchy A, Lebedko 0, Miagkikh V (1996). Fast learning in multilayered networks by means of hybrid evolutionary and gradient algorithms. Proceedings of International Conference on Evolutionary Computation and its Applications, pp 390–398Google Scholar
  238. Urdaneta A, Gómez J, Sorrentino E, Flores L, Díaz R (1999) A hybrid genetic algorithm for optimal reactive power planning based upon successive linear programming. IEEE Transactions on Power Systems 14: 1292–1298CrossRefGoogle Scholar
  239. Valenzuela J, Smith A (2002) A seeded memetic algorithm for large unit commitment problems. Journal of Heuristics 8: 173–195CrossRefGoogle Scholar
  240. VanKampen A, Strom C, Buydens L (1996) Lethalization, penalty and repair functions for constraint handling in the genetic algorithm methodology. Chemometrics And Intelligent Laboratory Systems 34: 55–68CrossRefGoogle Scholar
  241. Wang L, Yen, J (1999) Extracting fuzzy rules for system modeling using a hybrid of genetic algorithms and kalman filter. Fuzzy Sets and Systems 101: 353–362MathSciNetCrossRefGoogle Scholar
  242. Watson J, Rana S, Whitley L, Howe A (1999) The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling. Journal of Scheduling 2: 79–98MathSciNetMATHCrossRefGoogle Scholar
  243. Wehrens R, Lucasius C, Buydens L, Kateman G (1993) HIPS, A hybrid self-adapting expert system for nuclear magnetic resonance spectrum interpretation using genetic algorithms. Analytica Chimica ACTA 277: 313–324Google Scholar
  244. Wei P, Cheng L (1999) A hybrid genetic algorithm for function optimization. Journal of Software 10: 819–823Google Scholar
  245. Wei X, Kangling F (2000) A hybrid genetic algorithm for global solution of nondifferentiable nonlinear function. Control Theory & Applications 17:180–183Google Scholar
  246. Weile D, Michielssen E (1999) Design of doubly periodic filter and polarizer structures using a hybridized genetic algorithm. Radio Science 34: 51–63Google Scholar
  247. White R, Niesse J, Mayne H (1998) A study of genetic algorithm approaches to global geometry optimization of aromatic hydrocarbon microclusters. Journal of Chemical Physics 108: 2208–2218CrossRefGoogle Scholar
  248. Willett P (1995) Genetic algorithms in molecular recognition and design. Trends in Biotechnology 13: 516–521CrossRefGoogle Scholar
  249. Wolpert D, Macready W (1997) No free lunch theorems for optimization IEEE Transactions on Evolutionary Computation 1: 67–82CrossRefGoogle Scholar
  250. Xiao J, Zhang L (1997) Adaptive evolutionary planner/navigator for mobile robots IEEE Transactions on Evolutionary Computation 1: 18–28CrossRefGoogle Scholar
  251. Yao X (1993) Evolutionary artificial neural networks. International Journal of Neural Systems 4: 203–222CrossRefGoogle Scholar
  252. Yeh I (1999) Hybrid genetic algorithms for optimization of truss structures. Computer Aided Civil and Infrastructure Engineering 14: 199–206CrossRefGoogle Scholar
  253. Yeh WC (2000) A memetic algorithm for the min k-cut problem. Control and Intelligent Systems 28: 47–55Google Scholar
  254. Yoneyama M, Komori H, Nakamura S (1999) Estimation of impulse response of vocal tract using hybrid genetic algorithm–a case of only glottal source. Journal of the Acoustical Society of Japan 55: 821–830Google Scholar
  255. Zacharias C, Lemes M, Pino A (1998) Combining genetic algorithm and simulated annealing: a molecular geometry optimization study. THEOCHEM — Journal of Molecular Structure 430: 29–39CrossRefGoogle Scholar
  256. Zelinka I, Vasek V, Kolomaznik K, Dostal P, Lampinen J (2001) Memetic algorithm and global optimization of chemical reactor. Proceedings of the 13th International Conference on Process Control.Google Scholar
  257. Zwick M, Lovell B, Marsh J (1996) Global optimization studies on the 1-d phase problem. International Journal of General Systems 25: 47–59MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Pablo Moscato
  • Carlos Cotta
  • Alexandre Mendes

There are no affiliations available

Personalised recommendations