Multiobjectivization by decomposition of scalar cost functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5199 LNCS, Issue , 2008, Pages 31-40

  Handl, Julia ^a   Lovell, Simon C ^a   Knowles, Joshua ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; MULTIOBJECTIVE OPTIMIZATION; PROBABILITY DENSITY FUNCTION; OPTIMIZATION;

FITNESS LANDSCAPES; MULTIOBJECTIVE; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; ORIGINAL PROBLEMS; RUNNING TIME ANALYSIS;

PROBLEM SOLVING;

FITNESS LANDSCAPE; LOCAL OPTIMA; MULTI OBJECTIVE; OBJECTIVE FUNCTIONS; RUNNING TIME ANALYSIS; SINGLE OBJECTIVE OPTIMIZATION PROBLEMS;

EID: 56449108101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87700-4_4     Document Type: Conference Paper

References (14)

1. Brockhoff, D., Friedrich, T., Hebbinghaus, N., Klein, C., Neumann, F., Zitzler, E.: Do additional objectives make a problem harder. In: Proceedings of the 9th Annual Conference on Genetic and Rvolutionary Computation, pp. 765-772. ACM Press, New York (2007)
2. Porrest, S., Mitchell, M., Whitley, L.: Relative Building-Block Fitness and the Building-Block Hypothesis. In: Foundations of Genetic Algorithms 2, pp. 109-126. Morgan Kaufmann, San Mateo (1993)
3. Gamier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation 7(2), 173-203 (1999)
4. Hagerub, T., Rüb, C.: A guided tour of Chernoff bounds. Information Processing Letters 33, 305-308 (1989)
5. Hanne, T.: On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research 117(3), 553-564 (1999)
6. Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation 5(6), 589-599 (2001)
7. Jensen, M.T.: Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation. Journal of Mathematical Modelling and Algorithms 3(4), 323-347 (2004)
8. Juels, A., Wattenberg, M.: Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms. In: Touretzky, D.S. (ed.) Advances in Neural Information Processing Systems 8, pp. 430-436. MIT Press, Cambridge (1995)
9. Knowles, J.: Local-search and hybrid evolutionary algorithms for Pareto optimization. PhD thesis, University of Reading, UK (2002)
10. Knowles, J., Watson, R., Corne, D.: Reducing local optima in single-objective problems by multi-objectivization. In: Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization, pp. 269-283. Springer, Berlin (2001)
11. Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation 8(2), 149-172 (2000)
12. Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3), 305-319 (2006)
13. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Rudolph, G., et al. (eds.) PPSN X 2008. LNCS, vol. 5199, pp. 82-91. Springer, Berlin (2008)
14. Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 3(4), 346-366 (2004)