An enhanced heuristic searching algorithm for complicated constrained optimization problems

Authors:
Feng Yu;Yanjun Li;Tie-Jun Wu
Affiliations:
National Laboratory of Industrial Control Technology, Institute of Intelligent Systems & Decision Making, Zhejiang University, Hangzhou, China;National Laboratory of Industrial Control Technology, Institute of Intelligent Systems & Decision Making, Zhejiang University, Hangzhou, China;National Laboratory of Industrial Control Technology, Institute of Intelligent Systems & Decision Making, Zhejiang University, Hangzhou, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 4
Cited 0

A new adaptive penalty scheme for genetic algorithms

Information Sciences: an International Journal - Special issue: Evolutionary computation
Stochastic ranking for constrained evolutionary optimization

IEEE Transactions on Evolutionary Computation
Ants can solve constraint satisfaction problems

IEEE Transactions on Evolutionary Computation
A simple multimembered evolution strategy to solve constrained optimization problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.