{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T21:48:05Z","timestamp":1726177685167},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031194924"},{"type":"electronic","value":"9783031194931"}],"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"},{"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-19493-1_32","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T02:03:14Z","timestamp":1666404194000},"page":"410-422","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Considerations in\u00a0the\u00a0Incremental Hypervolume Algorithm of\u00a0the\u00a0WFG"],"prefix":"10.1007","author":[{"given":"Raquel","family":"Hern\u00e1ndez G\u00f3mez","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5991-6927","authenticated-orcid":false,"given":"Jes\u00fas Guillermo","family":"Falc\u00f3n-Cardona","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8435-680X","authenticated-orcid":false,"given":"Carlos A. Coello","family":"Coello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"32_CR2","unstructured":"Bradstreet, L., While, L., Barone, L.: A new way of calculating exact exclusive hypervolumes. Technical report, UWA-CSSE-09-002, The University of Western Australia, School of Computer Science and Software Engineering (2009)"},{"issue":"6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TEVC.2008.919001","volume":"12","author":"L Bradstreet","year":"2008","unstructured":"Bradstreet, L., While, L., Barone, L.: A fast incremental hypervolume algorithm. IEEE Trans. Evol. Comput. 12(6), 714\u2013723 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-36797-2. ISBN 978-0-387-33254-3","DOI":"10.1007\/978-0-387-36797-2"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Cox, W., While, L.: Improving the IWFG algorithm for calculating incremental hypervolume. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 3969\u20133976, July 2016","DOI":"10.1109\/CEC.2016.7744293"},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"32_CR7","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":"32_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization, pp. 105\u2013145. Advanced Information and Knowledge Processing, Springer (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Falc\u00f3n-Cardona, J.G., Coello, C.A.C.: Indicator-based multi-objective evolutionary algorithms: a comprehensive survey. ACM Comput. Surv. 53(2) (2020). https:\/\/doi.org\/10.1145\/3376916","DOI":"10.1145\/3376916"},{"key":"32_CR10","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":"32_CR11","unstructured":"Hern\u00e1ndez G\u00f3mez, R.: Parallel hyper-heuristics for multi-objective optimization. Ph.D. thesis, CINVESTAV-IPN, Mexico City, Mexico, March 2018"},{"issue":"6","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.cor.2012.01.001","volume":"40","author":"Y Tan","year":"2013","unstructured":"Tan, Y., Jiao, Y., Li, H., Wang, X.: MOEA\/D plus uniform design: a new version of MOEA\/D for optimization problems with many objectives. Comput. Oper. Res. 40(6), 1648\u20131660 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"32_CR13","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)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L.: Applying the WFG algorithm to calculate incremental hypervolumes. In: 2012 IEEE Congress on Evolutionary Computation (CEC 2012), Brisbane, Australia, 10\u201315 June 2012, pp. 489\u2013496. IEEE Press (2012)","DOI":"10.1109\/CEC.2012.6256171"},{"key":"32_CR15","unstructured":"Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19493-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T03:08:00Z","timestamp":1666408080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19493-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031194924","9783031194931"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19493-1_32","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":"23 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Monterrey","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2022\/","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":"137","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":"63","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","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 External reviewers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}
