ACM Home Page
Please provide us with feedback. Feedback
Fitness function for finding out robust solutions on time-varying functions
Full text PdfPdf (260 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 8th annual conference on Genetic and evolutionary computation table of contents
Seattle, Washington, USA
SESSION: Genetic algorithms: papers table of contents
Pages: 1195 - 1200  
Year of Publication: 2006
ISBN:1-59593-186-4
Author
Hisashi Handa  Okayama University, Okayama, Japan
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 34,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143997.1144186
What is a DOI?

ABSTRACT

Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, Robustness, Fitness approximation, and Time-Varying function. In research on Time-Varying function, the tracking property over changes of fitness landscape has been broadly and deeply researched so far. In this paper, instead of tracking new peaks, robust solution to Time-Varying functions is introduced. Moreover, two weighted fitness functions, Exponential Weight and Linear Weight, are proposed. Experiments on modified Branke's benchmark problems on Time-Varying function reveal the effectiveness of the weighted approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Thomas Bäck , Hans-Paul Schwefel, An overview of evolutionary algorithms for parameter optimization, Evolutionary Computation, v.1 n.1, p.1-23, Spring 1993
 
2
J. Branke. Memory-enhanced evolutionary algorithms for dynamic optimization problems. In Proc. Congress on Evolutionary Computation (CEC'99) volume 3, pages 1875--1882, 1999.
 
3
J. Branke, T. Kausler, C. Schmidt, and H. Schmeck. A multipopulation approach to dynamic optimization problems. In Proc. Adaptive Computing in Design and Manufacturing 2000 2000.
 
4
U. H. D. Wiesmann and T. Bäck. Robust design of multilayer optical coatings by means of evolutionary algorithms. IEEE Trans. Evolutionary Computation 2(4):162--167, 1998.
 
5
I. Das. Robustness optimization for constrained nonlinear programming problem. Engineering Optimization 32(5):585--618, 2000.
 
6
Y. Jin and J. Branke. Evolutionary optimization in uncertain environments -- a survey. IEEE Trans. Evolutionary Computation 9(3):303--317, 2005.
 
7
Y. Jin and B. Sendhoff. Tradeoff between performance and robustness:An evolutionary multiobjective approach. In Proc. Evolutionary Multi-Criterion Optimization, LNCS 2632 pages 237--251, 2003.
 
8
 
9
S. Tsutsui and A. Ghosh. Genetic algorithms with a robust solution searching scheme. IEEE Trans. Evolutionary Computation 1(3):201--208, 1997.
 
10
R. K. Ursem. Multinational ga optimization techniques in dynamic environments. In Proc. Genetic and Evolutionary Computation Conference pages 19--26, 2000.
 
11
K. Weicker and N. Weicker. On evolution strategy optimization in dynamic environments. In Proc. Congress on Evolutionary Computation (CEC'99) volume 3, pages 2039--2046, 1999.
 
12
X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Trans. Evolutionary Computation 3(2):82--102, 1999.