Computer Science – Data Structures and Algorithms
Scientific paper
2011-11-07
Computer Science
Data Structures and Algorithms
Scientific paper
We present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, this line of research has gained a lot of attention in the last decade. We consider problems in which d linear and one arbitrary objective function are to be optimized over a subset S of {0,1}^n of feasible solutions. We improve the previously best known bound for the smoothed number of Pareto-optimal solutions to O(n^{2d} phi^d), where phi denotes the perturbation parameter. Additionally, we show that for any constant c the c-th moment of the smoothed number of Pareto-optimal solutions is bounded by O((n^{2d} phi^d)^c). This improves the previously best known bounds significantly. Furthermore, we address the criticism that the perturbations in smoothed analysis destroy the zero-structure of problems by showing that the smoothed number of Pareto-optimal solutions remains polynomially bounded even for zero-preserving perturbations. This broadens the class of problems captured by smoothed analysis and it has consequences for non-linear objective functions. One corollary of our result is that the smoothed number of Pareto-optimal solutions is polynomially bounded for polynomial objective functions.
Brunsch Tobias
Röglin Heiko
No associations
LandOfFree
Improved Smoothed Analysis of Multiobjective Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved Smoothed Analysis of Multiobjective Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Smoothed Analysis of Multiobjective Optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-690452