{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:23:17Z","timestamp":1743110597293,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700842"},{"type":"electronic","value":"9783031700859"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70085-9_2","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"20-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hypervolume Gradient Subspace Approximation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0960-9971","authenticated-orcid":false,"given":"Kenneth","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2157-8077","authenticated-orcid":false,"given":"Angel E.","family":"Rodriguez-Fernandez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2363-9504","authenticated-orcid":false,"given":"Ke","family":"Shang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-6472","authenticated-orcid":false,"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3416-6458","authenticated-orcid":false,"given":"Oliver","family":"Sch\u00fctze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221706005443","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (Cat. No.02TH8600), vol.\u00a01, pp. 825\u2013830 (2002). https:\/\/doi.org\/10.1109\/CEC.2002.1007032","DOI":"10.1109\/CEC.2002.1007032"},{"key":"2_CR3","unstructured":"Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9 (1995). https:\/\/api.semanticscholar.org\/CorpusID:18860538"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Deb, K., Agrawal, S.: A niched-penalty approach for constraint handling in genetic algorithms. In: Artificial Neural Nets and Genetic Algorithms, pp. 235\u2013243. Springer, Vienna (1999). https:\/\/doi.org\/10.1007\/978-3-7091-6384-9_40","DOI":"10.1007\/978-3-7091-6384-9_40"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-36970-8_37","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Fleischer","year":"2003","unstructured":"Fleischer, M.: The measure of pareto optima applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 519\u2013533. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_37"},{"key":"2_CR7","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Co., Reading, Mass (1989)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-031-14721-0_13","volume-title":"Parallel Problem Solving from Nature - PPSN XVII","author":"DMF Ha","year":"2022","unstructured":"Ha, D.M.F., Deist, T.M., Bosman, P.A.N.: Hybridizing hypervolume-based evolutionary algorithms and gradient descent by dynamic resource allocation. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) Parallel Problem Solving from Nature - PPSN XVII, pp. 179\u2013192. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_13"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31880-4_20","volume-title":"Evolutionary Multi-Criterion Optimization","author":"S Huband","year":"2005","unstructured":"Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 280\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_20"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 28(3), 392\u2013403 (1998). https:\/\/doi.org\/10.1109\/5326.704576","DOI":"10.1109\/5326.704576"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204\u2013223 (2003). https:\/\/doi.org\/10.1109\/TEVC.2003.810752","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169\u2013190 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2587749","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR13","unstructured":"Krasnogor, N., Smith, J.: A memetic algorithm with self-adaptive local search: TSP as a case study. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), May 2000"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Merz, P., Freisleben, B.: Genetic local search for the TSP: new results. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 159\u2013164. IEEE, Indianapolis, IN, USA (1997). https:\/\/doi.org\/10.1109\/ICEC.1997.592288. http:\/\/ieeexplore.ieee.org\/document\/592288\/","DOI":"10.1109\/ICEC.1997.592288"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10732-016-9310-0","volume":"22","author":"O Sch\u00fctze","year":"2016","unstructured":"Sch\u00fctze, O., Sosa Hern\u00e1ndez, V.A., Trautmann, H., Rudolph, G.: The hypervolume based directed search method for multi-objective optimization problems. J. Heuristics 22, 273\u2013300 (2016)","journal-title":"J. Heuristics"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Sch\u00fctze, O., Alvarado, S., Segura, C., Landa, R.: Gradient subspace approximation: a direct search method for memetic computing. Soft. Comput. 21(21), 6331\u20136350 (2017). https:\/\/doi.org\/10.1007\/s00500-016-2187-x","DOI":"10.1007\/s00500-016-2187-x"},{"key":"2_CR17","series-title":"Studies in Systems, Decision and Control","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-51264-4_15","volume-title":"Advances in Dynamics, Optimization and Computation","author":"O Sch\u00fctze","year":"2020","unstructured":"Sch\u00fctze, O., Uribe, L., Lara, A.: The gradient subspace approximation and its application to bi-objective optimization problems. In: Junge, O., Sch\u00fctze, O., Froyland, G., Ober-Bl\u00f6baum, S., Padberg-Gehle, K. (eds.) SON 2020. SSDC, vol. 304, pp. 355\u2013390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51264-4_15"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017). https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput. Intell. Mag."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Uribe, L., Lara, A., Deb, K., Sch\u00fctze, O.: A new gradient free local search mechanism for constrained multi-objective optimization problems. Swarm Evol. Comput. 67, 100938 (2021). https:\/\/doi.org\/10.1016\/j.swevo.2021.100938. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210650221000997","DOI":"10.1016\/j.swevo.2021.100938"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-319-54157-0_44","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Wang","year":"2017","unstructured":"Wang, H., Deutz, A., B\u00e4ck, T., Emmerich, M.: Hypervolume indicator gradient ascent multi-objective optimization. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 654\u2013669. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54157-0_44"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TEVC.2010.2077298","volume":"16","author":"L While","year":"2012","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2012). https:\/\/doi.org\/10.1109\/TEVC.2010.2077298","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Zhang, J., Xing, L.: A survey of multiobjective evolutionary algorithms. In: 22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), pp. 93\u2013100. IEEE, Guangzhou, China, July 2017. https:\/\/doi.org\/10.1109\/CSE-EUC.2017.27. http:\/\/ieeexplore.ieee.org\/document\/8005779\/","DOI":"10.1109\/CSE-EUC.2017.27"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759. http:\/\/ieeexplore.ieee.org\/document\/4358754\/","DOI":"10.1109\/TEVC.2007.892759"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000). https:\/\/doi.org\/10.1162\/106365600568202","journal-title":"Evol. Comput."},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. Technical report, [object Object], May 2001. https:\/\/doi.org\/10.3929\/ETHZ-A-004284029. http:\/\/hdl.handle.net\/20.500.11850\/145755. Artwork Size: 21 p. Medium: application\/pdf","DOI":"10.3929\/ETHZ-A-004284029"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70085-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:16Z","timestamp":1725664396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70085-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700842","9783031700859"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70085-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}