{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T11:42:35Z","timestamp":1769946155186,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union\u2019s Horizon 2020 Research and Innovation Program through AEOLIX\u2014Architecture for EurOpean Logistics Information Exchange Project","award":["690797"],"award-info":[{"award-number":["690797"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/tase.2018.2879875","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T20:42:16Z","timestamp":1544647336000},"page":"960-971","source":"Crossref","is-referenced-by-count":13,"title":["A Distributed Cluster-Based Approach for Pick-Up Services"],"prefix":"10.1109","volume":"16","author":[{"given":"Lorenzo","family":"Abbatecola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8612-1852","authenticated-orcid":false,"given":"Maria Pia","family":"Fanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pedroncelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Ukovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.11.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-3658-2_57"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2570121"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.07.077"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7525308"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760177"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798278"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510598"},{"key":"ref19","first-page":"143","article-title":"Multilevel heuristic algorithm for graph partitioning","author":"ba\u00f1os","year":"2003","journal-title":"Applications of Evolutionary Computing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/ChiCC.2017.8027819"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-010-0144-6"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-319-60042-0_7","article-title":"M-NSGA-II: A memetic algorithm for vehicle routing problem with route balancing","author":"sun","year":"2017","journal-title":"Advances in Artificial Intelligence From Theory to Practice"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098286"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2649103"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.07.048"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_3"},{"key":"ref22","author":"solomon","year":"2017","journal-title":"VRPTW Benchmark Problems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515.ch5"},{"key":"ref24","author":"graham","year":"2008","journal-title":"A Dictionary of Statistics"},{"key":"ref23","article-title":"Parallelization of the vehicle routing problem with time windows","author":"larsen","year":"2001"},{"key":"ref26","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"lov\u00e1sz","year":"1993","journal-title":"Combinatorics Paul Erdos Is Eighty"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2015.155"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/8681660\/08573798.pdf?arnumber=8573798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:12:47Z","timestamp":1657746767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8573798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":26,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tase.2018.2879875","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}