{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:43:58Z","timestamp":1749620638071,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology (MOST), Taiwan","doi-asserted-by":"publisher","award":["NSC 108-2410-H-992-042"],"award-info":[{"award-number":["NSC 108-2410-H-992-042"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Kaohsiung University of Science and Technology","award":["110G02"],"award-info":[{"award-number":["110G02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3072831","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T21:05:35Z","timestamp":1618261535000},"page":"57743-57756","source":"Crossref","is-referenced-by-count":5,"title":["A Hybrid Approach Combining Improved Shuffled Frog-Leaping Algorithm With Dynamic Programming for Disassembly Process Planning"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8874-0836","authenticated-orcid":false,"given":"Hsien-Pin","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2374-3830","authenticated-orcid":false,"given":"Chia-Nan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Adaptation in Natural and Artificial Systems","year":"1975","author":"holland","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2916925"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2016.2602263"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2017.8393359"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-020-2680-9"},{"key":"ref35","first-page":"34","article-title":"A comparison between memetic algorithm and genetic algorithm for the cryptanalysis of simplified data encryption standard algorithm","volume":"1","author":"garg","year":"2009","journal-title":"Int J Netw Security Appl"},{"article-title":"On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms","year":"1989","author":"moscato","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(98)00051-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00321-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(99)00019-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.12.029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2005.853508"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2004.833331"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2531659"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2011.11.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/949527"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2019.07.015"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2858827"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2017.2750696"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISEE.2002.1003277"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1115\/1.4026463"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2018.03.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.495089"},{"key":"ref8","first-page":"54","article-title":"Disassembly AND\/OR graph model for ‘disassembly for recycling","author":"gao","year":"2003","journal-title":"Proc IEEE Int Symp Electron Environ"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/07408170500436740"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/0020754031000120078"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0007-8506(07)62152-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4324\/9781315113067"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.36959\/673\/364"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9098-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2015.1016391"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0217984918401127"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.02.010"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09400830.pdf?arnumber=9400830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T11:08:17Z","timestamp":1643195297000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9400830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3072831","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}