Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment
Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving dynamic and stochastic nature of on-demand and conventional logistics services. Further challenges arise with application doctrines shifting toward...
Saved in:
| Published in: | Mathematics (Basel) Vol. 12; no. 1; p. 28 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Basel
MDPI AG
01.01.2024
|
| Subjects: | |
| ISSN: | 2227-7390, 2227-7390 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving dynamic and stochastic nature of on-demand and conventional logistics services. Further challenges arise with application doctrines shifting towards crowd-sourced platforms. As a result, “traditional” deterministic approaches do not adequately fulfil constantly evolving customer expectations. To maintain competitiveness, logistic service providers must adopt proactive and anticipatory systems that dynamically model and evaluate probable (future) events, i.e., stochastic information. These events manifest in problem characteristics such as customer requests, demands, travel times, parking availability, etc. The Stochastic Dynamic Vehicle Routing Problem (SDVRP) addresses the dynamic and stochastic information inherent in urban logistics. This paper aims to analyse the key concepts, challenges, and recent advancements and opportunities in the evolving urban logistics landscape and assess the evolution from classical VRPs, via DVRPs, to state-of-art SDVRPs. Further, coupled with non-reactive techniques, this paper provides an in-depth overview of cutting-edge model-based and model-free reactive solution approaches. Although potent, these approaches become restrictive due to the “curse of dimensionality”. Sacrificing granularity for scalability, researchers have opted for aggregation and decomposition techniques to overcome this problem and recent approaches explore solutions using deep learning. In the scope of this research, we observed that addressing real-world SDVRPs with a comprehensive resolution encounters a set of challenges, emphasising a substantial gap in the research field that warrants further exploration. |
|---|---|
| AbstractList | Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving dynamic and stochastic nature of on-demand and conventional logistics services. Further challenges arise with application doctrines shifting towards crowd-sourced platforms. As a result, “traditional” deterministic approaches do not adequately fulfil constantly evolving customer expectations. To maintain competitiveness, logistic service providers must adopt proactive and anticipatory systems that dynamically model and evaluate probable (future) events, i.e., stochastic information. These events manifest in problem characteristics such as customer requests, demands, travel times, parking availability, etc. The Stochastic Dynamic Vehicle Routing Problem (SDVRP) addresses the dynamic and stochastic information inherent in urban logistics. This paper aims to analyse the key concepts, challenges, and recent advancements and opportunities in the evolving urban logistics landscape and assess the evolution from classical VRPs, via DVRPs, to state-of-art SDVRPs. Further, coupled with non-reactive techniques, this paper provides an in-depth overview of cutting-edge model-based and model-free reactive solution approaches. Although potent, these approaches become restrictive due to the “curse of dimensionality”. Sacrificing granularity for scalability, researchers have opted for aggregation and decomposition techniques to overcome this problem and recent approaches explore solutions using deep learning. In the scope of this research, we observed that addressing real-world SDVRPs with a comprehensive resolution encounters a set of challenges, emphasising a substantial gap in the research field that warrants further exploration. |
| Audience | Academic |
| Author | Erdelić, Tomislav Mardešić, Nikola Carić, Tonči Đurasević, Marko |
| Author_xml | – sequence: 1 givenname: Nikola orcidid: 0009-0006-1669-1813 surname: Mardešić fullname: Mardešić, Nikola – sequence: 2 givenname: Tomislav orcidid: 0000-0002-8012-0090 surname: Erdelić fullname: Erdelić, Tomislav – sequence: 3 givenname: Tonči orcidid: 0000-0001-8564-4304 surname: Carić fullname: Carić, Tonči – sequence: 4 givenname: Marko orcidid: 0000-0001-8732-4769 surname: Đurasević fullname: Đurasević, Marko |
| BookMark | eNptkdtqGzEQhkVxoKmTuz6AoLd1opOl1aVJ3SZgKORE74RWK9kytuRqZZe8fWfjFEyJRjDSaL6fGc0nNEo5eYQ-U3LFuSbXW1tXlBFKCGs-oHPGmJooeBidnD-iy75fE1ia8kboc_Tr3h-i_4NzwA81u5Xta3T420uyW_DPfhXdxuP7vK8xLXFMuK48nh_y5jDcn0prE17kZRywHs_TIZactj7VC3QW7Kb3l29-jJ6-zx9vbieLnz_ubmaLiRNE1ol0nFvBSesFZ5JLFbjuKGu4lLqbBuKl9K3qHGwalBVK82CpDW1oG82l5mN0d9Ttsl2bXYlbW15MttG8BnJZGlvq0IVhWpIpZY4H2Ym26TQLjW60mkrBnaAdaH05au1K_r33fTXrvC8JygeWMkhjYGN0dcxaWhCNKeRarAPrPPwZDCVEiM8UlCokVQPAjoArue-LD8bFamvMCcC4MZSYYYLmdIIAff0P-tfbu-l_AeYSnU8 |
| CitedBy_id | crossref_primary_10_3390_math13142313 crossref_primary_10_3390_systems13020080 crossref_primary_10_3390_math12020332 crossref_primary_10_1007_s13369_025_10345_0 crossref_primary_10_1016_j_eswa_2025_128258 crossref_primary_10_1016_j_ejtl_2025_100159 crossref_primary_10_3390_math13071092 |
| Cites_doi | 10.1007/978-3-642-17390-5_15 10.1016/j.cor.2014.02.010 10.1016/j.trb.2003.09.001 10.1007/s10479-011-0991-3 10.1016/j.ejor.2022.07.015 10.1287/trsc.1050.0114 10.1016/j.cor.2022.106071 10.1287/opre.44.3.469 10.1016/j.trb.2014.02.001 10.1016/j.sbspro.2012.03.105 10.1016/j.cie.2009.05.009 10.1109/TITS.2016.2521779 10.1137/1.9780898718515 10.1126/science.220.4598.671 10.1016/j.dss.2012.06.007 10.1002/net.21855 10.1016/j.ejtl.2023.100105 10.1287/trsc.14.2.130 10.1145/3357384.3357799 10.1145/3478117 10.1057/palgrave.jors.2601352 10.1007/s10696-016-9242-x 10.1016/j.ejor.2018.02.038 10.1007/s10100-018-0588-x 10.1287/trsc.2016.0732 10.1016/j.trc.2006.03.002 10.1109/TAC.2010.2092850 10.7551/mitpress/1290.001.0001 10.1002/net.20182 10.1016/j.cie.2019.03.002 10.1287/trsc.2022.1173 10.1016/j.ejor.2013.02.053 10.1016/j.ejor.2019.04.029 10.1016/S0305-0548(97)00031-2 10.1137/0206041 10.1016/j.cie.2021.107131 10.1016/j.trb.2015.06.008 10.1007/s11036-008-0101-1 10.1287/ijoc.2.1.4 10.1287/mnsc.6.1.80 10.1137/S0363012901385691 10.1007/BF01720070 10.1287/trsc.1050.0135 10.1016/j.ejtl.2020.100008 10.1287/ijoc.1090.0345 10.1016/S0377-2217(02)00915-3 10.1287/trsc.1030.0068 10.1016/j.ijpe.2022.108751 10.1016/S0167-8191(01)00103-X 10.1007/978-1-4419-1665-5 10.1609/icaps.v30i1.6685 10.1287/opre.49.5.796.10608 10.1080/00207543.2015.1043403 10.1287/opre.1040.0124 10.1016/j.cie.2021.107604 10.1016/S0377-2217(98)00260-4 10.1007/s12599-017-0468-2 10.1287/trsc.33.4.381 10.1016/j.swevo.2019.03.008 10.1109/WSC.2018.8632452 10.1016/j.cor.2019.03.008 10.1080/01605682.2018.1434401 10.1016/j.ejor.2011.10.043 10.1016/j.ejor.2007.01.007 10.1016/S0305-0548(99)00146-X 10.1016/j.trb.2015.03.003 10.1016/j.ejor.2020.01.033 10.1016/j.tre.2016.07.009 10.1016/j.tre.2021.102496 10.1016/j.trc.2020.102626 10.1016/j.tra.2013.01.032 10.1016/j.swevo.2018.10.015 10.1016/j.cor.2009.12.002 10.7305/automatika.2014.01.580 10.1145/3442381.3449935 10.1002/9781118029176 10.1007/978-3-319-55511-9 10.1016/j.ejor.2008.03.023 10.1016/j.trb.2017.04.017 10.1016/j.ejor.2021.07.014 10.1287/trsc.1040.0095 10.1007/s13676-018-0124-0 10.1287/opre.41.1.60 10.7551/mitpress/1090.001.0001 10.1002/9781119815068 10.1007/BF00940812 10.1016/j.ejor.2014.03.005 10.1287/ijoc.4.2.146 10.1002/net.21628 10.1016/j.trd.2017.04.016 10.1007/BF00992698 10.1016/0377-2217(95)00189-1 10.1287/opre.39.4.601 10.1016/j.cor.2010.10.019 10.24963/ijcai.2020/609 10.1016/j.knosys.2022.108489 10.1016/j.cor.2004.09.015 10.1016/j.ejor.2016.03.049 10.1016/j.cor.2005.09.012 10.1109/TSMC.1974.4309370 10.1007/s41604-018-0006-5 10.1287/trsc.1060.0166 10.1016/j.cor.2019.03.017 10.1145/3520304.3528994 10.1016/j.eswa.2009.06.085 10.1016/j.cor.2015.07.001 10.1016/j.ejor.2016.02.016 10.1016/j.tre.2021.102383 10.1287/opre.42.4.626 10.1287/trsc.1030.0056 10.1007/978-0-387-71722-7 10.1007/s10489-006-0033-z 10.1002/nav.20347 10.1007/s10479-016-2177-5 10.1145/3583131.3590366 10.1016/j.ejor.2021.06.021 10.1002/j.1538-7305.1965.tb04146.x 10.1016/j.ejor.2018.05.032 10.1016/j.tre.2008.08.003 10.2307/1427801 10.1287/trsc.34.4.426.12325 10.1016/j.ejor.2022.12.009 10.1016/j.ejor.2012.09.016 10.1109/TASE.2020.2984739 10.1109/ICDE51399.2021.00283 10.1109/CEC.2017.7969539 10.1109/TITS.2020.3009289 10.1016/j.trc.2018.05.003 10.1287/trsc.2019.0953 10.1007/s00291-017-0501-3 10.1287/trsc.2021.1069 10.1007/s10479-015-1949-7 10.1016/0377-2217(92)90192-C 10.1016/j.ejor.2015.04.009 10.1287/opre.2018.1763 10.3390/a16060285 10.1016/j.ejor.2012.08.015 10.1109/CDC.2007.4434989 10.1016/j.cor.2004.04.013 10.1287/opre.12.4.568 10.1109/LCSYS.2019.2921514 10.1109/TITS.2019.2931830 10.1016/j.cor.2018.06.004 10.1016/j.trd.2018.03.002 10.1016/j.eswa.2015.04.060 10.1017/9781108380690 10.1007/978-3-319-20863-3 10.1007/978-1-4614-3628-7 |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2023 MDPI AG 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: COPYRIGHT 2023 MDPI AG – notice: 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PTHSS Q9U DOA |
| DOI | 10.3390/math12010028 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Materials Science & Engineering ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Download PDF from ProQuest Central Technology collection ProQuest One ProQuest Central Korea Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition Engineering collection ProQuest Central Basic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 2227-7390 |
| ExternalDocumentID | oai_doaj_org_article_2960512c3f6d4b8d92f898975643c41d A779346172 10_3390_math12010028 |
| GroupedDBID | -~X 5VS 85S 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABPPZ ABUWG ACIPV ACIWK ADBBV AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO GNUQQ GROUPED_DOAJ HCIFZ IAO ITC K6V K7- KQ8 L6V M7S MODMG M~E OK1 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS RNS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c406t-6c33a430be4326367f39d1283669d5f0e66eb7dc7dc1f7a4793fa1afbfb893693 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001140635900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2227-7390 |
| IngestDate | Tue Oct 14 19:08:05 EDT 2025 Fri Jul 25 12:08:24 EDT 2025 Tue Nov 04 18:30:50 EST 2025 Sat Nov 29 07:18:27 EST 2025 Tue Nov 18 20:57:20 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c406t-6c33a430be4326367f39d1283669d5f0e66eb7dc7dc1f7a4793fa1afbfb893693 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0009-0006-1669-1813 0000-0002-8012-0090 0000-0001-8564-4304 0000-0001-8732-4769 |
| OpenAccessLink | https://doaj.org/article/2960512c3f6d4b8d92f898975643c41d |
| PQID | 2912643232 |
| PQPubID | 2032364 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_2960512c3f6d4b8d92f898975643c41d proquest_journals_2912643232 gale_infotracacademiconefile_A779346172 crossref_citationtrail_10_3390_math12010028 crossref_primary_10_3390_math12010028 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-01-01 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Mathematics (Basel) |
| PublicationYear | 2024 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Sabar (ref_68) 2019; 44 ref_138 Nascimento (ref_126) 2020; 284 Larsen (ref_48) 2002; 53 Papastavrou (ref_151) 1996; 95 Secomandi (ref_162) 2001; 49 Ferrucci (ref_168) 2013; 225 ref_98 Bent (ref_139) 2004; 52 ref_132 ref_135 Gendreau (ref_160) 1996; 44 Ulmer (ref_112) 2018; 8 Ulmer (ref_67) 2018; 62 Okulewicz (ref_77) 2019; 48 ref_15 Pavone (ref_167) 2011; 56 Schmid (ref_84) 2012; 219 Xiang (ref_154) 2008; 185 Jahanshahi (ref_133) 2022; 243 Krishnamurti (ref_94) 2004; 38 Vinsensius (ref_56) 2020; 54 ref_127 Vodopivec (ref_157) 2017; 102 Wen (ref_61) 2010; 37 Bertsimas (ref_52) 1993; 25 Ausseil (ref_150) 2021; 56 Maxwell (ref_83) 2010; 22 Powell (ref_110) 2009; 56 ref_24 Pillac (ref_145) 2012; 54 Clarke (ref_19) 1964; 12 Goodson (ref_124) 2015; 50 Gendreau (ref_100) 2001; 27 Pavone (ref_155) 2009; 14 Brinkmann (ref_63) 2019; 106 ref_29 Buhrkal (ref_55) 2012; 39 Hvattum (ref_140) 2006; 40 ref_28 Sheridan (ref_69) 2013; 49 Konda (ref_136) 2003; 42 ref_27 Ulmer (ref_116) 2020; 28 Voccia (ref_149) 2019; 53 Ulmer (ref_80) 2019; 108 Fosin (ref_26) 2014; 55 Soeffker (ref_6) 2022; 298 Archetti (ref_171) 2016; 254 Ulmer (ref_114) 2018; 53 Gendreau (ref_54) 2006; 14 Ulmer (ref_88) 2020; 9 Lorini (ref_156) 2011; 38 Hansen (ref_38) 1997; 24 Ropke (ref_40) 2006; 40 Silva (ref_122) 2023; 12 Azi (ref_144) 2010; 199 Bopardikar (ref_64) 2020; 4 Ferrucci (ref_70) 2015; 77 Soysal (ref_125) 2017; 54 Bono (ref_137) 2021; 22 Gendreau (ref_18) 2005; 39 Vidal (ref_21) 2013; 231 Hvattum (ref_153) 2007; 49 Glover (ref_36) 1990; 2 Basso (ref_118) 2022; 157 Ichoua (ref_164) 2006; 40 Billing (ref_158) 2018; 88 ref_82 Sarasola (ref_146) 2015; 236 Potvin (ref_141) 2006; 33 Afsar (ref_59) 2021; 152 Haghani (ref_163) 2005; 32 Eilon (ref_16) 1974; 21 ref_142 Eksioglu (ref_13) 2009; 57 Bellman (ref_101) 1957; 6 Rios (ref_5) 2021; 160 Kim (ref_66) 2016; 17 ref_85 Swihart (ref_72) 1999; 114 Pillac (ref_2) 2013; 225 Ou (ref_107) 2021; 18 Gheysens (ref_17) 1984; 6 Zhang (ref_7) 2023; 256 (ref_35) 1985; 45 Sayarshad (ref_71) 2015; 81 Bertsimas (ref_177) 2019; 67 Ichoua (ref_92) 2000; 34 Chen (ref_123) 2023; 308 Savelsbergh (ref_23) 1992; 4 Mao (ref_76) 2020; 115 Bertsimas (ref_51) 1993; 41 Glover (ref_37) 1990; 2 Watkins (ref_106) 1992; 8 Dantzig (ref_12) 1959; 6 Kirkpatrick (ref_34) 1983; 220 Fisher (ref_14) 1994; 42 ref_58 Schilde (ref_169) 2014; 238 ref_57 Secomandi (ref_161) 2000; 27 Zhang (ref_86) 2023; 306 ref_176 ref_179 Ferrucci (ref_147) 2016; 253 ref_178 Christiansen (ref_89) 2017; 105 Ulmer (ref_97) 2017; 59 ref_180 Binart (ref_53) 2016; 65 Zhang (ref_79) 2017; 52 Chen (ref_121) 2022; 298 Marinakis (ref_30) 2011; Volume 8 Laporte (ref_10) 1992; 59 ref_60 Gendreau (ref_93) 1999; 33 Ulmer (ref_113) 2018; 53 Ulmer (ref_73) 2019; 54 Klein (ref_174) 2018; 40 ref_165 Alinaghian (ref_62) 2019; 131 Tirado (ref_172) 2017; 253 Ferrucci (ref_91) 2014; 63 Dunnett (ref_96) 2018; 70 Ritzinger (ref_3) 2016; 54 Ghiani (ref_143) 2009; 45 Hildebrandt (ref_8) 2023; 150 Psaraftis (ref_4) 2016; 67 Schyns (ref_90) 2015; 245 Yang (ref_152) 2004; 38 Ulmer (ref_117) 2020; 285 Pureza (ref_87) 2008; 46 Lin (ref_25) 1965; 44 ref_119 Ding (ref_128) 2021; 5 Marinakis (ref_32) 2010; 37 Yu (ref_78) 2019; 19 ref_33 Tirado (ref_148) 2017; 29 ref_31 Santos (ref_81) 2015; 42 Klapp (ref_65) 2018; 271 Ulmer (ref_111) 2015; 52 Rosenkrantz (ref_20) 1977; 6 (ref_22) 2019; 2019 ref_39 Ulmer (ref_134) 2018; 72 Fernandez (ref_170) 2014; 48 ref_104 Beirigo (ref_129) 2022; 56 ref_103 Wang (ref_175) 2021; 154 ref_105 ref_108 Ulmer (ref_115) 2018; 269 ref_109 Psaraftis (ref_11) 1980; 14 ref_47 ref_46 Hanshar (ref_95) 2007; 27 ref_45 ref_44 Kullman (ref_130) 2020; 56 ref_43 Alabbasi (ref_75) 2019; 20 ref_42 Pisinger (ref_41) 2007; 34 ref_102 Hildebrandt (ref_120) 2021; 56 ref_1 Novoa (ref_166) 2009; 196 Ghiani (ref_9) 2003; 151 Hyland (ref_159) 2018; 92 ref_49 Bertsimas (ref_50) 1991; 39 Branke (ref_99) 2005; 39 Qin (ref_131) 2020; 50 Steever (ref_74) 2019; 107 Zou (ref_173) 2018; 1 |
| References_xml | – volume: Volume 8 start-page: 347 year: 2011 ident: ref_30 article-title: Bumble bees mating optimization algorithm for the vehicle routing problem publication-title: Handbook of Swarm Intelligence. Adaptation, Learning, and Optimization doi: 10.1007/978-3-642-17390-5_15 – volume: 19 start-page: 1033 year: 2019 ident: ref_78 article-title: Dynamic routing with real-time traffic information publication-title: Oper. Res. – volume: 48 start-page: 31 year: 2014 ident: ref_170 article-title: The dynamic multiperiod vehicle routing problem with probabilistic information publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.02.010 – volume: 38 start-page: 669 year: 2004 ident: ref_94 article-title: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2003.09.001 – volume: 199 start-page: 103 year: 2010 ident: ref_144 article-title: A dynamic vehicle routing problem with multiple delivery routes publication-title: Ann. Oper. Res. doi: 10.1007/s10479-011-0991-3 – volume: 306 start-page: 596 year: 2023 ident: ref_86 article-title: Solving large-scale dynamic vehicle routing problems with stochastic requests publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2022.07.015 – volume: 40 start-page: 211 year: 2006 ident: ref_164 article-title: Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching publication-title: Transp. Sci. doi: 10.1287/trsc.1050.0114 – volume: 150 start-page: 106071 year: 2023 ident: ref_8 article-title: Opportunities for reinforcement learning in stochastic dynamic vehicle routing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.106071 – volume: 88 start-page: 1009 year: 2018 ident: ref_158 article-title: A multiperiod auto-carrier transportation problem with probabilistic future demands publication-title: J. Bus. Econ. – volume: 52 start-page: 1 year: 2015 ident: ref_111 article-title: Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests publication-title: Transp. Sci. – volume: 44 start-page: 469 year: 1996 ident: ref_160 article-title: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers publication-title: Oper. Res. doi: 10.1287/opre.44.3.469 – volume: 63 start-page: 1 year: 2014 ident: ref_91 article-title: Real-time control of express pickup and delivery processes in a dynamic environment publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2014.02.001 – volume: 39 start-page: 241 year: 2012 ident: ref_55 article-title: The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context publication-title: Procedia Soc. Behav. Sci. doi: 10.1016/j.sbspro.2012.03.105 – ident: ref_108 – volume: 57 start-page: 1472 year: 2009 ident: ref_13 article-title: The vehicle routing problem: A taxonomic review publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2009.05.009 – volume: 17 start-page: 2367 year: 2016 ident: ref_66 article-title: Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2016.2521779 – ident: ref_58 doi: 10.1137/1.9780898718515 – volume: 220 start-page: 671 year: 1983 ident: ref_34 article-title: Optimization by Simulated Annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 54 start-page: 414 year: 2012 ident: ref_145 article-title: An event-driven optimization framework for dynamic vehicle routing publication-title: Decis. Support Syst. doi: 10.1016/j.dss.2012.06.007 – volume: 72 start-page: 475 year: 2018 ident: ref_134 article-title: Same-Day Delivery with a Heterogeneous Fleet of Drones and Vehicles publication-title: Networks doi: 10.1002/net.21855 – volume: 12 start-page: 100105 year: 2023 ident: ref_122 article-title: Deep reinforcement learning for stochastic last-mile delivery with crowdshipping publication-title: EURO J. Transp. Logist. doi: 10.1016/j.ejtl.2023.100105 – volume: 14 start-page: 130 year: 1980 ident: ref_11 article-title: A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem publication-title: Transp. Sci. doi: 10.1287/trsc.14.2.130 – ident: ref_82 doi: 10.1145/3357384.3357799 – volume: 5 start-page: 97 year: 2021 ident: ref_128 article-title: A City-Wide Crowdsourcing Delivery System with Reinforcement Learning publication-title: Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. doi: 10.1145/3478117 – volume: 53 start-page: 637 year: 2002 ident: ref_48 article-title: Partially dynamic vehicle routing—Models and algorithms publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601352 – volume: 29 start-page: 553 year: 2017 ident: ref_148 article-title: Determining departure times in dynamic and stochastic maritime routing and scheduling problems publication-title: Flex. Serv. Manuf. J. doi: 10.1007/s10696-016-9242-x – ident: ref_31 – volume: 269 start-page: 883 year: 2018 ident: ref_115 article-title: Value Function Approximation for Dynamic Multi-Period Vehicle Routing publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.02.038 – volume: 28 start-page: 279 year: 2020 ident: ref_116 article-title: Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-018-0588-x – ident: ref_135 – volume: 53 start-page: 167 year: 2019 ident: ref_149 article-title: The Same-Day Delivery Problem for Online Purchases publication-title: Transp. Sci. doi: 10.1287/trsc.2016.0732 – volume: 14 start-page: 157 year: 2006 ident: ref_54 article-title: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries publication-title: Transp. Res. Part C Emerg. Technol. doi: 10.1016/j.trc.2006.03.002 – volume: 56 start-page: 1259 year: 2011 ident: ref_167 article-title: Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2010.2092850 – ident: ref_29 doi: 10.7551/mitpress/1290.001.0001 – volume: 49 start-page: 330 year: 2007 ident: ref_153 article-title: A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems publication-title: Networks doi: 10.1002/net.20182 – volume: 131 start-page: 227 year: 2019 ident: ref_62 article-title: A Mathematical Model for Location of Temporary Relief Centers and Dynamic Routing of Aerial Rescue Vehicles publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.03.002 – ident: ref_178 doi: 10.1287/trsc.2022.1173 – volume: 231 start-page: 1 year: 2013 ident: ref_21 article-title: Heuristics for multi-attribute vehicle routing problems: A survey and synthesis publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.02.053 – volume: 285 start-page: 183 year: 2020 ident: ref_117 article-title: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.04.029 – volume: 56 start-page: 799 year: 2021 ident: ref_120 article-title: Supervised Learning for Arrival Time Estimations in Restaurant Meal Delivery publication-title: Transp. Sci. – volume: 24 start-page: 1097 year: 1997 ident: ref_38 article-title: Variable neighborhood search publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(97)00031-2 – volume: 6 start-page: 563 year: 1977 ident: ref_20 article-title: An Analysis of Several Heuristics for the Traveling Salesman Problem publication-title: SIAM J. Comput. doi: 10.1137/0206041 – volume: 154 start-page: 107131 year: 2021 ident: ref_175 article-title: An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2021.107131 – volume: 81 start-page: 539 year: 2015 ident: ref_71 article-title: A scalable non-myopic dynamic dial-a-ride and pricing problem publication-title: Transp. Res. Part B. Methodol. doi: 10.1016/j.trb.2015.06.008 – volume: 14 start-page: 350 year: 2009 ident: ref_155 article-title: A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience publication-title: Mob. Netw. Appl. doi: 10.1007/s11036-008-0101-1 – volume: 6 start-page: 679 year: 1957 ident: ref_101 article-title: A Markovian Decision Process publication-title: J. Math. Mech. – ident: ref_28 – volume: 2 start-page: 4 year: 1990 ident: ref_37 article-title: Tabu search—Part II publication-title: ORSA J. Comput. doi: 10.1287/ijoc.2.1.4 – volume: 6 start-page: 80 year: 1959 ident: ref_12 article-title: The Truck Dispatching Problem publication-title: Manag. Sci. doi: 10.1287/mnsc.6.1.80 – volume: 56 start-page: 567 year: 2020 ident: ref_130 article-title: Dynamic Ride-Hailing with Electric Vehicles publication-title: Transp. Sci. – volume: 42 start-page: 1143 year: 2003 ident: ref_136 article-title: On actor-critic algorithms publication-title: SIAM J. Control. Optim. doi: 10.1137/S0363012901385691 – volume: 6 start-page: 207 year: 1984 ident: ref_17 article-title: A comparison of techniques for solving the fleet size and mix vehicle routing problem publication-title: Oper.-Res.-Spektrum doi: 10.1007/BF01720070 – volume: 40 start-page: 455 year: 2006 ident: ref_40 article-title: An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows publication-title: Transp. Sci. doi: 10.1287/trsc.1050.0135 – volume: 9 start-page: 100008 year: 2020 ident: ref_88 article-title: On modeling stochastic dynamic vehicle routing problems publication-title: EURO J. Transp. Logist. doi: 10.1016/j.ejtl.2020.100008 – volume: 22 start-page: 266 year: 2010 ident: ref_83 article-title: Approximate Dynamic Programming for Ambulance Redeployment publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1090.0345 – volume: 151 start-page: 1 year: 2003 ident: ref_9 article-title: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(02)00915-3 – volume: 38 start-page: 135 year: 2004 ident: ref_152 article-title: Real-Time Multivehicle Truckload Pickup and Delivery Problems publication-title: Transp. Sci. doi: 10.1287/trsc.1030.0068 – volume: 256 start-page: 108751 year: 2023 ident: ref_7 article-title: Dynamic vehicle routing with random requests: A literature review publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2022.108751 – volume: 27 start-page: 1641 year: 2001 ident: ref_100 article-title: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation publication-title: Parallel Comput. doi: 10.1016/S0167-8191(01)00103-X – ident: ref_33 doi: 10.1007/978-1-4419-1665-5 – ident: ref_119 doi: 10.1609/icaps.v30i1.6685 – volume: 49 start-page: 796 year: 2001 ident: ref_162 article-title: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands publication-title: Oper. Res. doi: 10.1287/opre.49.5.796.10608 – volume: 54 start-page: 215 year: 2016 ident: ref_3 article-title: A survey on dynamic and stochastic vehicle routing problems publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2015.1043403 – volume: 52 start-page: 977 year: 2004 ident: ref_139 article-title: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers publication-title: Oper. Res. doi: 10.1287/opre.1040.0124 – volume: 160 start-page: 107604 year: 2021 ident: ref_5 article-title: Recent dynamic vehicle routing problems: A survey publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2021.107604 – volume: 114 start-page: 447 year: 1999 ident: ref_72 article-title: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(98)00260-4 – volume: 59 start-page: 161 year: 2017 ident: ref_97 article-title: On the Value and Challenge of Real-Time Information in Dynamic Dispatching of Service Vehicles publication-title: Bus. Inf. Syst. Eng. doi: 10.1007/s12599-017-0468-2 – volume: 52 start-page: 497 year: 2017 ident: ref_79 article-title: Dynamic Orienteering on a Network of Queues publication-title: Transp. Sci. – volume: 33 start-page: 381 year: 1999 ident: ref_93 article-title: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching publication-title: Transp. Sci. doi: 10.1287/trsc.33.4.381 – volume: 48 start-page: 44 year: 2019 ident: ref_77 article-title: A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.03.008 – ident: ref_42 doi: 10.1109/WSC.2018.8632452 – volume: 107 start-page: 173 year: 2019 ident: ref_74 article-title: Dynamic Courier Routing for a Food Delivery Service publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.03.008 – volume: 70 start-page: 269 year: 2018 ident: ref_96 article-title: Optimising police dispatch for incident response in real time publication-title: J. Oper. Res. Soc. doi: 10.1080/01605682.2018.1434401 – volume: 219 start-page: 611 year: 2012 ident: ref_84 article-title: Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.10.043 – volume: 185 start-page: 534 year: 2008 ident: ref_154 article-title: The study of a dynamic dial-a-ride problem under time dependent stochastic environments publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.01.007 – volume: 27 start-page: 1201 year: 2000 ident: ref_161 article-title: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(99)00146-X – ident: ref_179 – volume: 77 start-page: 76 year: 2015 ident: ref_70 article-title: A general approach for controlling vehicle en-route diversions in dynamic vehicle routing problems publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2015.03.003 – volume: 284 start-page: 1088 year: 2020 ident: ref_126 article-title: Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2020.01.033 – volume: 105 start-page: 163 year: 2017 ident: ref_89 article-title: Operational planning of routes and schedules for a fleet of fuel supply vessels publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2016.07.009 – volume: 157 start-page: 102496 year: 2022 ident: ref_118 article-title: Dynamic stochastic electric vehicle routing with safe reinforcement learning publication-title: Transp. Res. Part Logist. Transp. Rev. doi: 10.1016/j.tre.2021.102496 – volume: 115 start-page: 102626 year: 2020 ident: ref_76 article-title: Dispatch of autonomous vehicles for taxi services: A deep reinforcement learning approach publication-title: Transp. Res. Part C Emerg. Technol. doi: 10.1016/j.trc.2020.102626 – volume: 49 start-page: 178 year: 2013 ident: ref_69 article-title: The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem publication-title: Transp. Res. A Part Policy Pract. doi: 10.1016/j.tra.2013.01.032 – volume: 44 start-page: 1018 year: 2019 ident: ref_68 article-title: A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2018.10.015 – volume: 37 start-page: 1615 year: 2010 ident: ref_61 article-title: The dynamic multi-period vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.12.002 – volume: 55 start-page: 124 year: 2014 ident: ref_26 article-title: Vehicle Routing Optimization Using Multiple Local Search Improvements publication-title: Automatika doi: 10.7305/automatika.2014.01.580 – ident: ref_127 doi: 10.1145/3442381.3449935 – volume: 54 start-page: 855 year: 2019 ident: ref_73 article-title: Dynamic Pricing and Routing for Same-Day Delivery publication-title: Transp. Sci. – ident: ref_142 – ident: ref_103 doi: 10.1002/9781118029176 – volume: 50 start-page: 272 year: 2020 ident: ref_131 article-title: Ride-Hailing Order Dispatching at DiDi via Reinforcement Learning publication-title: Interface – ident: ref_49 – ident: ref_85 doi: 10.1007/978-3-319-55511-9 – volume: 196 start-page: 509 year: 2009 ident: ref_166 article-title: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.03.023 – volume: 102 start-page: 22 year: 2017 ident: ref_157 article-title: An optimal stopping approach to managing travel-time uncertainty for time-sensitive customer pickup publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2017.04.017 – volume: 298 start-page: 801 year: 2022 ident: ref_6 article-title: Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.07.014 – volume: 39 start-page: 298 year: 2005 ident: ref_99 article-title: Waiting Strategies for Dynamic Vehicle Routing publication-title: Transp. Sci. doi: 10.1287/trsc.1040.0095 – volume: 8 start-page: 327 year: 2018 ident: ref_112 article-title: Preemptive Depot Returns for Dynamic Same-Day Delivery publication-title: EURO J. Transp. Logist. doi: 10.1007/s13676-018-0124-0 – volume: 46 start-page: 165 year: 2008 ident: ref_87 article-title: Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows publication-title: INFOR Inf. Syst. Oper. Res. – volume: 41 start-page: 60 year: 1993 ident: ref_51 article-title: Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles publication-title: Oper. Res. doi: 10.1287/opre.41.1.60 – ident: ref_27 doi: 10.7551/mitpress/1090.001.0001 – ident: ref_102 doi: 10.1002/9781119815068 – volume: 45 start-page: 41 year: 1985 ident: ref_35 article-title: Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm publication-title: J. Optim. Theory Appl. doi: 10.1007/BF00940812 – volume: 2 start-page: 4 year: 1990 ident: ref_36 article-title: Tabu search—Part I publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2.1.4 – ident: ref_180 – volume: 238 start-page: 18 year: 2014 ident: ref_169 article-title: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.03.005 – volume: 4 start-page: 146 year: 1992 ident: ref_23 article-title: The vehicle routing problem with time windows: Minimizing route duration publication-title: ORSA J. Comput. doi: 10.1287/ijoc.4.2.146 – volume: 67 start-page: 3 year: 2016 ident: ref_4 article-title: Dynamic vehicle routing problems: Three decades and counting publication-title: Networks doi: 10.1002/net.21628 – ident: ref_104 – volume: 54 start-page: 82 year: 2017 ident: ref_125 article-title: Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm publication-title: Transp. Res. Part D Transp. Environ. doi: 10.1016/j.trd.2017.04.016 – volume: 8 start-page: 279 year: 1992 ident: ref_106 article-title: Q-learning publication-title: Mach. Learn. doi: 10.1007/BF00992698 – volume: 95 start-page: 167 year: 1996 ident: ref_151 article-title: A stochastic and dynamic routing policy using branching processes with state dependent immigration publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00189-1 – ident: ref_98 – volume: 39 start-page: 601 year: 1991 ident: ref_50 article-title: A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane publication-title: Oper. Res. doi: 10.1287/opre.39.4.601 – volume: 38 start-page: 1086 year: 2011 ident: ref_156 article-title: Online vehicle routing and scheduling with dynamic travel times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2010.10.019 – volume: 50 start-page: 150818112639001 year: 2015 ident: ref_124 article-title: Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits publication-title: Transp. Sci. – ident: ref_57 doi: 10.24963/ijcai.2020/609 – volume: 243 start-page: 108489 year: 2022 ident: ref_133 article-title: A deep reinforcement learning approach for the meal delivery problem publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2022.108489 – volume: 33 start-page: 1129 year: 2006 ident: ref_141 article-title: Vehicle routing and scheduling with dynamic travel times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2004.09.015 – volume: 254 start-page: 472 year: 2016 ident: ref_171 article-title: The Vehicle Routing Problem with Occasional Drivers publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.03.049 – volume: 34 start-page: 2403 year: 2007 ident: ref_41 article-title: A general heuristic for vehicle routing problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.09.012 – volume: 21 start-page: 589 year: 1974 ident: ref_16 article-title: Distribution Management-Mathematical Modelling and Practical Analysis publication-title: IEEE Trans. Syst. Man, Cybern. doi: 10.1109/TSMC.1974.4309370 – volume: 1 start-page: 73 year: 2018 ident: ref_173 article-title: A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem publication-title: J. Veh. Routing Algorithms doi: 10.1007/s41604-018-0006-5 – volume: 40 start-page: 421 year: 2006 ident: ref_140 article-title: Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic publication-title: Transp. Sci. doi: 10.1287/trsc.1060.0166 – volume: 108 start-page: 1 year: 2019 ident: ref_80 article-title: Same-Day Delivery with Pickup Stations and Autonomous Vehicles publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.03.017 – ident: ref_176 – volume: 53 start-page: 1 year: 2018 ident: ref_114 article-title: Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests publication-title: Transp. Sci. – ident: ref_45 doi: 10.1145/3520304.3528994 – volume: 37 start-page: 1446 year: 2010 ident: ref_32 article-title: A hybrid genetic—Particle Swarm Optimization Algorithm for the vehicle routing problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2009.06.085 – volume: 65 start-page: 64 year: 2016 ident: ref_53 article-title: A 2-stage method for a field service routing problem with stochastic travel and service times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.07.001 – volume: 253 start-page: 356 year: 2016 ident: ref_147 article-title: Pro-active real-time routing in applications with multiple request patterns publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.02.016 – volume: 152 start-page: 102383 year: 2021 ident: ref_59 article-title: Vehicle routing problem with zone-based pricing publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2021.102383 – volume: 42 start-page: 626 year: 1994 ident: ref_14 article-title: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees publication-title: Oper. Res. doi: 10.1287/opre.42.4.626 – volume: 53 start-page: 623 year: 2018 ident: ref_113 article-title: Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing publication-title: Transp. Sci. – volume: 39 start-page: 104 year: 2005 ident: ref_18 article-title: Vehicle routing problem with time windows, Part I: Route construction and local search algorithms publication-title: Transp. Sci. doi: 10.1287/trsc.1030.0056 – ident: ref_47 doi: 10.1007/978-0-387-71722-7 – volume: 27 start-page: 89 year: 2007 ident: ref_95 article-title: Dynamic vehicle routing using genetic algorithms publication-title: Appl. Intell. doi: 10.1007/s10489-006-0033-z – volume: 56 start-page: 239 year: 2009 ident: ref_110 article-title: What You Should Know About Approximate Dynamic Programming publication-title: Nav. Res. Logist. doi: 10.1002/nav.20347 – volume: 253 start-page: 825 year: 2017 ident: ref_172 article-title: Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search publication-title: Ann. Oper. Res. doi: 10.1007/s10479-016-2177-5 – ident: ref_46 doi: 10.1145/3583131.3590366 – volume: 298 start-page: 939 year: 2022 ident: ref_121 article-title: Deep Q-learning for same-day delivery with vehicles and drones publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.06.021 – volume: 44 start-page: 2245 year: 1965 ident: ref_25 article-title: Computer solutions of the traveling salesman problem publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1965.tb04146.x – ident: ref_24 – volume: 271 start-page: 519 year: 2018 ident: ref_65 article-title: The Dynamic Dispatch Waves Problem for same-day delivery publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.05.032 – volume: 45 start-page: 96 year: 2009 ident: ref_143 article-title: Anticipatory algorithms for same-day courier dispatching publication-title: Transp. Res. Part E Logist. Transp. Rev. doi: 10.1016/j.tre.2008.08.003 – volume: 25 start-page: 947 year: 1993 ident: ref_52 article-title: Stochastic and Dynamic Vehicle Routing with General Demand and Interarrival Time Distributions publication-title: Adv. Appl. Probab. doi: 10.2307/1427801 – volume: 34 start-page: 426 year: 2000 ident: ref_92 article-title: Diversion Issues in Real-Time Vehicle Dispatching publication-title: Transp. Sci. doi: 10.1287/trsc.34.4.426.12325 – volume: 308 start-page: 738 year: 2023 ident: ref_123 article-title: Same-day delivery with fair customer service publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2022.12.009 – volume: 225 start-page: 130 year: 2013 ident: ref_168 article-title: A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.09.016 – volume: 18 start-page: 85 year: 2021 ident: ref_107 article-title: A Method Integrating Q-Learning with Approximate Dynamic Programming for Gantry Work Cell Scheduling publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2020.2984739 – ident: ref_132 doi: 10.1109/ICDE51399.2021.00283 – ident: ref_138 – ident: ref_44 doi: 10.1109/CEC.2017.7969539 – volume: 22 start-page: 7804 year: 2021 ident: ref_137 article-title: Solving Multi-Agent Routing Problems Using Deep Attention Mechanisms publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2020.3009289 – volume: 92 start-page: 278 year: 2018 ident: ref_159 article-title: Dynamic autonomous vehicle fleet operations: Optimization-based strategies to assign AVs to immediate traveler demand requests publication-title: Transp. Res. Part C Emerg. Technol. doi: 10.1016/j.trc.2018.05.003 – volume: 54 start-page: 565 year: 2020 ident: ref_56 article-title: Dynamic Incentive Mechanism for Delivery Slot Management in E-Commerce Attended Home Delivery publication-title: Transp. Sci. doi: 10.1287/trsc.2019.0953 – volume: 40 start-page: 969 year: 2018 ident: ref_174 article-title: A model-based approximation of opportunity cost for dynamic pricing in attended home delivery publication-title: OR Spectrum Quant. Approaches Manag. doi: 10.1007/s00291-017-0501-3 – volume: 56 start-page: 567 year: 2022 ident: ref_129 article-title: A Learning-Based Optimization Approach for Autonomous Ridesharing Platforms with Service Level Contracts and On-Demand Hiring of Idle Vehicles publication-title: Transp. Sci. doi: 10.1287/trsc.2021.1069 – volume: 236 start-page: 425 year: 2015 ident: ref_146 article-title: Variable neighborhood search for the stochastic and dynamic vehicle routing problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-015-1949-7 – volume: 59 start-page: 345 year: 1992 ident: ref_10 article-title: The vehicle routing problem: An overview of exact and approximate algorithms publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(92)90192-C – volume: 245 start-page: 704 year: 2015 ident: ref_90 article-title: An Ant Colony System for Responsive Dynamic Vehicle Routing publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.04.009 – volume: 56 start-page: 1111 year: 2021 ident: ref_150 article-title: Supplier Menus for Dynamic Matching in Peer-to-Peer Transportation Platforms publication-title: Transp. Sci. – volume: 67 start-page: 1 year: 2019 ident: ref_177 article-title: Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications publication-title: Oper. Res. doi: 10.1287/opre.2018.1763 – volume: 2019 start-page: 5075671 year: 2019 ident: ref_22 article-title: A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches publication-title: J. Adv. Transp. – ident: ref_43 doi: 10.3390/a16060285 – volume: 225 start-page: 1 year: 2013 ident: ref_2 article-title: A review of dynamic vehicle routing problems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.08.015 – ident: ref_165 doi: 10.1109/CDC.2007.4434989 – ident: ref_39 doi: 10.1007/978-1-4419-1665-5 – volume: 32 start-page: 2959 year: 2005 ident: ref_163 article-title: A dynamic vehicle routing problem with time-dependent travel times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2004.04.013 – volume: 12 start-page: 568 year: 1964 ident: ref_19 article-title: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points publication-title: Oper. Res. doi: 10.1287/opre.12.4.568 – volume: 4 start-page: 37 year: 2020 ident: ref_64 article-title: Dynamic Vehicle Routing in Presence of Random Recalls publication-title: IEEE Control. Syst. Lett. doi: 10.1109/LCSYS.2019.2921514 – volume: 20 start-page: 4714 year: 2019 ident: ref_75 article-title: DeepPool: Distributed Model-Free Algorithm for Ride-Sharing Using Deep Reinforcement Learning publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2019.2931830 – ident: ref_15 – volume: 106 start-page: 260 year: 2019 ident: ref_63 article-title: Dynamic Lookahead Policies for Stochastic-Dynamic Inventory Routing in Bike Sharing Systems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.06.004 – volume: 62 start-page: 345 year: 2018 ident: ref_67 article-title: Anticipating emission-sensitive traffic management strategies for dynamic delivery routing publication-title: Transp. Res. Part D. Transp. Environ. doi: 10.1016/j.trd.2018.03.002 – volume: 42 start-page: 6728 year: 2015 ident: ref_81 article-title: Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2015.04.060 – ident: ref_105 – ident: ref_109 doi: 10.1017/9781108380690 – ident: ref_60 doi: 10.1007/978-3-319-20863-3 – ident: ref_1 doi: 10.1007/978-1-4614-3628-7 |
| SSID | ssj0000913849 |
| Score | 2.3073542 |
| SecondaryResourceType | review_article |
| Snippet | Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving... |
| SourceID | doaj proquest gale crossref |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database |
| StartPage | 28 |
| SubjectTerms | Analysis approximate dynamic programming Customer services Customers Datasets Evolution Literature reviews Logistics Logistics services Markov decision process reinforcement learning review stochastic dynamic vehicle routing problem Taxonomy Travel time Urban areas Vehicle routing Vehicles |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB5R6KE9AH2gLtDKh1Y9VBFxnNjxCUG7iANFlShob5YfMYuEEthd-vs7k3gXLvRSKafEieyMPS-Pvw_gs1BNndtSZrLmVVY6xzPtBc-4K2pfCR99j8R0dabOz-vJRP9KCbd5Kqtc6sReUYfOU478oNAcbbdAB-Dw7j4j1ijaXU0UGi9gg1ASeF-6d7HKsRDmZV3qod5dYHR_gF7glNMGcE70608sUQ_Y_5xa7m3Nydb_9nIbNpOXyY6GafEG1pr2Lbz-uYJonb-DybArwLrILhadn1oCbGY_BoJ6dtVM6U1GBUNo3NhNy_BdNkZlRhkIdjlztmVn_fEh_BwbP56Xew-XJ-Pf30-zRLOQebTmi0x6IWwpctdgx6WQKgod0GwJKXWoYt5I2TgVPF48KkupuGi5jS66mugAxQ6st13bfABGzh_G21q7EEplc1vVNsQgMa5UwWo1gm_LX258wiAnKoxbg7EICcg8FdAIvqxa3w3YG8-0OybprdoQYnZ_o5tdm7QATYGhGjo3XkQZSlcHXURizlQVisuXPIzgK8ne0LrGLnmbjifgwAghyxwpHHdJ_t4I9peyN2nBz82j4Hf__XgPXhXoFw1ZnH1YX8wemo_w0v9Z3Mxnn_r5-xc4YfiS priority: 102 providerName: ProQuest |
| Title | Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment |
| URI | https://www.proquest.com/docview/2912643232 https://doaj.org/article/2960512c3f6d4b8d92f898975643c41d |
| Volume | 12 |
| WOSCitedRecordID | wos001140635900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: BENPR dateStart: 20130301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: K7- dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M7S dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: PIMPY dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwEB5VtIf2gEpb1G1h5UOrHlBEvHbs-MgjCASsVuWh5RT5EWuRULbaXXrktzOThGUviAtS5ENiW_b4Md84428Afgld5amVKlE5zxLpHE-MFzzhbpD7TPjoGyam6zM9HObjsRmthPoin7CWHrgV3O4AITYqJS-iCtLlwQwiRTzUGapSL3mg3TfVZsWYavZgw0UuTevpLtCu30X8N-H06zelwOsrOqih6n9pQ260zNFnWO_gIdtrm7UB76r6C3w6X3Krzr_CuD3OZ9PILhZTP7HEtMwO28jy7LqaUElGnj6oldhtzbAsK3AXoqMDdjVztmZnzb0frI4VzxfdvsHVUXF5cJx08RESj2p4kSgvhJUidZVEECaUjsIE1DdCKROymFZKVU4Hjw-P2tIZWrTcRhddTnH8xCas1dO6-g6MUBsaysa4EKS2qc1yG2JQaBDqYI3uwc6TxErfkYdTDIu7Eo0Ikm-5Kt8e_F7m_teSZryQb5-Ev8xDVNfNC5wAZTcBytcmQA_-0NCVtCCxSd529wqwY0RtVe5p7LckoNaDrafRLbuVOsfqOWJCgcDyx1u05id8HCDsaQ9ptmBtMbuvtuGD_7-4nc_68H6_GI7-9pvJiumpTvrkbXpB6UOB30cn56ObR4Vk76A |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQceCMWCvhAxQFFTWLHTg4IFbpVq92ukGirvbl-xGwlSMruAuqf4jcyk8e2l3LrASlSpMS24vjzzDdjewbgDVdlHhshI5knWSSsTaLC8SRKbJq7jLvgmkhMx2M1meTTafF5Df70Z2FoW2UvExtB7WtHPvKttEhQd3MkAB_OfkSUNYpWV_sUGi0sRuX5bzTZFu_3d3B8N9N0d3j4aS_qsgpEDpXXMpKOcyN4bEtsTXKpAi88SmkuZeGzEJdSllZ5h1cSlCHPUzCJCTbYnLLfcWz3BtwUPFc0r0YqWvl0KMZmLop2fz3nRbyFrHOW0IJzTOneL2m-JkHAVWqg0W279_-3v_IA7nUsmm23sH8Ia2X1CO4erELQLh7DtF31YHVgX5a1mxkKSM12zivzHe_H5YxqMtoQhcqbnVYM67IhCmvysLCjuTUVGzfHo7A5Nrw4D_gEjq6la09hvaqr8hkwIrdCIqe23gtlYpPlxgcv0W5W3hRqAO_6Idaui7FOqT6-abS1CBD6MiAGsLkqfdbGFrmi3EdCy6oMRQRvHtTzr7oTMDpFUxTJm-NBemFzX6SBMoOqDOHhROIH8Jawpklu4Sc50x2_wI5RBDC9rbDfgvjsADZ6rOlOoC30BdCe__v1a7i9d3gw1uP9yegF3EmRA7Yeqw1YX85_li_hlvu1PF3MXzVzh8HJdcPyL9vUVTU |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3db9MwED-NDiF44BtRGOAHJh5Q1CR2nOQBoUFbUa2rKsGm8mT8Ea-TRjLaAtq_xl_HXZJ2exlve0CKFCmxrTj--e53Z_sO4DVPiyzUQgYyi5JAGBMFueVREJk4swm33taRmI7G6WSSzWb5dAv-rM_C0LbKtUysBbWrLPnIe3Eeoe7mSAB6vt0WMe0P35_9CCiDFK20rtNpNBDZL85_o_m2fDfq41jvxvFw8OXjp6DNMBBYVGSrQFrOteChKbBlyWXqee5QYnMpc5f4sJCyMKmzeEU-1eSF8jrS3niTUSY8ju3egG2k5CLuwPZ0dDD9uvHwUMTNTOTNbnvO87CHHHQe0fJzSMnfL-nBOl3AVUqh1nTDe__zP7oPd1t-zfaaCfEAtoryIdw52ASnXT6CWbMewirPPq8qO9cUqpr1z0v9He9HxZxqMtoqhWqdnZQM67IBinHyvbDDhdElG9cHp7A5Nrg4KfgYDq-la0-gU1Zl8RQY0V4hkW0b50SqQ51k2nkn0aJOnc7TLrxdD7eybfR1SgJyqtAKI3Coy-Dowu6m9FkTdeSKch8IOZsyFCu8flAtjlUrelSMRirSOsu9dMJkLo895QxNE4SKFZHrwhvCnSKJhp9kdXswAztGscHUXor9FsR0u7Czxp1qRd1SXYDu2b9fv4JbiEY1Hk32n8PtGMlh48ragc5q8bN4ATftr9XJcvGynUgMvl03Lv8C415ftg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Review+of+Stochastic+Dynamic+Vehicle+Routing+in+the+Evolving+Urban+Logistics+Environment&rft.jtitle=Mathematics+%28Basel%29&rft.au=Marde%C5%A1i%C4%87%2C+Nikola&rft.au=Erdeli%C4%87%2C+Tomislav&rft.au=Cari%C4%87%2C+Ton%C4%8Di&rft.au=%C4%90urasevi%C4%87%2C+Marko&rft.date=2024-01-01&rft.pub=MDPI+AG&rft.issn=2227-7390&rft.eissn=2227-7390&rft.volume=12&rft.issue=1&rft_id=info:doi/10.3390%2Fmath12010028&rft.externalDocID=A779346172 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-7390&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-7390&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-7390&client=summon |