New ideas in optimization
Evolutionary Computation at the Edge of Feasibility
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
The Ant Colony Metaphor for Searching Continuous Design Spaces
Selected Papers from AISB Workshop on Evolutionary Computing
Stochastic ranking for constrained evolutionary optimization
IEEE Transactions on Evolutionary Computation
Journal of Global Optimization
| Hi-index | 0.00 |
This paper presents a novel boundary approach which is included as a constraint-handling technique in an ant colony algorithm. The necessity of approaching the boundary between the feasible and infeasible search space for many constrained optimization problems is a paramount challenge for every constraint-handling technique. Our proposed technique precisely focuses the search on the boundary region and can be either used alone or in combination with other constraint-handling techniques depending on the type and number of problem constraints. For validation purposes, an ant algorithm is adopted as our search engine. We compare our proposed approach with respect to constraint-handling techniques that are representative of the state-of-the-art in constrained evolutionary optimization using a set of standard test functions.