{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T22:45:45Z","timestamp":1745621145498,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:00:00Z","timestamp":1719446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:00:00Z","timestamp":1719446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper addresses the problem of generating an evenly distributed set of Pareto solutions. It appears in real-life applications related to multi-objective optimization when it is important to represent the entire Pareto front with a minimal cost. There exist only a few algorithms which are able to tackle this problem in a general formulation. The Directed Search Domain (DSD) algorithm has proved to be efficient and quite universal. It has successfully been applied to different challengeable test cases. In this paper for the first time the DSD approach is systematically extended and applied to problems with higher dimensions. The modified algorithm does not have any formal limitation on the number of objective functions that is important for practical applications. The efficacy of the algorithm is demonstrated on a number of test cases.<\/jats:p>","DOI":"10.1007\/s10479-024-06117-y","type":"journal-article","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T15:05:47Z","timestamp":1719500747000},"page":"1125-1160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extension of the Directed Search Domain algorithm for multi-objective optimization to higher dimensions"],"prefix":"10.1007","volume":"340","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5193-2375","authenticated-orcid":false,"given":"Boxi","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6906-6695","authenticated-orcid":false,"given":"Sergey","family":"Utyuzhnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,27]]},"reference":[{"issue":"2","key":"6117_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0377-2217(02)00068-1","volume":"140","author":"N Adler","year":"2002","unstructured":"Adler, N., Friedman, L., & Sinuany-Stern, Z. (2002). Review of ranking methods in the data envelopment analysis context. European Journal of Operational Research, 140(2), 249\u2013265.","journal-title":"European Journal of Operational Research"},{"key":"6117_CR2","first-page":"1","volume-title":"2012 IEEE Congress on Evolutionary Computation","author":"O Chikumbo","year":"2012","unstructured":"Chikumbo, O., Goodman, E., & Deb, K. (2012). Approximating a multi-dimensional Pareto front for a land use management problem: A modified MOEA with an epigenetic silencing metaphor. 2012 IEEE Congress on Evolutionary Computation (pp. 1\u20139). IEEE: Brisbane."},{"issue":"3","key":"6117_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., & Dennis, J. E. (1998). Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization, 8(3), 631\u2013657.","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"6117_CR4","first-page":"560","volume":"4","author":"K Deb","year":"2013","unstructured":"Deb, K., & Jain, H. (2013). An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 4(4), 560\u2013601.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"6117_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb, K., Mohan, M., & Mishra, S. (2005). Evaluating the $$\\varepsilon $$-domination based multiobjective evolutionary algorithm for a quick computation of Pareto-optimal solutions. Evolutionary Computation, 13(4), 501\u2013525.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"6117_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6117_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary multiobjective optimization. Advanced information and knowledge processing","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005). Scalable test problems for evolutionary multiobjective optimization. In A. Abraham, L. Jain, & R. Goldberg (Eds.), Evolutionary multiobjective optimization. Advanced information and knowledge processing (pp. 105\u2013145). Springer."},{"issue":"5","key":"6117_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1080\/0305215X.2010.497185","volume":"43","author":"T Erfani","year":"2011","unstructured":"Erfani, T., & Utyuzhnikov, S. V. (2011). Directed search domain: A method for even generation of the Pareto frontier in multiobjective optimization. Engineering Optimization, 43(5), 467\u2013484.","journal-title":"Engineering Optimization"},{"issue":"6","key":"6117_CR9","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s00158-013-0946-1","volume":"48","author":"T Erfani","year":"2013","unstructured":"Erfani, T., Utyuzhnikov, S. V., & Kolo, B. (2013). A modified directed search domain algorithm for multiobjective engineering and design optimization. Structural and Multidisciplinary Optimization, 48(6), 1129\u20131141.","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"6117_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-31880-4_2","volume-title":"Evolutionary multi-criterion optimization","author":"PJ Fleming","year":"2005","unstructured":"Fleming, P. J., Purshouse, R. C., & Lygoe, R. J. (2005). Many-objective optimization: An engineering design perspective. In C. A. C. Coello, A. H. Aguirre, & E. Zitzler (Eds.), Evolutionary multi-criterion optimization (Vol. 42, pp. 14\u201332). Springer."},{"issue":"17","key":"6117_CR11","first-page":"1","volume":"28","author":"A Gaspar-Cunha","year":"2023","unstructured":"Gaspar-Cunha, A., Costa, P., Monaco, F., & Delbem, A. (2023). Many-Objectives Optimization: A machine learning approach for reducing the number of objectives. Mathematical and Computational Applications, 28(17), 1\u201319.","journal-title":"Mathematical and Computational Applications"},{"key":"6117_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ins.2014.08.071","volume":"293","author":"I Giagkiozis","year":"2015","unstructured":"Giagkiozis, I., & Fleming, P. J. (2015). Methods for multi-objective optimization: An analysis. Information Sciences, 293, 338\u2013350.","journal-title":"Information Sciences"},{"key":"6117_CR13","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub, G. H., & Van Loan, C. F. (2013). Matrix computations. JHU Press."},{"issue":"2","key":"6117_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00075","volume":"21","author":"D Hadka","year":"2013","unstructured":"Hadka, D., & Reed, P. (2013). Borg: An auto-adaptive many-objective evolutionary computing framework. Evolutionary Computation, 21(2), 231\u2013259.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"6117_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TEVC.2013.2258025","volume":"18","author":"Z He","year":"2013","unstructured":"He, Z., Yen, G. G., & Zhang, J. (2013). Fuzzy-based Pareto optimality for many-objective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 18(2), 269\u2013285.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6117_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-37140-0_25","volume-title":"International conference on evolutionary multi-criterion optimization","author":"H Jain","year":"2013","unstructured":"Jain, H., & Deb, K. (2013). An improved adaptive approach for elitist nondominated sorting genetic algorithm for many-objective optimization. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca, S. Greco, & J. Shaw (Eds.), International conference on evolutionary multi-criterion optimization (pp. 307\u2013321). Springer."},{"issue":"3","key":"6117_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler, R. T., & Arora, J. S. (2004). Survey of multi-objective optimization methods for engineering. Structural and Multidisciplinary Optimization, 26(3), 369\u2013395.","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"6117_CR18","doi-asserted-by":"crossref","unstructured":"Messac, A. & Mattson, C. (2002). Generating Well-distributed sets of pareto points for engineering design using physical programming. In Optimization engineering.","DOI":"10.1080\/03052150211746"},{"issue":"1","key":"6117_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2514\/3.13035","volume":"34","author":"A Messac","year":"1996","unstructured":"Messac, A. (1996). Physical programming-effective optimization for computational design. AIAA Journal, 34(1), 149\u2013158.","journal-title":"AIAA Journal"},{"issue":"2","key":"6117_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s00158-002-0276-1","volume":"25","author":"A Messac","year":"2003","unstructured":"Messac, A., Ismail-Yahaya, A., & Mattson, C. A. (2003). The normalized normal constraint method for generating the Pareto frontier. Structural and Multidisciplinary Optimization, 25(2), 86\u201398.","journal-title":"Structural and Multidisciplinary Optimization"},{"issue":"10","key":"6117_CR21","doi-asserted-by":"publisher","first-page":"2101","DOI":"10.2514\/1.8977","volume":"42","author":"A Messac","year":"2004","unstructured":"Messac, A., & Mattson, C. A. (2004). Normal constraint method with guarantee of even representation of complete Pareto Frontier. AIAA Journal, 42(10), 2101\u20132111.","journal-title":"AIAA Journal"},{"key":"6117_CR22","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K. (1999). Nonlinear multiobjective optimization. Springer."},{"key":"6117_CR23","unstructured":"NSGA-III Python code (n.d.). https:\/\/pymoo.org\/algorithms\/moo\/nsga3.html"},{"key":"6117_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00158-007-0104-8","volume":"34","author":"S Rangavajhala","year":"2007","unstructured":"Rangavajhala, S., Mullur, A., & Messac, A. (2007). The challenge of equality constraints in robust design optimization: Examination and new approach. Structural and Multidisciplinary Optimization, 34, 381\u2013401.","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"6117_CR25","unstructured":"R-NSGA-III Python code (n.d.). https:\/\/pymoo.org\/algorithms\/moo\/rnsga3.html"},{"issue":"2","key":"6117_CR26","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.cam.2008.03.011","volume":"223","author":"SV Utyuzhnikov","year":"2009","unstructured":"Utyuzhnikov, S. V., Fantini, P., & Guenov, M. D. (2009). A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization. Journal of Computational and Applied Mathematics, 223(2), 820\u2013841.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"9","key":"6117_CR27","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1080\/03052150802086714","volume":"40","author":"S Utyuzhnikov","year":"2008","unstructured":"Utyuzhnikov, S., Maginot, J., & Guenov, M. (2008). Local Pareto approximation for multi-objective optimization. Journal of Engineering Optimization, 40(9), 821\u2013847.","journal-title":"Journal of Engineering Optimization"},{"key":"6117_CR28","doi-asserted-by":"crossref","unstructured":"Vesikar, Y., Deb, K., & Blank, J. (2018). Reference point based NSGA-III for preferred solutions. In: 2018 IEEE symposium series on computational intelligence (SSCI) (pp. 1587\u20131594). IEEE.","DOI":"10.1109\/SSCI.2018.8628819"},{"key":"6117_CR29","volume-title":"Optimality in parametric systems","author":"TL Vincent","year":"1981","unstructured":"Vincent, T. L., & Grantham, W. J. (1981). Optimality in parametric systems. Wiley."},{"issue":"1","key":"6117_CR30","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0909010","volume":"9","author":"HF Walker","year":"1988","unstructured":"Walker, H. F. (1988). Implementation of the GMRES method using Householder transformations. SIAM Journal on Scientific and Statistical Computing, 9(1), 152\u2013163.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"2","key":"6117_CR31","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00158-017-1774-5","volume":"57","author":"K Wang","year":"2018","unstructured":"Wang, K., & Utyuzhnikov, S. (2018). A modified rotation strategy for directed search domain algorithm in multiobjective engineering optimization. Structural and Multidisciplinary Optimization, 57(2), 877\u2013890.","journal-title":"Structural and Multidisciplinary Optimization"},{"issue":"5","key":"6117_CR32","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TEVC.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang, S., Li, M., Liu, X., & Zheng, J. (2013). A grid-based evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation, 17(5), 721\u2013736.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6117_CR33","unstructured":"Zitzler, E. (2001). SPEA2: Improving the performance of the strength Pareto evolutionary algorithm. In Computer engineering and communication networks lab (TIK)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06117-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06117-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06117-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T15:42:14Z","timestamp":1724946134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06117-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,27]]},"references-count":33,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6117"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06117-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,6,27]]},"assertion":[{"value":"5 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}