GSP
Quick Navigator
Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
RECTANGLE-COVERAGE(1) User Contributed Perl Documentation RECTANGLE-COVERAGE(1)

rectangle-coverage.pl - Find the dot maximally covered by (random) rectangles

You 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

A demo that combines the Algorithm::Evolutionary::Op::Easy module with Tk to create a visual demo of the evolutionary algorithm. It generates randomly a number of rectangles, and shows how the population evolves to find the solution. The best point is shown in darkening yellow color, the rest of the population in green.

Use "Start" to start the algorithm after setting the variables, and then Finish to stop the EA, Exit to close the window.

Default values are as follows

  • number of rectangles: 300
  • arena-side: 10 This is independent from the number of pixels, set by default to 600x600.
  • bits-per-coordinate: 32 (this is the chromosome length divided by two; there are two "genes")
  • population size: 64
  • number of generations: 200
  • selection rate: 20% (will be replaced each generation); this means it's a steady state algorithm, which only changes a part of the population each generation.

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.

First, you should obviously check Algorithm::Evolutionary::Op::Easy, and then these other classes.
  • Algorithm::Evolutionary::Op::Base.
  • Algorithm::Evolutionary::Individual::Base.
  • Algorithm::Evolutionary::Fitness::Base.

Tk is a prerrequisite for this program, as well as Algorithm::RectanglesContainingDot. Obviously, Algorithm::Evolutionary should be installed too, just in case you got this independently.

J. J. Merelo, "jj (at) merelo.net"

This 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 $
2015-10-31 perl v5.32.1
Search for    or go to Top of page |  Section 1 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.