Skip to main content

Hybrid Population-Based Incremental Learning Using Real Codes

  • Conference paper
Learning and Intelligent Optimization (LION 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6683))

Included in the following conference series:

Abstract

This paper proposes a hybrid evolutionary algorithm (EA) dealing with population-based incremental learning (PBIL) and some efficient local search strategies. A simple PBIL using real codes is developed. The evolutionary direction and approximate gradient operators are integrated to the main procedure of PBIL. The method is proposed for single objective global optimization. The search performance of the developed hybrid algorithm for box-constrained optimization is compared with a number of well-established and newly developed evolutionary algorithms and meta-heuristics. It is found that, with the given optimization settings, the proposed hybrid optimizer outperforms the other EAs. The new derivative-free algorithm can maintain outstanding abilities of EAs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Farina, M., Amato, P.: Linked Interpolation-Optimization Strategies for Multicriteria Optimization Problems. Soft Computing 9, 54–65 (2005)

    Article  Google Scholar 

  2. Srisoporn, S., Bureerat, S.: Geometrical Design of Plate-Fin Heat Sinks Using Hybridization of MOEA and RSM. IEEE Transactions on Components and Packaging Technologies 31, 351–360 (2008)

    Article  Google Scholar 

  3. Kaveh, A., Talatahari, S.: Particle Swarm Optimizer, Ant Colony Strategy and Harmonic Search Scheme Hybridized for Optimization of Truss Structures. Computer and Structures 87, 1245–1287 (2009)

    Google Scholar 

  4. Baluja, S.: Population-Based Incremental Learning: a Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report CMU_CS_95_163, Carnegie Mellon University (1994)

    Google Scholar 

  5. Sebag, M., Ducoulombier, A.: Extending Population-Based Incremental Learning to Continuous Search Spaces. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 418–427. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Yuan, B., Gallagher, M.: Playing in Continuous Spaces: Some Analysis and Extension of Population-Based Incremental Learning. In: CEC 2003, CA, USA, pp. 443–450 (2003)

    Google Scholar 

  7. Bureerat, S., Cooper, J.E.: Evolutionary Optimisation Using Evolutionary Direction and Pseudo-Gradient. In: 1st ASMO UK/ISSMO, Ilkley, UK, pp. 81–87 (1999)

    Google Scholar 

  8. Yamamoto, K., Inoue, O.: New Evolutionary Direction Operator for Genetic Algorithms. AIAA 33, 1990–1993 (1995)

    Article  MATH  Google Scholar 

  9. Lindfield, G., Penny, J.: Numerical Methods Using MATLAB. Ellis Horwood, England (1995)

    MATH  Google Scholar 

  10. Socha, K., Dorigo, M.: Ant Colony Optimization for Continuous Domains. European Journal of Operational Research 185, 1155–1173 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Herrera, F., Lozano, M., Molona, D.: Continuous Scatter Search: An Analysis of the Integration of Some Combination Methods and Improvement Strategies. European Journal of Operational Research 169, 450–476 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kaveh, A., Talatahari, S.: A Novel Heuristic Optimization Method: Charged System Search. Acta Mechanica 213, 267–289 (2010)

    Article  MATH  Google Scholar 

  13. Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces. Technical Report TR-95-012. International Computer Science Institute, Berkeley, CA (1995)

    Google Scholar 

  14. Teh, Y.S., Rangaiah, G.P.: Tabu Search for Global Optimization of Continuous Functions with Application to Phase Equilibrium Calculations. Computers and Chemical Engineering 27, 1665–1679 (2003)

    Article  Google Scholar 

  15. Tan, Y., Zhu, Y.: Fireworks Algorithm for Optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 355–364. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Reyes-Sierra, M., Coello Coello, C.A.: Multi-objective Particle Swarm Optimizers: a Survey of the State-of-the-Art. Int. J. of Computational Intelligence Research 2, 287–308 (2006)

    MathSciNet  Google Scholar 

  17. Bureerat, S., Limtragool, J.: Structural Topology Optimisation Using Simulated Annealing with Multiresolution Design Variables. Finite Element in Analysis and Design 44, 738–747 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bureerat, S. (2011). Hybrid Population-Based Incremental Learning Using Real Codes. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25566-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25565-6

  • Online ISBN: 978-3-642-25566-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics