An Enhanced Heuristic Searching Algorithm for Complicated Constrained Optimization Problems
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.
KeywordsFeasible Solution Candidate Solution Benchmark Problem Heuristic Information Feasible Space
Unable to display preview. Download preview PDF.
- 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
- 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
- 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