{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T04:43:14Z","timestamp":1776228194135,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002724","name":"Open Access Program from the American University of Sharjah","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002724","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3583106","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T18:24:23Z","timestamp":1750875863000},"page":"110605-110622","source":"Crossref","is-referenced-by-count":1,"title":["Heuristic Algorithms for the Heterogeneous Vehicle Routing Problem With Time Windows, Customers Priority, Pickup and Delivery"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3016-7122","authenticated-orcid":false,"given":"Moayad","family":"Tanash","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering, The Hashemite University, Zarqa, Jordan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4747-9579","authenticated-orcid":false,"given":"Rami","family":"As'Ad","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, American University of Sharjah, Sharjah, United Arab Emirates"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-020-00600-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-021-09574-x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-019-00534-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14257\/ijt.2014.2.1.06"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104987"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1504\/IJLSM.2022.120982"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.03.015"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2012.06.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICT-DM.2017.8275694"},{"issue":"4","key":"ref13","first-page":"348","article-title":"On vehicle routing problems (VRP) with a focus on multiple priorities","volume":"9","author":"Adebayo","year":"2019","journal-title":"Amer. J. Comput. Math."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3311\/PPtr.10701"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph17144963"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59747-4_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2021.100039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03625-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07921-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3560896"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.49.2.24613"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-75572-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/su151512004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2016.06.025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/su9020288"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.03.047"},{"issue":"3","key":"ref27","first-page":"237","article-title":"Evolutionary approach for energy minimizing vehicle routing problem with time windows and customers\u2019 priority","volume":"6","author":"Ghannadpour","year":"2019","journal-title":"Int. J. Transp. Eng."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/0734242X18807001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103745"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3058242"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3390\/math10020191"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejdp.2021.100011"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/agriculture13030681"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106242"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56183-2_15"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.01.021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.08.018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.044"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.04.002"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.03.009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.4995\/ijpme.2017.5960"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1108\/IMDS-02-2019-0102"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.30657\/pea.2020.26.31"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/1071\/1\/012025"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110203"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106467"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.3390\/sym16040505"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.738-739.361"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3390\/su12155966"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107412"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06712-2"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104522"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2018.08.010"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_10"},{"issue":"11","key":"ref56","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Brimberg","year":"1997","journal-title":"Comput. Operations Res."},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2023.10.045"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11050436.pdf?arnumber=11050436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:14:45Z","timestamp":1751519685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11050436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3583106","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}