Random bit climbers on multiobjective MNK-landscapes: Effects of memory and population climbing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 1, 2005, Pages 334-345

  Aguirre, Hernán ^a,b,c   Tanaka, Kiyoshi ^{a,b,c,d,e,f,g,h}  

^a SHINSHU UNIVERSITY   (Japan)

^b IEEE   (Japan)

^c ISGEC   (India)

^d SPIE   (Japan)

^e EURASIP   (Japan)

^f IPSJ   (Japan)

^g IIEEJ   (Japan)

^h Sita Messtechnik GmbH   (Germany)

Author keywords

Epistasis; Evolutionary algorithms; Multiobjective MNK Landscapes; Non linear fitness functions; Population climbing; Random bit climbers

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS;

EPISTASIS; MULTIOBJECTIVE MNK-LANDSCAPES; NON-LINEAR FITNESS FUNCTIONS; POPULATION CLIMBING; RANDOM BIT CLIMBERS;

LANDSLIDES;

EID: 27544499295     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/E88-A.1.334     Document Type: Conference Paper

References (16)

1. S.A. Kauffman, The Origins of Order: Self-Organization and Selection in Evolution, Oxford University Press, New York, 1993.
2. L. Altenberg, "Evolving better representations through selective genome growth," Proc. 1st IEEE Conf. on Evolutionary Computation, pp. 182-187, IEEE Press, 1994.
3. R. Heckendorn, S. Rana, and D. Whitley, "Test function generators as embedded landscapes," in Foundations of Genetic Algorithms 5, pp. 183-198, Morgan Kaufmann, 1999.
4. R.E. Smith and J.E. Smith, "An examination of tunable, random search landscapes," in Foundations of Genetic Algorithms 5, pp.165-182, Morgan Kaufmann, 1999.
5. K.E. Mathias, L.J. Eshelman, and D. Schaffer, "Niches in NK-landscapes," in Foundations of Genetic Algorithms 6, pp.27-46, Morgan Kaufmann, 2001.
6. R.E. Smith and J.E. Smith, "New methods for tunable, random landscapes," in Foundations of Genetic Algorithms 6, pp.47-67, Morgan Kaufmann, 2001.
7. H. Aguirre and K. Tanaka, "Genetic algorithms on NK-landscapes: Effects of selection, drift, mutation, and recombination," IEICE Trans. Fundamentals, vol.E86-A, no.9, pp.2270-2279, Sept. 2003.
8. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, Chichester, West Sussex, England, 2001.
9. C.A. C Coello, D.A.V. Veldhuizen, and G. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, Boston, 2002.
10. D. Nam and C.H. Park, "Multiobjective simulated annealing: A comparative study to evolutionary algorithms," Int. J. Fuzzy Systems, vol.2, no.2, pp.87-97, 2000.
11. J. Knowles and D. Corne, "Approximating the non-dominated front using the Pareto archived evolution strategy," Evolutionary Computation, vol.8, no.2, pp. 149-172, 2000.
12. E. Zitzler, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, PhD Thesis, Swiss Federal Institute of Technology, Zurich, 1999.
13. M.P. Hansen and A. Jaszkiewicz, "Evaluating the quality of approximations to the non-dominated set," Technical Report IMM-REP-1998-7, Technical University of Denmark, March 1998.
14. J. Knowles and D. Corne, "On metrics for comparing non-dominated sets," Proc. 2002 Congress on Evolutionary Computation, pp.711-716, IEEE Press, 2002.
15. M. Fleischer, "The measure of pareto optima: Applications to multiobjective metaheuristics," Second Intl. Conf. on Evolutionary Multi-Criterion Optimization (EMO 2003), Lecture Notes in Computer Science, vol.2632, pp.519-533, Springer, 2003.
16. J.R. Schott, Fault Tolerant Design Using Single and Multi-Criteria Genetic Algorithms, Master's Thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Boston, MA, 1995.