A Genetic Algorithm for Minimax Optimization

Simple item page
dc.contributor.authorHerrmann, Jeffrey W.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:04:17Z
dc.date.available2007-05-23T10:04:17Z
dc.date.issued1997en_US
dc.description.abstractThis paper describes a two-space genetic algorithm that finds solutions to minimax optimization problems. The genetic algorithm maintains two populations and searches both simultaneously. Each individual is evaluated with respect to the individuals in the other population. Preliminary experimental results confirm that the algorithm can find good solutions to minimax optimization problems.en_US
dc.format.extent513566 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5878
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1997-61en_US
dc.subjectalgorithmsen_US
dc.subjectoptimizationen_US
dc.subjectplant layouten_US
dc.subjectrobust designen_US
dc.subjectIntelligent Control Systemsen_US
dc.titleA Genetic Algorithm for Minimax Optimizationen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_97-61.pdf
Size:
501.53 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports