A comparative study of different algorithms and scalarization techniques for constructing the Pareto front of multiobjective optimization problems

References

• Eichfelder G. Adaptive scalarization methods in multiobjective optimization. Berlin: Springer; 2008.
   Google Scholar
• Shao L, Ehrgott M. Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math Methods Oper Res. 2008;68(2):257–276. doi: 10.1007/s00186-008-0220-2
   Web of Science ®Google Scholar
• Akbari F, Ghaznavi M, Khorram E. A revised Pascoletti–Serafini scalarization method from multiobjective optimization problems. J Optim Theory Appl. 2018;178(2):560–590. doi: 10.1007/s10957-018-1289-2
   Web of Science ®Google Scholar
• Burachik RS, Kaya CY, Rizvi MM. Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems. Engng Optim. 2021. doi:10.1080/0305215X.2021.1939695 .
   Web of Science ®Google Scholar
• Ehrgott M. Multicriteria optimization. Berlin: Springer; 2005.
   Google Scholar
• Ehrgott M, Ruzika S. Improved ε-constraint method for multiobjective programming. J Optim Theory Appl. 2008;138(3):375–396. doi: 10.1007/s10957-008-9394-2
   Web of Science ®Google Scholar
• Ghaznavi M, Akbari F, Khorram E. Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization. Optim Meth Softw. 2021;36(2–3):627–652. doi: 10.1080/10556788.2019.1571589
   Web of Science ®Google Scholar
• Salemi H, Yaghoobi MA. Improving the min–max method for multiobjective programming. Oper Res Lett. 2020;48(4):480–486. doi: 10.1016/j.orl.2020.05.013
   Web of Science ®Google Scholar
• Santis MD, Eichfelder G. A decision space algorithm for multiobjective convex quadratic integer optimization. Comput Oper Res. 2021;134 (5):105396. doi: 10.1016/j.cor.2021.105396.
   Google Scholar
• Shavazipour B, Kwakkel JH, Miettinen K. Multi-scenario multi-objective robust optimization under deep uncertainty: a posteriori approach. Environ Model Softw. 2021;144:105134. doi: 10.1016/j.envsoft.2021.105134
   Web of Science ®Google Scholar
• Xia Y, Yang X, Zhao K. A combined scalarization method for multi-objective optimization problems. J Indus Manage Optim. 2021;17(5):2669–2683. doi: 10.3934/jimo.2020088
   Google Scholar
• Cohon J. Multi-objective programming and planning. Mineola: Dover Publications; 2004.
   Google Scholar
• Das I, Dennis JE. Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim. 1998;8(3):631–657. doi: 10.1137/S1052623496307510
   Web of Science ®Google Scholar
• Messac A, Ismail-Yahaya A, Mattson C. The normalized normal constraint method for generating the frontier. Struct Multi Optim. 2003;25(2):86–98. doi: 10.1007/s00158-002-0276-1
   Web of Science ®Google Scholar
• Mueller-Gritschneder D, Graeb H, Schlichtmann U. A successive approach to compute the bounded Pareto front of practical multiobjective optimization problems. SIAM J Optim. 2009;20(2):915–934. doi: 10.1137/080729013
   Web of Science ®Google Scholar
• Burachik RS, Kaya CY, Rizvi MM. A new scalarization technique to approximate pareto fronts of problems with disconnected feasible sets. J Optim Theory Appl. 2014;162(2):428–446. doi: 10.1007/s10957-013-0346-0
   Web of Science ®Google Scholar
• Rizvi MM. New optimality conditions for non-linear multiobjective optimization problems and new scalarization techniques for constructing pathological Pareto fronts [PhD thesis]. University of South Australia, Adelaide, Australia; 2013.
   Google Scholar
• Ghaznavi M, Azizi Z. An algorithm for approximating nondominated points of convex multiobjective optimization problems. Bull Iran Math Soc. 2017;43(5):1399–1415.
   Web of Science ®Google Scholar
• Eichfelder G. An adaptive scalarization method in multiobjective optimization. SIAM J Optim. 2009;19(4):1694–1718. doi: 10.1137/060672029
   Web of Science ®Google Scholar
• Khorram E, Khaledian K, Khaledyan M. A numerical method for constructing the Pareto front of multiobjective optimization problems. J Comput Appl Math. 2014;261:158–171. doi: 10.1016/j.cam.2013.11.007
   Web of Science ®Google Scholar
• Khaledian K, Soleimani-damaneh M. A new approach to approximate the bounded Pareto front. Math Meth Oper Res. 2015;82(2):211–228. doi: 10.1007/s00186-015-0510-4
   Web of Science ®Google Scholar
• Dolatnezhadsomarin A, Khorram E. Two efficient algorithms for constructing almost even approximations of the Pareto front in multiobjective optimization problems. Eng Optim. 2019;51(4):567–589. doi: 10.1080/0305215X.2018.1479405
   Web of Science ®Google Scholar
• Ghane-kanafi A, Khorram E. A new scalarization method for finding the efficient frontier in non-convex multiobjective problems. Appl Math Model. 2015;39(23–24):7483–7498. doi:10.1016/j.apm.2015.03.022
   Web of Science ®Google Scholar
• Ghaznavi-ghosoni BA, Khorram E, Soleimani-damaneh M. Scalarization for characterization of approximate strong / weak / proper efficiency in multiobjective optimization. Optimization. 2013;62(6):703–720. doi: 10.1080/02331934.2012.668190
   Web of Science ®Google Scholar
• Rastegar N, Khorram E. A combined scalarizing method for multiobjective programming problems. Eur J Oper Res. 2014;236(1):229–237. doi: 10.1016/j.ejor.2013.11.020
   Web of Science ®Google Scholar
• Pascoletti A, Serafini P. Scalarizing vector optimization problems. J Optim Theory Appl. 1984;42(4):499–524. doi: 10.1007/BF00934564
   Web of Science ®Google Scholar
• Tang L, Yang X. A modified direction approach for proper efficiency of multiobjective optimization. Optim Methods Softw. 2021;36(2–3):653–668.
   Web of Science ®Google Scholar
• Pirouz B, Khorram E. A computational approach based on the epsilon-Constraint method in multi- objective optimization problems. Adv Appl Stat. 2016;9(6):453–483.
   Google Scholar
• Meng H, Zhang X, Liu S. New quality measures for multiobjective programming. Lect Notes Comput Sci. 2005;3611:1044–1048. doi: 10.1007/11539117
   Google Scholar
• Messac A, Mattson CA. Normal constraint method with guarantee of even representation of complete Pareto frontier. AIAA J. 2004;42(10):2101–2111. doi: 10.2514/1.8977
   Google Scholar
• Zitzler E, Deb K, Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput J. 2000;8(2):173–195. doi: 10.1162/106365600568202
   PubMed Web of Science ®Google Scholar
• Huband S, Hingston P, Barone L, et al. A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput. 2006;10(5):477–506. doi: 10.1109/TEVC.2005.861417
   Web of Science ®Google Scholar
• Leitmann G, Marzollo A. Multicriteria decision making. Wien- New York: Springer-Verlag; 1975. (CISM. International center for mechanical sciences. Courses and lectures; 211).
   Google Scholar