Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An Enhanced Heuristic Searching Algorithm for Complicated Constrained Optimization Problems

  • Conference paper
Intelligent Computing (ICIC 2006)

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

Included in the following conference series:

Abstract

In many complicated constrained optimization problems, intelligent searching technique based algorithms are very inefficient even to get a feasible solution. This paper presents an enhanced heuristic searching algorithm to solve this kind of problems. The proposed algorithm uses known feasible solutions as heuristic information, then orients and shrinks the search spaces towards the feasible set. It is capable of improving the search performance significantly without any complicated and specialized operators. Benchmark problems are tested to validate the effectiveness of the proposed algorithm.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Mezura-Montes, E., Coello, C.A.C.: A Simple Multimembered Evolution Strategy to Solve Constrained Optimization Problems. IEEE Trans. on Evol. Comput. 9, 1–17 (2005)

    Article  Google Scholar 

  2. Michalewicz, Z.: A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In: Proc. of the 4th Annual Conference on Evolutionary Programming, pp. 135–155. MIT Press, Cambridge (1995)

    Google Scholar 

  3. Carlson, S.E.: A General Method for Handling Constraints in Genetic Algorithms. In: Proc. 2th Annual Joint Conference on Information Science, pp. 663–666 (1995)

    Google Scholar 

  4. Helio, J.C.B., Afonso, C.C.L.: A New Adaptive Penalty Schema for Genetic Algorithms. Informatino Sciences 156, 215–251 (2003)

    Article  Google Scholar 

  5. Tan, K.C., Lee, T.H., Khoo, D., Khor, E.F.: Constrained Evolutionary Exploration via Genetic Structure of Packet Distribution. IEEE Proceedings of the 2001 Congress on Evolutionary Computation 1, 27–30 (2001)

    Google Scholar 

  6. Runarsson, T.P., Yao, X.: Stochastic Ranking for Constrained Evolutionary Optimization. IEEE Trans. on Evolutionary Computation 4, 284–294 (2000)

    Article  Google Scholar 

  7. Solnon, C.: Ants Can Solve Constraint Satisfaction Problems. IEEE Transaction on Evolutionary 6, 347–357 (2002)

    Article  Google Scholar 

  8. Li, Y., Hill, D.J., Wu, T.-J.: Nonlinear Predictive Control Scheme with Immune Optimization for Voltage Security Control of Power System. Automation of Electric Power Systems 28, 25–31 (2004)

    Google Scholar 

  9. http://www.sor.princeton.edu/rvdb/ampl/nlmodels/cute/airport.mod

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, F., Li, Y., Wu, TJ. (2006). An Enhanced Heuristic Searching Algorithm for Complicated Constrained Optimization Problems. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_106

Download citation

  • DOI: https://doi.org/10.1007/11816157_106

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37271-4

  • Online ISBN: 978-3-540-37273-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics