Multiobjectivization by Decomposition of Scalar Cost Functions

作者: Julia Handl , Simon C. Lovell , Joshua Knowles

DOI: 10.1007/978-3-540-87700-4_4

关键词:

摘要: The term `multiobjectivization' refers to the casting of a single-objec-tive optimization problem as multiobjective one, transformation that can be achieved by addition supplementary objectives or decomposition original objective function. In this paper, we analyze how multiobjectivization decompositionchanges fitness landscape given and affects search. We find has only one possible effect: introduce plateaus incomparable solutions. Consequently, hillclimbers using no archive `see' smaller (or at most equal) number local optima on transformed compared problem. When archived are considered effect may partly reversed. Running time analyses conducted four example functions demonstrate (positive negative) influence both itself, use vs. non-use an archive, have performance simple hillclimbers. each case exponential/polynomial divide is revealed.

参考文章(15)
Joshua Knowles, Local-Search and Hybrid Evolutionary Algorithms for Pareto Optimization [Thesis].University of Reading, UK;2002.. ,(2002)
Stephanie Forrest, Melanie Mitchell, Relative Building-Block Fitness and the Building-Block Hypothesis foundations of genetic algorithms. ,vol. 2, pp. 109- 126 ,(1993) , 10.1016/B978-0-08-094832-4.50013-1
Pietro S. Oliveto, Carsten Witt, Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation parallel problem solving from nature. pp. 82- 91 ,(2008) , 10.1007/978-3-540-87700-4_9
Joshua D. Knowles, Richard A. Watson, David W. Corne, Reducing Local Optima in Single-Objective Problems by Multi-objectivization international conference on evolutionary multi criterion optimization. pp. 269- 283 ,(2001) , 10.1007/3-540-44719-9_19
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler, Do additional objectives make a problem harder genetic and evolutionary computation conference. pp. 765- 772 ,(2007) , 10.1145/1276958.1277114
Thomas Hanne, On the convergence of multiobjective evolutionary algorithms European Journal of Operational Research. ,vol. 117, pp. 553- 564 ,(1999) , 10.1016/S0377-2217(98)00262-8
Jens Scharnow, Karsten Tinnefeld, Ingo Wegener, The analysis of evolutionary algorithms on sorting and shortest paths problems Journal of Mathematical Modelling and Algorithms. ,vol. 3, pp. 349- 366 ,(2004) , 10.1007/S10852-005-2584-0
Joshua D. Knowles, David W. Corne, Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy Evolutionary Computation. ,vol. 8, pp. 149- 172 ,(2000) , 10.1162/106365600568167
Torben Hagerup, Christine Rüb, A guided tour of Chernoff bounds Information Processing Letters. ,vol. 33, pp. 305- 308 ,(1990) , 10.1016/0020-0190(90)90214-I
Josselin Garnier, Leila Kallel, Marc Schoenauer, Rigorous hitting times for binary mutations Evolutionary Computation. ,vol. 7, pp. 173- 203 ,(1999) , 10.1162/EVCO.1999.7.2.173