{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:44:42Z","timestamp":1775648682663,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Polish National Science Center","award":["UMO-2013\/11\/B\/ST6\/01075"],"award-info":[{"award-number":["UMO-2013\/11\/B\/ST6\/01075"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tevc.2018.2799684","type":"journal-article","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T19:20:05Z","timestamp":1517340005000},"page":"778-791","source":"Crossref","is-referenced-by-count":42,"title":["ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8433-518X","authenticated-orcid":false,"given":"Thibaut","family":"Lust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2567648"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-137-7_5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810733"},{"key":"ref12","first-page":"101","article-title":"Theoretical aspects of evolutionary multiobjective optimization","author":"brockhoff","year":"2010","journal-title":"Theory of Randomized Search Heuristics Foundations and Recent Developments"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"ref14","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"gabow","year":"1984","journal-title":"Proc Ann ACM Symp Theory of Computing (STOC)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000260"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666895"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-17144-4_7","article-title":"Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study","volume":"535","author":"paquete","year":"2004","journal-title":"Metaheuristics for multiobjective optimisation"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2366498"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826067"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.4.367"},{"key":"ref3","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm","author":"zitzler","year":"2001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2549267"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308305"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.913121"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227145"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/TEVC.2014.2350995","article-title":"An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization","volume":"19","author":"cai","year":"2015","journal-title":"IEEE Trans Evol Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2185702"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36970-8_36"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463454"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.817234"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1296-y"},{"key":"ref23","first-page":"118","article-title":"Covering Pareto sets by multilevel evolutionary subdivision techniques","author":"sch\u00fctze","year":"0","journal-title":"Proc Int Conf Evol Multi-Criterion Optim"},{"key":"ref26","first-page":"136","article-title":"Quad trees, a datastructure for discrete vector optimization problems","author":"habenicht","year":"1982","journal-title":"Proc 5th Int Conf Multiple Criteria Decis Making"},{"key":"ref25","first-page":"843","article-title":"Comparison of data structures for storing Pareto-sets in MOEAs","volume":"1","author":"mostaghim","year":"2002","journal-title":"Proc Congr Evol Comput (CEC)"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8478014\/08274915.pdf?arnumber=8274915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T10:38:23Z","timestamp":1643193503000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8274915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2018.2799684","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}