{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:25:35Z","timestamp":1743085535199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_13","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"179-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybridizing Hypervolume-Based Evolutionary Algorithms and\u00a0Gradient Descent by\u00a0Dynamic Resource Allocation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2495-9681","authenticated-orcid":false,"given":"Damy M. F.","family":"Ha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0057-1535","authenticated-orcid":false,"given":"Timo M.","family":"Deist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4186-6666","authenticated-orcid":false,"given":"Peter A. N.","family":"Bosman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: optimal $$\\mu $$-distributions and the choice of the reference point. In: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms, pp. 87\u2013102 (2009)","DOI":"10.1145\/1527125.1527138"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.05.036","volume":"456","author":"R Berghammer","year":"2012","unstructured":"Berghammer, R., Friedrich, T., Neumann, F.: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theoret. Comput. Sci. 456, 2\u201317 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TEVC.2010.2051445","volume":"16","author":"PA Bosman","year":"2011","unstructured":"Bosman, P.A.: On gradients and hybrid evolutionary algorithms for real-valued multiobjective optimization. IEEE Trans. Evol. Comput. 16(1), 51\u201369 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bosman, P.A., De Jong, E.D.: Combining gradient techniques for numerical multi-objective evolutionary optimization. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 627\u2013634 (2006)","DOI":"10.1145\/1143997.1144111"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1162\/EVCO_a_00094","volume":"21","author":"PA Bosman","year":"2013","unstructured":"Bosman, P.A., Grahl, J., Thierens, D.: Benchmarking parameter-free amalgam on functions with and without noise. Evol. Comput. 21(3), 445\u2013469 (2013)","journal-title":"Evol. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bouter, A., Alderliesten, T., Witteveen, C., Bosman, P.A.: Exploiting linkage information in real-valued optimization with the real-valued gene-pool optimal mixing evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 705\u2013712 (2017)","DOI":"10.1145\/3071178.3071272"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bouter, A., Luong, N.H., Witteveen, C., Alderliesten, T., Bosman, P.A.: The multi-objective real-valued gene-pool optimal mixing evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 537\u2013544 (2017)","DOI":"10.1145\/3071178.3071274"},{"key":"13_CR8","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K., Kalyanmoy, D.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons Inc., USA (2001)"},{"issue":"2","key":"13_CR9","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.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-58115-2_13","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"TM Deist","year":"2020","unstructured":"Deist, T.M., Maree, S.C., Alderliesten, T., Bosman, P.A.N.: Multi-objective optimization by uncrowded hypervolume gradient ascent. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12270, pp. 186\u2013200. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_13"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Emmerich, M., Deutz, A.: Time complexity and zeros of the hypervolume indicator gradient field. In: EVOLVE-a Bridge Between Probability, Set Oriented Numerics, And Evolutionary Computation III, pp. 169\u2013193. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-01460-9_8","DOI":"10.1007\/978-3-319-01460-9_8"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-75514-2_11","volume-title":"Hybrid Metaheuristics","author":"M Emmerich","year":"2007","unstructured":"Emmerich, M., Deutz, A., Beume, N.: Gradient-based\/evolutionary relay hybrid for computing pareto front approximations maximizing the S-metric. In: Bartz-Beielstein, T., et al. (eds.) HM 2007. LNCS, vol. 4771, pp. 140\u2013156. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75514-2_11"},{"issue":"5","key":"13_CR13","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1109\/TCYB.2018.2885974","volume":"50","author":"VAS Hern\u00e1ndez","year":"2018","unstructured":"Hern\u00e1ndez, V.A.S., Sch\u00fctze, O., Wang, H., Deutz, A., Emmerich, M.: The set-based hypervolume newton method for bi-objective optimization. IEEE Trans. Cybern. 50(5), 2186\u20132196 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0029787","volume-title":"Parallel Problem Solving from Nature","author":"F Hoffmeister","year":"1991","unstructured":"Hoffmeister, F., B\u00e4ck, T.: Genetic algorithms and evolution strategies: similarities and differences. In: Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 455\u2013469. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0029787"},{"key":"13_CR15","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":"13_CR16","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"13_CR17","unstructured":"Maree, S.C., Alderliesten, T., Bosman, P.A.: Uncrowded hypervolume-based multi-objective optimization with gene-pool optimal mixing. Evolutionary Comput. 1\u201324 (2021)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Sharma, S., Blank, J., Deb, K., Panigrahi, B.K.: Ensembled crossover based evolutionary algorithm for single and multi-objective optimization. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1439\u20131446. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504698"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Tour\u00e9, C., Hansen, N., Auger, A., Brockhoff, D.: Uncrowded hypervolume improvement: Como-cma-es and the sofomore framework. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 638\u2013646 (2019)","DOI":"10.1145\/3321707.3321852"},{"key":"13_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":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:48:46Z","timestamp":1710262126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}