Multiobjectivization via helper-objectives with the tunable objectives problem

IEEE Transactions on Evolutionary Computation

Volumn 16, Issue 3, 2012, Pages 373-390

  Lochtefeld, Darrell F ^a   Ciarallo, Frank W ^b  

^a AIR FORCE RESEARCH LABORATORY   (United States)

^b Wright State University   (United States)

Author keywords

Helper objectives; multiobjectivization; tunable objectives problem (TOP)

Indexed keywords

HELPER-OBJECTIVES; LOCAL OPTIMA; MODELING POWER; MULTIOBJECTIVIZATION; MULTIPLE LAYERS; OPTIMIZATION TECHNIQUES; PROBLEM DIFFICULTY; PROBLEM STRUCTURE; SIGNAL TO NOISE; TUNABLE OBJECTIVES PROBLEM (TOP);

CALCULATIONS; SOFTWARE ENGINEERING;

OPTIMIZATION;

EID: 84861806490     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2136345     Document Type: Article

References (32)

1. D. F. Lochtefeld and F. W. Ciarallo, Deterministic helper-objective sequence applied to the job-shop scheduling problem, in Proc. 12th Annu. Conf. GECCO, 2010, pp. 431-438.
2. M. T. Jensen, Helper-objectives: Using multiobjective evolutionary algorithms for single-objective optimization, J. Math. Model. Algor., vol. 3, no. 4, pp. 323-347, 2004. (Pubitemid 40317582)
3. J. D. Knowles, R. A. Watson, and D. W. Corne, Reducing local optima in single-objective problems by multi-objectivization, in Proc. 1st Int. Conf. EMO), LNCS 1993. 2001, pp. 269-283.
4. D. F. Lochtefeld and F. W. Ciarallo, Helper-objective optimization strategies for the job-shop scheduling problem, J. Appl. Soft Comp., vol. 11, no. 6, pp. 4161-4174, 2011.
5. S. W. Smith, The Scientist and Engineer's Guide to Digital Signal Processing. Burlington, MA: Newnes, 2003.
6. M. Jahne, X. Li, and J. Branke, Evolutionary algorithms and multiobjectivization for the traveling salesman problem, in Proc. 11th Annu. Conf. GECCO, 2009, pp. 595-602.
7. J. Handl, S. C. Lovell, and J. Knowles, Multi-objectivization by decomposition of scalar cost functions, in Proc. 10th Int. Conf. PPSN, LNCS 5199. 2008, pp. 31-40.
8. J. Knowles and D. Corne, The Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimization, in Proc. CEC, 1999, pp. 98-105.
9. M. T. Jensen, Guiding single-objective optimization using multiobjective methods, in Applications of Evolutionary Computing (Lecture Notes in Computer Science, vol. 2611). Berlin, Germany: Springer, 2003, pp. 91-98.
10. J. Scharnow, K. Tinnefeld, and I. Wegener, The analysis of evolutionary algorithms on sorting and shortest paths problems, J. Math. Model. Algor., vol. 3, no. 4, pp. 349-366, 2004. (Pubitemid 40317583)
11. F. Neumann and I. Wegener, Can single-objective optimization profit from multiobjective optimization? in Multiobjective Problem Solving From Nature: From Concepts to Applications. Berlin, Germany: Springer, 2007, pp. 115-130.
12. D. E. Goldberg, Genetic algorithms andWalsh functions: Part I, a gentle introduction, Complex Syst., vol. 3, no. 2, pp. 129-152, 1989.
13. D. E. Goldberg, Genetic algorithms and Walsh functions: Part II, deception and its analysis, Complex Syst., vol. 3, no. 2, pp. 153-171, 1989.
14. Y. Davidor, Epistasis variance: A viewpoint on GA-hardness, in Foundations of Genetic Algorithms-1. San Mateo, CA: Morgan Kaufmann, 1991, pp. 23-35.
15. L. Barnett, Ruggedness and neutrality: The NKp family of fitness landscapes, in Proc. 6th Int. Conf. Artif. Life, 1998, pp. 18-27.
16. D. Beasley, R. R. Martin, and D. R. Bull, An overview of genetic algorithms: Part 1. Fundamentals, Univ. Comput., vol. 15, no. 2, p. 58, 1993.
17. B. Naudts, D. Suys, and A. Verschoren, Epistasis as a basic concept in formal landscape analysis, in Proc. 7th ICGA, 1997, pp. 65-72.
18. B. Naudts and A. Verschoren, Epistasis and deceptivity, Bull. Belgian Math. Soc., vol. 6, no. 1, pp. 147-154, 1999.
19. C. R. Reeves and C. C. Wright, Epistasis in genetic algorithms: An experimental design perspective, in Proc. 6th Int. Conf. Genet. Algorithms, 1995, pp. 217-224.
20. M. Mitchell, S. Forrest, and J. H. Holland, The royal road for genetic algorithms: Fitness landscapes and GA performance, in Proc. 1st Eur. Conf. Artif. Life: Toward a Practice Autonomous Syst., 1992, pp. 245-254.
21. B. Naudts, D. Suys, and A. Verschoren, Generalized royal road functions and their epistasis, Comput. Artif. Intell., vol. 19, no. 4, pp. 317-334, 2000.
22. S. A. Kauffman and E. D. Weinberger, The NK model of rugged fitness landscapes and its application to maturation of the immune response, J. Theor. Biol., vol. 141, no. 2, pp. 211-245, Nov. 1989. (Pubitemid 20036173)
23. W. Fontana, P. F. Stadler, E. G. Bornberg-Bauer, T. Griesmacher, I. L. Hofacker, M. Tacker, P. Tarazona, E. D. Weinberger, and P. Schuster, RNA folding and combinatory landscapes, Phys. Rev. E, vol. 47, pp. 2083-2099, Mar. 1993.
24. E. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biol. Cybern., vol. 63, no. 5, pp. 325-336, 1990. (Pubitemid 20289470)
25. M. E. J. Newman and R. Engelhardt, Effects of selective neutrality on the evolution of molecular species, in Proc. Biol. Sci., vol. 265. 1998, pp. 1333-1338. (Pubitemid 28372091)
26. N. Geard, J. Wiles, J. Hallinan, B. Tonkes, and B. Skellett, A comparison of neutral landscapes: nk, nkp and nkq, in Proc. IEEE CEC, May 2002, pp. 205-210.
27. K. A. De Jong, M. A. Potter, and W. M. Spears, Using problem generators to explore the effects of epistasis, in Proc. 7th Int. Conf. Genet. Algorithms, 1997, pp. 338-345.
28. T. Weise, S. Niemczyk, H. Skubch, R. Reichle, and K. Geihs, A tunable model for multiobjective, epistatic, rugged, and neutral fitness landscapes, in Proc. 10th Annu. Conf. GECCO, 2008, pp. 795-802.
29. R. W. Hamming, Error detecting and error correcting codes, Bell Syst. Tech. J., vol. 29, pp. 147-160, Apr. 1950.
30. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comp., vol. 6, no. 2, pp. 182-197, Apr. 2002. (Pubitemid 34555372)
31. J. N. Hooker, Needed: An empirical science of algorithms, Oper. Res., vol. 42, no. 2, pp. 201-212, 1994.
32. N. G. Hall and M. E. Posner, Generating experimental data for computational testing with machine scheduling applications, Oper. Res., vol. 49, no. 6, pp. 854-865, Nov. 2001. (Pubitemid 34271873)