Thanks Sean--Cheers, Walker
From: ECJ Evolutionary Computation Toolkit
[mailto:[log in to unmask]] On Behalf Of Sean Luke
Sent: Thursday, December 27, 2012 7:29 PM
To: [log in to unmask]
Subject: Re: Dynamic Penalty Function in a GA
Well... my book doesn't really go into dynamic penalties all that much -- by
which I presume Charles is referring to the degree to which violations of
hard constraints are penalized and how that degree changes over the run.
Mostly just hints and stabs. If you're seriously doing a GA rather than a
combinatorial problem, I'd suggest looking into Zbigniew Michalewicz's
While we're on the subject of my book: I'm close to releasing the Second
Edition, which will correspond to the latest (plus minor tweaks) electronic
version. Should be out around January 1 on Lulu I think.
On Dec 27, 2012, at 7:02 PM, Mike Caron wrote:
> There is an algorithm in Sean Luke's Essentials of Metaheuristics
> book, http://cs.gmu.edu/~sean/book/metaheuristics/, on page 149
> through 154 that talks about penalty functions. You should buy the
> book if you are going to work in this space.