Search space reduction technique for constrained optimization with tiny feasible space

The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solution quality. It becomes even more challenging when the feasible space is very tiny compare to the search space. Usually, the quality of the initial solutions influences the performance of the algorithm in solving such problems. In this paper, we discuss an Evolutionary Agent System (EAS) for solving COPs. In EAS, we treat each individual in the population as an agent. To enhance the performance of EAS for solving COPs with tiny feasible space, we propose a Search Space Reduction Technique (SSRT) as an initial step of our algorithm. SSRT directs the selected infeasible agents in the initial population to move towards the feasible space. The performance of the proposed algorithm is tested on a number of test problems and a real world case problem. The experimental results show that SSRT not only improves the so...

• Type: Conference
• Year: 2008
• Where: GECCO
• Authors: Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David Cornforth
• Keywords: Feasible Space, GECCO 2008, Optimization, Search Space, Tiny Feasible Space