In a certain area there are N villages, and j'th village requires M(j) phone lines. Cost of a line is $1 per 1 km. Where should a phone company locate a (unique) station to cover the demand at the minimum cost?
Formulation:
There are m points A1,...,Am on the 2D plane. The problem is to minimize the weighted sum:
W1*|X-A1| + ... + Wm*|X-Am|
of the Euclidean distances from the design point X to the given points Ai.
Wi are user-set nonnegative weights.
Since all cities are located on a circle, it is obvious that the best location is at the circle's center. This fact (which is known to us but not to the computer) makes it easy to follow the advance on the graphical display.
The number of cities can be changed by editing the 'Number of Genes' value in the Parameters screen.
If the number of genes is modified to a new value N, modify the 'Maximum Value' parameter to N-1.
Instructions:
The applet requires a browser that supports JDK 1.1.5 or above
The applet has a relatively long loading time
Hide browser's toolbars to make the whole applet visible without scrolling
Optionally select 'Parameters' from the 'GA' menu to modify problem attributes
Select 'Execute' from the 'GA' menu to run the program
Status bar help tips can be toggled On or Off through the 'Options' menu
Text window reporting can be toggled On or Off through the 'Options/Switches' menu