[ Home | Docs | News | Resources | Download] |
GAUL Documentation: Simplex Search |
Brief Simplex Search Primer The simplex algorithm is commonly applied to solve linear programming problems. It is relatively effective on noisy fitness landscapes but often does not sample the entire search space. A canonical simplex search algorithm places N+1 points randomly in the N dimensional search space. The worst point is reflected across the plane defined by the other N points. Then the points are contracted or expanded according to the characteristics of the search space that they cover. These two steps are repeatted until some convergence criteria are satisfied. In two or three dimensional space, the set of points resemble an ameoba creeping around to the global maxima. Algorithm Implemented in GAUL
Using the GAUL Simplex Search A general simplex search algorithm is implemented in GAUL. It is used in a very similar way to the tabu search algorithm. One restriction of the simplex algorithm is that the chromosome must be mapped onto a double-precision floating-point array. A couple of examples using the simplex search are distributed with GAUL, including examples/fitting_simplex.c which attempts to fit an equation of the form y = Ax exp{Bx+C} + D to an arbitrary dataset, by selecting appropriate values for the parameters A, B, C and D. |
[ BACK TO TOP | NEXT SECTION OF TUTORIAL ]
[ Home | Docs | News | Resources | Download] |
Hosted by: |
© 2003-2009, "Stewart Adcock" <stewart@linux-domain.com> All rights reserved. |
All trademarks on this page are probably owned by their respective companies. You can insert you own favourite disclaimer here. |