Handling equality constraints by adaptive relaxing rule for swarm algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The adaptive constraints relaxing rule for swarm algorithms to handle with the problems with equality constraints is presented. The feasible space of such problems may be similiar to ridge function class, which is hard for applying swarm algorithms. To enter the solution space more easily, the relaxed quasi feasible space is introduced and shrinked adaptively. The experimental results on benchmark functions are compared with the performance of other algorithms, which show its efficiency.
Congress on Evolutionary Computation, 2004. CEC2004. Volume: 2, On page(s): 2012- 2016 Vol.2

Keywords

Neural and Evolutionary Computing

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32788

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0505068
 http://arxiv.org/abs/cs/0505068

Collections

arXiv