Problem in Ranking Function in Genetic Algorithm
- From: "alessandro.vivas@xxxxxxxxx" <alessandro.vivas@xxxxxxxxx>
- Date: Mon, 15 Oct 2007 01:14:20 -0700
Hi, I'm working with genetic algorithm to calculate a problem with
many restrictions. So my problem is a minimization and the cost of the
best result is near of zero. When I put restrictions I add cost to
objective function. Each violation of the restriction I add 100 to
cost function. I using some ranking techniques like linear ordering,
exponential ordering and mutation/crossover tax adaptively. The
problem is the difference between maximum e minimum of cost function
is very large (minimum near of zero e maximum near of 1000). How to
ranking this function to selection operator works?
Thanks
.
- Follow-Ups:
- Re: Problem in Ranking Function in Genetic Algorithm
- From: inmanh
- Re: Problem in Ranking Function in Genetic Algorithm
- Prev by Date: crossover operator that favors big subtrees over small ones
- Next by Date: Re: Problem in Ranking Function in Genetic Algorithm
- Previous by thread: crossover operator that favors big subtrees over small ones
- Next by thread: Re: Problem in Ranking Function in Genetic Algorithm
- Index(es):
Relevant Pages
|
|