Skip to main content

Self-calibrating Strategies for Evolutionary Approaches that Solve Constrained Combinatorial Problems

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4994))

Included in the following conference series:

Abstract

In this paper, we evaluate parameter control strategies for evolutionary approaches to solve constrained combinatorial problems. For testing, we have used two well known evolutionary algorithms that solve the Constraint Satisfaction Problems GSA and SAW. We contrast our results with REVAC, a recently proposed technique for parameter tuning.

The authors were supported by the Fondecyt Project 1080110.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Davis, L.: Adapting Operator Probabilities in Genetic Algorithms. In: Proceedings of 3rd. International Conf. on Genetic Algorithms and their Applications (1989)

    Google Scholar 

  2. Deb, K., Agrawal, S.: Understanding Interactions among Genetic Algorithms Parameters. Foundations of Genetic Algorithms 5, 265–286 (1998)

    Google Scholar 

  3. Eiben, A., Hinterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Transactions on evolutionary computation 3(2), 124–141 (1999)

    Article  Google Scholar 

  4. Eiben, A.E., Marchiori, E., Valko, V.A.: Evolutionary Algorithms with on-the-fly Population Size Adjustment. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 41–50. Springer, Heidelberg (2004)

    Google Scholar 

  5. Hinterding, R., Michalewicz, Z., Eiben, A.: Adaptation in Evolutionary Computation: A Survey. In: Proceedings of 4th. IEEE International Conf. on Evolutionary Computation (1997)

    Google Scholar 

  6. Pettinger, J., Everson, R.: Controlling Genetic Algorithms with Reinforcement Learning. In: Proceedings of the GECCO 2002 (2002)

    Google Scholar 

  7. Riff, M.-C., Bonnaire, X.: Inheriting Parents Operators: A New Dynamic Strategy to improve Evolutionary Algorithms. In: Hacid, M.-S., Raś, Z.W., Zighed, A.D.A., Kodratoff, Y. (eds.) ISMIS 2002. LNCS (LNAI), vol. 2366, pp. 333–341. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Smith, J., Fogarty, T.C.: Operator and parameter adaptation in genetic algorithms. Soft Computing 1(2), 81–87 (1997)

    Article  Google Scholar 

  9. Tuson, A., Ross, P.: Adapting Operator Settings in Genetic Algorithms. Evolutionary Computation 2(6), 161–184 (1998)

    Article  Google Scholar 

  10. Nannen, V., Eiben, A.E.: Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters. In: Proceedings of the Joint International Conference for Artificial Intelligence (IJCAI) (2006)

    Google Scholar 

  11. Craenen, B.G.W., Eiben, A.E., van Hemert, J.I.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7(5), 424–444 (2003)

    Article  Google Scholar 

  12. Dozier, G., Bowen, J., Homaifar, A.: Solving Constraint Satisfaction Problems Using Hybrid Evolutionary Search. IEEE Transactions on Evolutionary Computation 2(1), 23–33 (1998)

    Article  Google Scholar 

  13. Gomez, J.: Self Adaptation of Operator Rates in Evolutionary Algorithms. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 1162–1173. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Aijun An Stan Matwin Zbigniew W. Raś Dominik Ślęzak

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montero, E., Riff, MC. (2008). Self-calibrating Strategies for Evolutionary Approaches that Solve Constrained Combinatorial Problems. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68123-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68122-9

  • Online ISBN: 978-3-540-68123-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics