An EA Framework for Uncertain Optimization Problem

Research output: Book chapter/Published conference paperConference paperpeer-review

30 Downloads (Pure)


Many engineering design projects involve solving complex optimization problems. Evolutionary algorithms (EA) have been widely accepted as efficient optimizers for complex real life problems [2]. However, many real life optimization problems involve time-variant noisy environment, which pose major challenges to EA-based optimization. Presence of noise interferes with the evaluation and the selection process of EA and adversely affects the performance of the algorithm [6]. Also presence of noise means fitness function can not be evaluated and it has to be estimated instead. Several approaches have been tried to overcome this problem, such as introduction of diversity (hyper mutation, random immigrants, special operators) or incorporation of memory of the past (diploidy, case based memory) [5]. In this paper we propose a method, DPGA (distributed population genetic algorithm) that uses a distributed population based architecture to simulate a distributed, self-adaptive memory of the solution space. Local regression is used in each sub-population to estimate the fitness. Specific problem category considered is that of optimization of functions with time variant noisy fitness. Successful applications to benchmark test problems ascertain the proposed method's superior performance in terms of both adaptability and accuracy.
Original languageEnglish
Title of host publicationIPROMS2007
Place of PublicationUK
PublisherWhittles Publishing
Number of pages6
ISBN (Electronic)9781904445524
Publication statusPublished - 2007
EventInnovative Production Machines and Systems (IPROMS) Virtual International Conference - Web based, Cardiff University, UK, United Kingdom
Duration: 02 Jul 200713 Jul 2007


ConferenceInnovative Production Machines and Systems (IPROMS) Virtual International Conference
Country/TerritoryUnited Kingdom


Dive into the research topics of 'An EA Framework for Uncertain Optimization Problem'. Together they form a unique fingerprint.

Cite this