Skip to main content
SpringerLink
Log in
Book cover

Scalable Optimization via Probabilistic Modeling pp 161–185Cite as

Efficiency Enhancement of Estimation of Distribution Algorithms

  • Chapter

Part of the book series: Studies in Computational Intelligence ((SCI,volume 33))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackley, D. H. (1987). A Connectionist Machine for Genetic Hill Climbing. Kluwer, Boston, MA

    Google Scholar 

  2. Albert, L. A. (2001). Efficient genetic algorithms using discretization scheduling. Master’s thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL

    Google Scholar 

  3. Albert, L. A. and Goldberg, D. E. (2001). Efficient evaluation relaxation under integrated fitness functions. Intelligent Engineering Systems Through Artificial Neural Networks, 11:165-170.(Also IlliGAL Report No. 2001024)

    Google Scholar 

  4. Albert, L. A. and Goldberg, D. E. (2002). Efficient discretization scheduling in multiple dimensions. Proceedings of the Genetic and Evolutionary Computation Conference, pages 271-278. (Also IlliGAL Report No. 2002006)

    Google Scholar 

  5. Armstrong, D. E. and Jacobson, S. H. (2005). Data independent neighborhood functions and strict local optima. Discrete Applied Mathematics, 146(3):233-243

    Article  MATH  MathSciNet  Google Scholar 

  6. Bäck, T. (1996). Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York

    MATH  Google Scholar 

  7. Barnes, J. W., Dimova, B., and Dokov, S. P. (2003). The theory of elementary landscapes. Applied Mathematical Letters, 16:337-343

    Article  MATH  MathSciNet  Google Scholar 

  8. Barthelemy, J.-F. M. and Haftka, R. T. (1993). Approximation con-cepts for optimum structural design—a review. Structural Optimization, 5:129-144

    Article  Google Scholar 

  9. Bethke, A. D. (1976). Comparison of genetic algorithms and gradient-based optimizers on parallel processors: Efficiency of use of processing capacity. Tech. Rep. No. 197, Univeristy of Michigan, Logic of Computers Group, Ann Arbor, MI

    Google Scholar 

  10. Beyer, H.-G. (1996). Toward a theory of evolution strategies: Selfadaptation. Evolutionary Computation, 3(3):311-347

    Article  Google Scholar 

  11. Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., and Trosset, M. W. (1998). A rigorous framework for optimization of expensive functions by surrogates. Technical report, National Aeronautics and Space Administration (NASA), Hampton, VA. ICASE Report No. 98-47

    Google Scholar 

  12. Bosworth, J. L., Foo, N., and Zeigler, B. P. (1972). Comparison of genetic algorithms with conjugate gradient methods. ORA Tech. Report No. 00312-1-T, University of Michigan, Department of Computer and Communication Sciences, Ann Arbor, MI

    Google Scholar 

  13. Cantú-Paz, E. (1997). A summary of research on parallel genetic algorithms. IlliGAL Report No. 97003, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL

    Google Scholar 

  14. Cantú-Paz, E. (2000). Efficient and accurate parallel genetic algorithms. Kluwer, Boston, MA

    MATH  Google Scholar 

  15. Colletti, B. W. and Barnes, J. W. (2004). Using group theory to construct and characterize metaheuristic search neighborhoods. In Rego, C. and Alidaee, B., editors, Adaptive Memory and Evolution: Tabu Search and Scatter Search, pages 303-329. Kluwer , Boston, MA

    Google Scholar 

  16. Davis, L., editor (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, NY

    Google Scholar 

  17. Deb, K. and Goldberg, D. E. (1992). Analyzing deception in trap functions. Foundations of Genetic Algorithms, 2:93-108. (Also IlliGAL Report No. 91009)

    Google Scholar 

  18. Deb, K. and Goldberg, D. E. (1994). Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence, 10:385-408. (Also IlliGAL Report No. 92001)

    Article  MATH  MathSciNet  Google Scholar 

  19. Dennis, J. E. and Torczon, V. (1997). Managing approximation models in optimization. In Alexandrov, N. M. and Hussaini, M. Y., editors, Multidisciplinary Design Optimization: State-of-the-Art, pages 330-347, Philadelphia, PA. SIAM

    Google Scholar 

  20. Fitzpatrick, J. M., Grefenstette, J. J., and Van Gucht, D. (1984). Image registration by genetic search. In Proceedings of IEEE Southeast Conference, pages 460-464, Piscataway, NJ. IEEE press

    Google Scholar 

  21. Fleurent, C. and Ferland, J. (1994). Genetic hybrids for the quadratic assignment problem. In DIMACS Series in Mathematics and Theoretical Computer Science, volume 16, pages 190-206

    Google Scholar 

  22. Goldberg, D. E. (1987). Simple genetic algorithms and the minimal deceptive problem. In Davis, L., editor, Genetic algorithms and simulated annealing, chapter 6, pages 74-88. Morgan Kaufmann, Los Altos, CA

    Google Scholar 

  23. Goldberg, D. E. (1989). Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  24. Goldberg, D. E. (1999). Using time efficiently: Genetic-evolutionary algorithms and the continuation problem. Proceedings of the Genetic and Evolutionary Computation Conference, pages 212-219. (Also IlliGAL Report No. 99002)

    Google Scholar 

  25. Goldberg, D. E. (2002). Design of innovation: Lessons from and for competent genetic algorithms. Kluwer, Boston, MA

    MATH  Google Scholar 

  26. Goldberg, D. E. and Voessner, S. (1999). Optimizing global-local search hybrids. Proceedings of the Genetic and Evolutionary Computation Conference, pages 220-228. (Also IlliGAL Report No. 99001)

    Google Scholar 

  27. Gorges-Schleuter, M. (1989). ASPARAGOS: A population genetics approach to genetic algorithms. Evolution and Optimization ’89, pages 86-94

    Google Scholar 

  28. Gorges-Schleuter, M. (1989). ASPARAGOS: An asynchronous parallel genetic optimization strategy. Proceedings of the Third International Conference on Genetic Algorithms, pages 422-428

    Google Scholar 

  29. Gorges-Schleuter, M. (1997). ASPARAGOS96 and the traveling salesman problem. Proceedings of the IEEE International Conference on Evolutionary Computation, pages 171-174

    Google Scholar 

  30. Grefenstette, J. J. (1981). Parallel adaptive algorithms for function optimization. Tech. Rep. No. CS-81-19, Vanderbilt Univeristy, Computer Science Department, Nashville, TN

    Google Scholar 

  31. Grefenstette, J. J. and Fitzpatrick, J. M. (1985). Genetic search with approximate function evaluations. Proceedings of the International Conference on Genetic Algorithms and Their Applications, pages 112-120

    Google Scholar 

  32. Grosso, P. B. (1985). Computer simulations of genetic adaptation: Par-allel subcomponent interaction in a multilocus model. PhD thesis, University of Michigan, Ann Arbor, MI. (University microfilms no. 8520908)

    Google Scholar 

  33. Gruau, F. (1994). Neural network synthesis using cellular encoding and the genetic algorithm. PhD thesis, L’Universite Claude Bernard-Lyon I

    Google Scholar 

  34. Handa, H. (2003). Hybridization of estimation of distribution algorithms with a repair method for solving constraint satisfaction problems. Proceedings of the Genetic and Evolutionary Computation Conference, pages 991-1002

    Google Scholar 

  35. Handa, H. (2005). The effectiveness of mutation operation in the case of estimation of distribution algorithms. Journal of Biosystems.(To appear)

    Google Scholar 

  36. Hansen, N. and Ostermeier, A. (2001). Completely derandomized selfadaptation in evolution strategies. Evolutionary Computation,9(2): 159-195

    Article  Google Scholar 

  37. Harik, G. (1999). Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Urbana, IL

    Google Scholar 

  38. Harik, G., Cantú-Paz, E., Goldberg, D. E., and Miller, B. L. (1999). The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253.(Also IlliGAL Report No. 96004)

    Article  Google Scholar 

  39. Hart, W. E. (1994). Adaptive global optimization with local search. PhD thesis, University of California, San Diego, San Diego, CA

    Google Scholar 

  40. Hart, W. E. and Belew, R. K. (1996). Optimization with genetic algorithm hybrids using local search. In Belew, R. K. and Mitchell, M., editors, Adaptive Individuals in Evolving Populations, pages 483-494. Addison-Wesley, Reading, MA

    Google Scholar 

  41. Hartmann, A. K. and Rieger, H. (2001). Optimization algorithms in physics, chapter 9, pages 192-203. Wiley-VCH, Berlin

    Book  Google Scholar 

  42. Ibaraki, T. (1997). Combinations with other optimization methods. In Bäck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages D3:1-D3:2. Institute of Physics Publishing and Oxford University Press, Bristol and New York

    Google Scholar 

  43. Jin, Y. (2005). A comprehensive survey of fitness approximation in evolutionary computation. Soft Computing Journal, 9(1):3-12

    Article  Google Scholar 

  44. Krasnogor, N. (2002). Studies on the Theory and Design Space of Memetic Algorithms. PhD thesis, University of the West of England, Bristol, England

    Google Scholar 

  45. Land, M. (1998). Evolutionary algorithms with local search for combinatorial optimization. PhD thesis, University of California at San Diego, San Diego, CA

    Google Scholar 

  46. Lima, C. F. and Lobo, F. G. (2004). Parameter-less optimization with the extended compact genetic algorithm and iterated local search. Proceedings of the Genetic and Evolutionary Computation Conference, 1:1328-1339. (Also technical report cs.NE/0402047 at arXiv.org)

    Google Scholar 

  47. Lima, C. F., Sastry, K., Goldberg, D. E., and Lobo, F. G. (2005). Combin-ing competent crossover and mutation operators: A probabilistic model building approach. Proceedings of the 2005 Genetic and Evolutionary Computation Conference, pages 735-742. (Also IlliGAL Report No. 2005002)

    Google Scholar 

  48. Lin, S.-C., Goodman, E. D., and Punch, W. F. (1997). Investigating parallel genetic algorithms on job shop scheduling problem. Sixth Inter-national Conference on Evolutionary Programming, pages 383-393

    Google Scholar 

  49. Llorà, X., Sastry, K., Goldberg, D. E., Gupta, A., and Lakshmi, L. (2005). Combating user fatigue in iGAs: Partial ordering, support vector ma-chines, and synthetic fitness. Proceedings of the Genetic and Evolutionary Computation Conference, pages 1363-1370. (Also IlliGAL Report No. 2005009)

    Google Scholar 

  50. Manderick, B. and Spiessens, P. (1989). Fine-grained parallel genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, pages 428-433

    Google Scholar 

  51. Miller, B. L. (1997). Noise, Sampling, and Efficient Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, General Engi-neering Department, Urbana, IL. (Also IlliGAL Report No. 97001)

    Google Scholar 

  52. Miller, B. L. and Goldberg, D. E. (1995). Genetic algorithms, tournament selection, and the effects of noise. Complex Systems, 9(3):193-212. (Also IlliGAL Report No. 95006)

    MathSciNet  Google Scholar 

  53. Miller, B. L. and Goldberg, D. E. (1996). Optimal sampling for genetic algorithms. Intelligent Engineering Systems through Artificial Neural Networks, 6:291-297

    Google Scholar 

  54. 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, CA

    Google Scholar 

  55. Mühlenbein, H. (1992). How genetic algorithms really work: Mutation and hillclimbing. Parallel Problem Solving from Nature II, pages 15-26

    Google Scholar 

  56. Munetomo, M., Murao, N., and Akama, K. (2005). Empirical stud-ies on parallel network construction of Bayesian optimization algo-rithms. Proceedings of the Congress of Evolutionary Computation, 1-2-3: 1234-1238

    Google Scholar 

  57. Ocenasek, J. and Pelikan, M. (2003). Parallel spin glass solving in hierarchical Bayeisan optimization algorithm. Proceedings of the 9th Inter-national Conference on Soft Computing, Mendel 2003, pages 120-125

    Google Scholar 

  58. Ocenasek, J., Schwarz, J., and Pelikan, M. (2003). Design of multi-threaded estimation of distribution algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, pages 1247-1258

    Google Scholar 

  59. Orvosh, D. and Davis, L. (1993). Shall we repair? Genetic algorithms, combinatorial optimization, and feasibility constraints. Proceedings of the Fifth International Conference on Genetic Algorithms, page 650

    Google Scholar 

  60. Pelikan, M. (2005). Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithm. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  61. Pelikan, M. and Goldberg, D. E. (2003). Hierarchical BOA solves Ising spin glasses and MAXSAT. Proceedings of the Genetic and Evolutionary Computation Conference, pages 1271-1282.(Also IlliGAL Report No. 2003001)

    Google Scholar 

  62. Pelikan, M., Goldberg, D. E., and Cantú-Paz, E. (2000). Linkage learning, estimation distribution, and Bayesian networks. Evolutionary Computation, 8(3):314-341. (Also IlliGAL Report No. 98013)

    Article  Google Scholar 

  63. Pelikan, M., Goldberg, D. E., and Sastry, K. (2001). Bayesian optimization algorithm, decision graphs, and Occam’s razor. Proceedings of the Genetic and Evolutionary Computation Conference, pages 519-526. (Also IlliGAL Report No. 2000020)

    Google Scholar 

  64. Pelikan, M. and Sastry, K. (2004). Fitness inheritance in the Bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference, 2:48-59. (Also IlliGAL Report No. 2004009)

    Google Scholar 

  65. Pelikan, M., Sastry, K., and Goldberg, D. E. (2003). Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258. (Also IlliGAL Report No. 2001029)

    Article  MathSciNet  Google Scholar 

  66. Pelikan, M., Sastry, K., and Goldberg, D. E. (2005). Sporadic model building for efficiency enhancement of hBOA. IlliGAL Report No. 2005026, University of Illinois at Urbana-Champaign, Urbana, IL

    Google Scholar 

  67. Pettey, C. C., Leuze, M. R., and Grefenstette, J. J. (1987). A parallel genetic algorithm. Proceedings of the Second International Conference on Genetic Algorithms, pages 155-161

    Google Scholar 

  68. Ramsey, C. L. and Grefenstette, J. J. (1993). Case-Based initialization of genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, pages 84-91

    Google Scholar 

  69. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog, Stuttgart

    Google Scholar 

  70. Robertson, G. G. (1987). Parallel implementation of genetic algorithms in a classifier system. Proceedings of the Second International Conference on Genetic Algorithms, pages 140-147

    Google Scholar 

  71. Sastry, K. (2001a). Efficient cluster optimization using a hybrid extended compact genetic algorithm with a seeded population. IlliGAL Report No. 2001018, University of Illinois at Urbana-Champaign, Urbana, IL

    Google Scholar 

  72. Sastry, K. (2001b). Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master’s thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL. (Also IlliGAL Report No. 2002004)

    Google Scholar 

  73. Sastry, K. and Goldberg, D. E. (2004a). Designing competent mutation operators via probabilistic model building of neighborhoods. Proceedings of the 2004 Genetic and Evolutionary Computation Conference, 2:114-125. Also IlliGAL Report No. 2004006

    Google Scholar 

  74. Sastry, K. and Goldberg, D. E. (2004b). Let’s get ready to rumble: Crossover versus mutation head to head. Proceedings of the 2004 Genetic and Evolutionary Computation Conference, 2:126-137. Also IlliGAL Report No. 2004005

    Google Scholar 

  75. Sastry, K., Goldberg, D. E., and Pelikan, M. (2001). Don’t evaluate, inherit. Proceedings of the Genetic and Evolutionary Computation Con-ference, pages 551-558. (Also IlliGAL Report No. 2001013)

    Google Scholar 

  76. Sastry, K., Pelikan, M., and Goldberg, D. E. (2004). Efficiency enhancement of genetic algorithms building-block-wise fitness estimation. Proceedings of the IEEE International Conference on Evolutionary Computation, pages 720-727

    Google Scholar 

  77. Sastry, K., Winward, P., Goldberg, D. E., and Lima, C. F. (2005). Fluctuating crosstalk as a source of deterministic noise and its effects on ga scalability. IlliGAL Report No. 2005025, University of Illinois at UrbanaChampaign, Urbana, IL

    Google Scholar 

  78. Schwefel, H.-P. (1977). Numerische optimierung von computer-modellen mittels der evolutionsstrategie. Interdisciplinary Systems Research, 26

    Google Scholar 

  79. Sinha, A. (2003a). Designing efficient genetic and evolutionary hybrids. Master’s thesis, University of Illinois at Urbana-Champaign, Urbana, IL. Also IlliGAL Report No. 2003020

    Google Scholar 

  80. Sinha, A. (2003b). A survey of hybrid genetic and evolutionary algorithms. IlliGAL Report No. 2003004, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL

    Google Scholar 

  81. Smith, R., Dike, B., and Stegmann, S. (1995). Fitness inheritance in genetic algorithms. In Proceedings of the ACM Symposium on Applied Computing, pages 345-350, New York, NY, USA. ACM

    Google Scholar 

  82. Srivastava, R. (2002). Time continutation in genetic algorithms. Master’s thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL

    Google Scholar 

  83. Srivastava, R. and Goldberg, D. E. (2001). Verification of the theory of genetic and evolutionary continuation. Proceedings of the Genetic and Evolutionary Computation Conference, pages 551-558. (Also IlliGAL Report No. 2001007)

    Google Scholar 

  84. Tanese, R. (1989). Distributed genetic algorithms for function optimization. PhD thesis, University of Michigan, Ann Arbor, MI.(University microfilms no. 8520908)

    Google Scholar 

  85. Vaughan, D., Jacobson, S., and Armstrong, D. (2000). A new neighborhood function for discrete manufacturing process design optimization using generalized hill climbing algorithms. ASME Journal of Mechanical Design, 122(2):164-171

    Article  Google Scholar 

  86. Watson, J.-P. (2003). Empirical Modeling and Analysis of Local Search Algorithms For The Job-Shop Scheduling Problem. PhD thesis, Colorado State University, Fort Collins, CO

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois at Urbana-Champaign, 104 S. Mathews Ave., IL 61801, Urbana, USA

    Kumara Sastry

  2. University of Missouri at St. Louis, One University Blvd. St. Louis, MO 63121, USA

    Dr. Martin Pelikan

  3. University of Illinois at Urbana-Champaign 104 S., Mathews Avenue Urbana, IL 61801, USA

    David E. Goldberg

Authors
  1. Kumara Sastry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. Martin Pelikan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David E. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Math. And Computer Science, University of Missouri at St. Louis, One University Blvd., 320 CCB, MO 63121, St. Louis, USA

    Martin Pelikan

  2. Department of Industrial and Enterprise Systems Engineering, Illinois Genetic Algorithms Laboratory, 414 TB, 104 S. Mathews Ave., IL 61801, Urbana, USA

    Kumara Sastry

  3. Yahoo! Inc., 701 First Avenue, CA 94809, Sunnyvale, USA

    Erick CantúPaz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sastry, K., Pelikan, M., Goldberg, D.E. (2006). Efficiency Enhancement of Estimation of Distribution Algorithms. In: Pelikan, M., Sastry, K., CantúPaz, E. (eds) Scalable Optimization via Probabilistic Modeling. Studies in Computational Intelligence, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34954-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-34954-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34953-2

  • Online ISBN: 978-3-540-34954-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation