![]() |
![]()
| ![]() |
![]()
NAMErectangle-coverage.pl - Find the dot maximally covered by (random) rectangles SYNOPSISYou might have to do prompt% cpanm --installdeps . first, since that module is not installed by default with Algorithm::Evolutionary. Use "sudo" if appropriate. prompt% ./rectangle-coverage.pl <number-of-rectangles> <arena-side> <bits-per-coordinate> <population> <number of generations> <selection rate> Or prompt% ./rectangle-coverage.pl And change variable values from the user interface DESCRIPTIONA demo that combines the Algorithm::Evolutionary::Op::Easy module
Use "Start" to start the algorithm after setting the
variables, and
Default values are as follows
This program also demonstrates the use of caches in the fitness evaluation, so be careful if you use too many bits or too many generations, check out memory usage. Console output shows the number of generations, the winning chromosome, and fitness. After finishing, it outputs time, cache ratio and some other things. SEE ALSOFirst, you should obviously check
Tk is a prerrequisite for this program, as well as
AUTHORJ. J. Merelo, "jj (at) merelo.net" CopyrightThis file is released under the GPL. See the LICENSE file included in this distribution, or go to http://www.fsf.org/licenses/gpl.txt CVS Info: $Date: 2012/12/08 10:12:37 $ $Header: /media/Backup/Repos/opeal/opeal/Algorithm-Evolutionary/scripts/rectangle-coverage.pl,v 3.5 2012/12/08 10:12:37 jmerelo Exp $ $Author: jmerelo $ $Revision: 3.5 $
|