Show simple item record

From Genetic Algorithms to Efficient Organization

dc.date.accessioned2004-10-20T20:28:03Z
dc.date.accessioned2018-11-24T10:22:57Z
dc.date.available2004-10-20T20:28:03Z
dc.date.available2018-11-24T10:22:57Z
dc.date.issued1994-05-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/7068
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/7068
dc.description.abstractThe work described in this thesis began as an inquiry into the nature and use of optimization programs based on "genetic algorithms." That inquiry led, eventually, to three powerful heuristics that are broadly applicable in gradient-ascent programs: First, remember the locations of local maxima and restart the optimization program at a place distant from previously located local maxima. Second, adjust the size of probing steps to suit the local nature of the terrain, shrinking when probes do poorly and growing when probes do well. And third, keep track of the directions of recent successes, so as to probe preferentially in the direction of most rapid ascent. These algorithms lie at the core of a novel optimization program that illustrates the power to be had from deploying them together. The efficacy of this program is demonstrated on several test problems selected from a variety of fields, including De Jong's famous test-problem suite, the traveling salesman problem, the problem of coordinate registration for image guided surgery, the energy minimization problem for determining the shape of organic molecules, and the problem of assessing the structure of sedimentary deposits using seismic data.en_US
dc.format.extent1222037 bytes
dc.format.extent1136233 bytes
dc.language.isoen_US
dc.titleFrom Genetic Algorithms to Efficient Organizationen_US


Files in this item

FilesSizeFormatView
AITR-1569.pdf1.136Mbapplication/pdfView/Open
AITR-1569.ps1.222Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record