A Trivial 10 Variables Optimization Problem
Maximize: (x1*x2*x3*x4*x5)/(x6*x7*x8*x9*x10), (x1..x10) = [1..10]
Problem Specific Notes:
- The problem definition file is Simpleton.par
- The maximum is obviously when the first five variables equal 10 and the last five variables equal 1. The function value for this case is 100000.
- This function is trivial to us, but the computer does not see any shortcuts, and it searches for the minimum solution blindly.
- The graphical display shows that although the evolution mechanism is gradual, evolution moves in well defined steps (as can be seen by the horizontal lines).
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
|
Home Page |
Floys |
iFloys |
eFloys |
tFloys |
Floys Description |
Java CA |
Wica |
Doll House |
Picture-Browser |
Download |
Alife Database |
GA Playground |
Experiments |
Ariel Dolan
aridolan@netvision.net.il
Tel. 972-3-7526264
Fax. 972-3-5752173
Last modified on: Tuesday, 30 June, 1998.