Handling equality constraints by adaptive relaxing rule for swarm algorithms

Details Handling equality constraints by adaptive relaxing rule for swarm algorithms Handling equality constraints by adaptive relaxing rule for swarm algorithms

2005-05-25

arxiv.org/abs/cs/0505068v1

Computer Science

Neural and Evolutionary Computing

Congress on Evolutionary Computation, 2004. CEC2004. Volume: 2, On page(s): 2012- 2016 Vol.2

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Handling equality constraints by adaptive relaxing rule for swarm algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Handling equality constraints by adaptive relaxing rule for swarm algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Handling equality constraints by adaptive relaxing rule for swarm algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641604