{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:42:52Z","timestamp":1768524172689,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873109"],"award-info":[{"award-number":["61873109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program of Humanities and Social Sciences, Ministry of Education","award":["18YJA630157"],"award-info":[{"award-number":["18YJA630157"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3010376","type":"journal-article","created":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T21:22:31Z","timestamp":1595280151000},"page":"132642-132654","source":"Crossref","is-referenced-by-count":27,"title":["Modeling and Planning Multimodal Transport Paths for Risk and Energy Efficiency Using AND\/OR Graphs and Discrete Ant Colony Optimization"],"prefix":"10.1109","volume":"8","author":[{"given":"Zhanzhong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Minghang","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4514-1531","authenticated-orcid":false,"given":"Ruijuan","family":"Chu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3954-9258","authenticated-orcid":false,"given":"Liying","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.resourpol.2020.101604"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2997812"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.118714"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2017.07.028"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2884845"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106292"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.051"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.045"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogsys.2020.03.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2906635"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2871946"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2690802"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1139\/cjce-2018-0505"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/1687814017753801"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11431-018-9278-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/15568318.2018.1540734"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"134","DOI":"10.4018\/IJAMC.2020040107","article-title":"Multi-layer distributed constraint satisfaction for multi-criteria optimization problem: Multimodal transportation network planning problem","volume":"11","author":"mouna","year":"2020","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/7570686"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-03103-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3390\/su11195320"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/su12041487"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2773475"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/technologies6030071"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/e20060446"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi7060203"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3264560.3264564"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICSSSM.2018.8465075"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.120926"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2020.114798"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2019.109335"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0361198118798244"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2018.08.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01178"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/e21080776"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/1755-1315\/252\/5\/052073"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/21642583.2019.1681032"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-018-4586-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0535-z"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107183"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2018.10.025"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2018.09.295"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104930"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.106578"},{"key":"ref47","first-page":"211","article-title":"Left-right crowding distance (LRCD) calculation method in NSGA2 to preserve diversity distribution","author":"jiasen","year":"2010","journal-title":"Proc 3rd Int Conf Comput Sci Inf Technol"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104889"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.apm.2020.05.006","article-title":"Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach","volume":"86","author":"\u00e7il","year":"2020","journal-title":"Appl Math Model"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04533-y"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04533-y"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09144188.pdf?arnumber=9144188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:33Z","timestamp":1642003053000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9144188\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3010376","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}