Abstract
In 2013 Gaspar-Cunha et al. proposed a set of novel robust multi-objective benchmark functions to increase the difficulty of the current test problems and effectively mimic the characteristics of real search spaces. Despite the merits of the proposed benchmark problems, it is observed that the robust Pareto optimal fronts are located on the boundaries of the search space, which may result in the infeasibility of solutions obtained in case of perturbations along the negative side of the second parameter. This paper modifies the proposed test functions by Gaspar-Cunha et al. to mimic real problems better and allow the parameters to be fluctuated by any degree of perturbations. In fact, the robust fronts are shifted to the centre of the search space, so that any degree of uncertainties can be considered. The paper considers theoretical and experimental analysis of both set of test functions as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barrico C, Antunes CH (1892) Robustness analysis in multi-objective optimization using a degree of robustness concept, pp. 1887–1892
Barrico C, Antunes CH (2006) A New Approach to robustness analysis in multi-objective optimization, in 7th International Conference on Multi-Objective Programming and Goal Programming, Tours, France
Beyer H-G, Sendhoff B (2007) Robust optimization–a comprehensive survey. Comput Methods Appl Mech Eng 196:3190–3218
Branke J (2000) Efficient evolutionary algorithms for searching robust solutions, in Evolutionary Design and Manufacture, ed: Springer, pp. 275–285
Coello Coello CA, Lechuga MS (2002) MOPSO: A proposal for multiple objective particle swarm optimization, in Evolutionary Computation, 2002. CEC'02. Proceedings of the 2002 Congress on, pp. 1051–1056
Coello CAC, Pulido GT, Lechuga MS (2004) “Handling multiple objectives with particle swarm optimization,”. IEEE Trans Evol Comput 8:256–279
Deb K (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7:205–230
Deb K, Gupta H (2005) Searching for robust Pareto-optimal solutions in multi-objective optimization. Lect Notes Comput Sci 3410:150–164
Deb K, Gupta H (2006) Introducing robustness in multi-objective optimization. Evol Comput 14:463–494
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) “A fast and elitist multiobjective genetic algorithm: NSGA-II,”. IEEE Trans Evol Comput 6:182–197
Erfani T, Utyuzhnikov S (2012) Control of robust design in multiobjective optimization under uncertainties. Struct Multidiscip Optim 45:247–256
Gaspar-Cunha A, Covas J (2006) Robustness using Multi-Objective Evolutionary Algorithms, in Applications of Soft Computing, ed: Springer, pp. 353–362
Gaspar-Cunha A, Ferreira J, Recio G(2013) Evolutionary robustness analysis for multi-objective optimization: benchmark problems, Struct Multidiscip Optim pp. 1–23
Jin Y, Branke J (2005) “Evolutionary optimization in uncertain environments-a survey,”. IEEE Trans Evol Comput 9:303–317
Montgomery DC (2008) Design and analysis of experiments: John Wiley & Sons
Saha A, Ray T, Smith W (2011) Towards practical evolutionary robust multi-objective optimization, pp. 2123–2130.
Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1:32–49
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mirjalili, S. Shifted robust multi-objective test problems. Struct Multidisc Optim 52, 217–226 (2015). https://doi.org/10.1007/s00158-014-1221-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-014-1221-9