{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:04:23Z","timestamp":1725905063120},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319633084"},{"type":"electronic","value":"9783319633091"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63309-1_2","type":"book-chapter","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T06:09:09Z","timestamp":1500444549000},"page":"14-25","source":"Crossref","is-referenced-by-count":5,"title":["A Fast Approximate Hypervolume Calculation Method by a Novel Decomposition Strategy"],"prefix":"10.1007","author":[{"given":"Weisen","family":"Tang","sequence":"first","affiliation":[]},{"given":"Hailin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"2_CR1","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms, vol. 2(3), pp. 509. John Wiley & Sons, Inc., New York (2001)"},{"issue":"6","key":"2_CR2","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"2_CR3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu, H., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450\u2013455 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TEVC.2010.2064321","volume":"15","author":"O Schutze","year":"2011","unstructured":"Schutze, O., Lara, A., Coello, C.A.C.: On the influence of the number of objectives on the hardness of a multiobjective optimization problem. IEEE Trans. Evol. Comput. 15(4), 444\u2013455 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30217-9_84"},{"key":"2_CR6","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 \u2014 a 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). doi: 10.1007\/BFb0056872"},{"issue":"2","key":"2_CR7","doi-asserted-by":"crossref","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., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"2_CR8","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B.: SMS\u2013MOA: Multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-92182-0_40","volume-title":"Algorithms and Computation","author":"K Bringmann","year":"2008","unstructured":"Bringmann, K., Friedrich, T.: Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 436\u2013447. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-92182-0_40"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-50127-7_20","volume-title":"AI 2016: Advances in Artificial Intelligence","author":"W Cox","year":"2016","unstructured":"Cox, W., While, L.: Improving and extending the HV4D algorithm for calculating hypervolume exactly. In: Kang, B.H., Bai, Q. (eds.) AI 2016. LNCS, vol. 9992, pp. 243\u2013254. Springer, Cham (2016). doi: 10.1007\/978-3-319-50127-7_20"},{"key":"2_CR11","unstructured":"Guerreiro, A.P., Fonseca, C.M., Emmerich, M.T.: A fast dimension\u2013sweep algorithm for the hypervolume indicator in four dimensions. In: Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 77\u201382 (2012)"},{"issue":"4","key":"2_CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/TEVC.2013.2281525","volume":"18","author":"Russo","year":"2014","unstructured":"Russo, Francisco, A.P.: Quick hypervolume. IEEE Trans. Evol. Comput. 18(4), 481\u2013502 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"2_CR13","doi-asserted-by":"crossref","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":"2_CR14","doi-asserted-by":"crossref","unstructured":"Jaszkiewicz: Improved quick hypervolume algorithm. In: Asilomar Conference on Signals, Systems and Computers (2017)","DOI":"10.1016\/j.cor.2017.09.016"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Russo, L.M.S., Francisco, A.P.: Extending quick hypervolume. J. Heuristics 22(3), 245\u2013271 (2016)","DOI":"10.1007\/s10732-016-9309-6"},{"key":"2_CR16","unstructured":"Lacour, R., Klamroth, K., Fonseca, C.M.: A box decomposition algorithm to compute the hypervolume indicator. Comput. Oper. Res. (2015)"},{"issue":"5","key":"2_CR17","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1109\/TEVC.2009.2015575","volume":"13","author":"N Beume","year":"2009","unstructured":"Beume, N., Carlos, M.F.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13(5), 1075\u20131082 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Bader, J., Deb, K., Zitzler, E.: Faster hypervolume\u2013based search using monte carlo sampling. In: Ehrgott, M., Naujoks, B., Stewart, T., Wallenius, J. (eds.) Conference on Multiple Criteria Decision Making (MCDM 2008). LNEMS, vol. 634, pp. 313\u2013326. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-642-04045-0_27"},{"issue":"1","key":"2_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader, J., Zitzler, E.: HypE: An algorithm for fast hypervolume\u2013based many\u2013objective optimization. Evol. Comput. 19(1), 45\u201376 (2011)","journal-title":"Evol. Comput."},{"issue":"4","key":"2_CR20","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1162\/evco.2009.17.4.17402","volume":"17","author":"B Naujoks","year":"2009","unstructured":"Naujoks, B.: S\u2013metric calculation by considering dominated hypervolume as Klee\u2019s measure problem. Evol. Comput. 17(4), 477\u2013492 (2009)","journal-title":"Evol. Comput."},{"issue":"1","key":"2_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.artint.2012.09.005","volume":"195","author":"K Bringmann","year":"2013","unstructured":"Bringmann, K., Friedrich, T.: Approximation quality of the hypervolume indicator. Artif. Intell. 195(1), 265\u2013290 (2013)","journal-title":"Artif. Intell."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-92182-0_40","volume-title":"Algorithms and Computation","author":"K Bringmann","year":"2008","unstructured":"Bringmann, K., Friedrich, T.: Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 436\u2013447. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-92182-0_40"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Cox, W., While, L.: Improving the IWFG algorithm for calculating incremental hypervolume. In: IEEE Congress on Evolutionary Computation IEEE, pp. 3969\u20133976 (2016)","DOI":"10.1109\/CEC.2016.7744293"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T.: Parameterized average\u2013case complexity of the hypervolume indicator. In: Conference on Genetic and Evolutionary Computation, pp. 575\u2013582 (2013)","DOI":"10.1145\/2463372.2463450"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Nowak, K., Martens, M., Izzo, D.: Empirical performance of the approximation of the least hypervolume contributor. In: International Conference on Parallel Problem Solving From Nature, pp. 662\u2013671 (2014)","DOI":"10.1007\/978-3-319-10762-2_65"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63309-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T18:43:43Z","timestamp":1569869023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63309-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633084","9783319633091"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63309-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}