[galib] reordering operators
fr.teodoro@gmail.com
fr.teodoro at gmail.com
Sat Feb 14 18:51:27 EST 2009
One example os use with GAlib:
void GAListGenomeFactory::setCrossover(::GAListGenome<int>* genome)
{
::GAGenome::SexualCrossover crossFunc;
switch (this->params.crossover) {
case View::GAListGenomeParams::PARTIAL_MATCH_CROSSOVER:
crossFunc = ::GAListGenome<int>::PartialMatchCrossover;
break;
case View::GAListGenomeParams::ORDER_CROSSOVER:
crossFunc = ::GAListGenome<int>::OrderCrossover;
break;
case View::GAListGenomeParams::CYCLE_CROSSOVER:
crossFunc = ::GAListGenome<int>::CycleCrossover;
break;
}
genome->crossover(crossFunc);
}
But I think Genetic Algorithms is not efficient for such problems, maybe you
want to tray something else like Ant Colony Optimization.
On Fri, Feb 13, 2009 at 01:04:00PM -0800, Bill Gibb wrote:
> Hello,
>
> I was wondering whether anyone has had any success using "reordering
> operators" with GAs (for combinatorial optimization). I found some
> theoretical treatments of reordering operators in the literature, but
> not much in the way of real-life success stories.
>
> Thanks.
>
> Bill
>
> _______________________________________________
> galib mailing list
> galib at mit.edu
> http://mailman.mit.edu/mailman/listinfo/galib
--
Fábio Roberto Teodoro
More information about the galib
mailing list