{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:56:09Z","timestamp":1726761369587},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/tii.2019.2904631","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T22:46:36Z","timestamp":1552430796000},"page":"3743-3753","source":"Crossref","is-referenced-by-count":34,"title":["TeMA: A Tensorial Memetic Algorithm for Many-Objective Parallel Disassembly Sequence Planning in Product Refurbishment"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1078-5599","authenticated-orcid":false,"given":"Francesco","family":"Pistolesi","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5086-4734","authenticated-orcid":false,"given":"Beatrice","family":"Lazzerini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557665"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2262178"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15871-1_10"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2832181"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2731981"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2690802"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.06.025"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-003-0368-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.01.055"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0057-5"},{"key":"ref16","first-page":"105","author":"bechikh","year":"2017","journal-title":"Many-Objective Optimization Using Evolutionary Algorithms A Survey"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2832181"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2665349"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2731598"},{"key":"ref4","author":"mcgovern","year":"2011","journal-title":"The Disassembly Line Balancing and Modeling"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2839645"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.07.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0289-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006556606079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-0037-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2778223"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2012.11.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jenvman.2017.06.065"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2478486"},{"key":"ref1","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2016.2646843"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2132725"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2788019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.850260"},{"key":"ref23","article-title":"On evolution, search, optimization, gas and martial arts: Toward memetic algorithms","author":"moscato","year":"1989"},{"key":"ref26","article-title":"A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows","author":"wang","year":"0","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2416127"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/8736410\/08665927.pdf?arnumber=8665927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:06Z","timestamp":1657746486000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8665927\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tii.2019.2904631","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}