Approximate dynamic programming for pickup and delivery problem with crowd-shipping
We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that im...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part B: methodological Jg. 187; S. 103027 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Ltd
01.09.2024
|
| Schlagworte: | |
| ISSN: | 0191-2615 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that impose several challenges for efficient matching of orders to crowd-shippers. We formulate the problem as a Markov decision process and develop an Approximate Dynamic Programming (ADP) policy using value function approximation for obtaining a highly scalable and real-time matching strategy while considering temporal and spatial uncertainty in arrivals of online orders and crowd-shippers. We incorporate several algorithmic enhancements to the ADP algorithm, which significantly improve the convergence. We compare the ADP policy with an optimization-based myopic policy using various performance measures. Our numerical analysis with varying parameter settings shows that ADP policies can lead to up to 25.2% cost savings and a 9.8% increase in the number of served orders. Overall, we find that our proposed framework can guide crowd-shipping platforms for efficient real-time matching decisions and enhance the platform delivery capacity.
•A pickup and delivery crowd-shipping operation for same-day delivery is introduced.•Uncertainty in the arrival of crowd-shippers and online orders is incorporated.•An approximate dynamic programming policy for real-time matching is introduced.•Several enhancements for off-line learning of value functions are incorporated.•Numerical experiments provide managerial insights on various performance measures. |
|---|---|
| AbstractList | We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that impose several challenges for efficient matching of orders to crowd-shippers. We formulate the problem as a Markov decision process and develop an Approximate Dynamic Programming (ADP) policy using value function approximation for obtaining a highly scalable and real-time matching strategy while considering temporal and spatial uncertainty in arrivals of online orders and crowd-shippers. We incorporate several algorithmic enhancements to the ADP algorithm, which significantly improve the convergence. We compare the ADP policy with an optimization-based myopic policy using various performance measures. Our numerical analysis with varying parameter settings shows that ADP policies can lead to up to 25.2% cost savings and a 9.8% increase in the number of served orders. Overall, we find that our proposed framework can guide crowd-shipping platforms for efficient real-time matching decisions and enhance the platform delivery capacity.
•A pickup and delivery crowd-shipping operation for same-day delivery is introduced.•Uncertainty in the arrival of crowd-shippers and online orders is incorporated.•An approximate dynamic programming policy for real-time matching is introduced.•Several enhancements for off-line learning of value functions are incorporated.•Numerical experiments provide managerial insights on various performance measures. |
| ArticleNumber | 103027 |
| Author | Roorda, Matthew J. Bodur, Merve Cevik, Mucahit Mousavi, Kianoush |
| Author_xml | – sequence: 1 givenname: Kianoush orcidid: 0000-0002-4817-868X surname: Mousavi fullname: Mousavi, Kianoush email: kianoush.mousavi91@gmail.com organization: Department of Civil and Mineral Engineering, University of Toronto, Canada – sequence: 2 givenname: Merve surname: Bodur fullname: Bodur, Merve email: merve.bodur@ed.ac.uk organization: School of Mathematics, University of Edinburgh, UK – sequence: 3 givenname: Mucahit orcidid: 0000-0003-4020-6305 surname: Cevik fullname: Cevik, Mucahit email: mcevik@torontomu.ca organization: Department of Mechanical Industrial and Mechatronics Engineering, Toronto Metropolitan University, Canada – sequence: 4 givenname: Matthew J. orcidid: 0000-0001-6724-0154 surname: Roorda fullname: Roorda, Matthew J. email: matt.roorda@utoronto.ca organization: Department of Civil and Mineral Engineering, University of Toronto, Canada |
| BookMark | eNp9kE1vwjAMhnNg0oDtB-yWP1DmNGkL2gmhfUlIO2w7R2nsQli_lGYw_v2C2GkHTpat97HlZ8JGbdcSY3cCZgJEfr-bBV_OUkhV7CWkxYiNQSxEkuYiu2aTYdgBgFQgxux92fe--3GNCcTx2JrGWR4nG2-axrUbXnWe985-fffctMiRarcnfzxlypoafnBhy63vDpgMW9f3kblhV5WpB7r9q1P2-fT4sXpJ1m_Pr6vlOrGykCHBslJlKcGaMpurAmxGWBVZhaIyqNBCJmRuUosSF4CKpMmVoPm8SEFlKBdyyorz3nh-GDxV2rpgguva4I2rtQB98qF3OvrQJx_67COS4h_Z-6jAHy8yD2eG4kt7R14P1lFrCZ0nGzR27gL9CxPDfsU |
| CitedBy_id | crossref_primary_10_1016_j_trb_2024_103086 crossref_primary_10_1108_IJLM_05_2024_0316 crossref_primary_10_1016_j_multra_2025_100240 crossref_primary_10_1016_j_retrec_2025_101607 crossref_primary_10_1287_trsc_2024_0827 |
| Cites_doi | 10.1287/opre.2015.1425 10.1287/trsc.2017.0767 10.1287/trsc.2020.1000 10.1287/trsc.2018.0887 10.1016/j.ejor.2018.04.037 10.1111/poms.13219 10.1287/trsc.1080.0238 10.1007/s10479-011-0991-3 10.1016/j.trc.2021.102994 10.1287/trsc.2020.0977 10.1287/trsc.2019.0944 10.1287/trsc.2017.0803 10.1016/j.omega.2019.102139 10.1016/j.ejor.2021.04.002 10.1007/s10994-006-8365-9 10.1016/j.ejor.2016.03.049 10.1287/trsc.2021.1088 10.1287/trsc.1030.0073 10.1016/j.ejor.2020.01.033 10.1016/j.cor.2019.04.023 10.1287/trsc.2016.0732 10.1016/j.tre.2019.06.002 10.1002/net.21855 |
| ContentType | Journal Article |
| Copyright | 2024 The Author(s) |
| Copyright_xml | – notice: 2024 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.trb.2024.103027 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| ExternalDocumentID | 10_1016_j_trb_2024_103027 S0191261524001516 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABDMP ABFNM ABLJU ABMAC ABMMH ABPPZ ABUCO ABXDB ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHRSL AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HMY HVGLF HZ~ H~9 IHE J1W KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OHT OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SET SEW SPCBC SSB SSD SSO SSS SSZ T5K WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c373t-dbf4bb30cab58470c5edf75fd1fad4dc05136a2cd3d90d4e3a641e8872045d393 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001284561400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0191-2615 |
| IngestDate | Sat Nov 29 05:58:27 EST 2025 Tue Nov 18 21:45:14 EST 2025 Sat Aug 17 15:40:57 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Markov decision process Approximate dynamic programming Last-mile delivery Value function approximation Crowd-shipping |
| Language | English |
| License | This is an open access article under the CC BY-NC license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c373t-dbf4bb30cab58470c5edf75fd1fad4dc05136a2cd3d90d4e3a641e8872045d393 |
| ORCID | 0000-0002-4817-868X 0000-0001-6724-0154 0000-0003-4020-6305 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.trb.2024.103027 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_trb_2024_103027 crossref_primary_10_1016_j_trb_2024_103027 elsevier_sciencedirect_doi_10_1016_j_trb_2024_103027 |
| PublicationCentury | 2000 |
| PublicationDate | September 2024 2024-09-00 |
| PublicationDateYYYYMMDD | 2024-09-01 |
| PublicationDate_xml | – month: 09 year: 2024 text: September 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Transportation research. Part B: methodological |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Cleophas, Cottrill, Ehmke, Tierney (b10) 2019; 273 Skålnes J. Dahle, Andersson, Christiansen, Hvattum (b27) 2020 Ulmer, Goodson, Mattfeld, Hennig (b29) 2019; 53 Al-Kanj, Nascimento, Powell (b1) 2020; 284 Alnaggar, Gzara, Bookbinder (b3) 2021; 98 DMG (b16) 2018 Yıldız (b38) 2021; 123 Zebra (b40) 2019 Raviv, Tenzer (b24) 2018 Spivey, Powell (b28) 2004; 38 World Economic Forum (b37) 2021 Dahle, Andersson, Christiansen, Speranza (b13) 2019; 109 Mousavi, Bodur, Roorda (b22) 2022; 56 Wolsey, Nemhauser (b36) 1999 Dayarian, Savelsbergh (b14) 2020; 29 Ulmer, Thomas (b32) 2018; 72 Ulmer, Goodson, Mattfeld, Thomas (b30) 2020; 9 Voccia, Campbell, Thomas (b34) 2019; 53 Barr, Wohl (b8) 2013 Gdowska, Viana, Pedroso (b17) 2018; 30 Arslan, Agatz, Kroon, Zuidwijk (b6) 2019; 53 Azi, Gendreau, Potvin (b7) 2012; 199 Ulmer, Savelsbergh (b31) 2020; 54 Allahviranloo, Baghestani (b2) 2019; 128 Simao, Day, George, Gifford, Nienow, Powell (b26) 2009; 43 Boysen, Emde, Schwerdfeger (b9) 2022; 296 Amazon.ca (b4) 2021 Walmart Inc. (b35) 2020 Jiang, Powell (b20) 2015; 63 Archetti, Savelsbergh, Speranza (b5) 2016; 254 Ulmer, Thomas, Campbell, Woyak (b33) 2021; 55 Yildiz, Savelsbergh (b39) 2019; 53 Reyes, Erera, Savelsbergh, Sahasrabudhe, O’Neil (b25) 2018; 6571 Dayarian, Savelsbergh, Clarke (b15) 2020; 54 Dahle, Andersson, Christiansen (b12) 2017 George, Powell, Kualkarni (b19) 2008; 9 Mes, Powell, Frazier (b21) 2011; 12 Powell (b23) 2011 Compute Canada (b11) 2021 George, Powell (b18) 2006; 65 Ulmer (10.1016/j.trb.2024.103027_b33) 2021; 55 Dayarian (10.1016/j.trb.2024.103027_b15) 2020; 54 Ulmer (10.1016/j.trb.2024.103027_b30) 2020; 9 George (10.1016/j.trb.2024.103027_b18) 2006; 65 Skålnes J. Dahle (10.1016/j.trb.2024.103027_b27) 2020 Barr (10.1016/j.trb.2024.103027_b8) 2013 Raviv (10.1016/j.trb.2024.103027_b24) 2018 Jiang (10.1016/j.trb.2024.103027_b20) 2015; 63 Spivey (10.1016/j.trb.2024.103027_b28) 2004; 38 Yıldız (10.1016/j.trb.2024.103027_b38) 2021; 123 Reyes (10.1016/j.trb.2024.103027_b25) 2018; 6571 Simao (10.1016/j.trb.2024.103027_b26) 2009; 43 Arslan (10.1016/j.trb.2024.103027_b6) 2019; 53 Boysen (10.1016/j.trb.2024.103027_b9) 2022; 296 Dayarian (10.1016/j.trb.2024.103027_b14) 2020; 29 Dahle (10.1016/j.trb.2024.103027_b12) 2017 Ulmer (10.1016/j.trb.2024.103027_b29) 2019; 53 World Economic Forum (10.1016/j.trb.2024.103027_b37) 2021 Walmart Inc. (10.1016/j.trb.2024.103027_b35) 2020 Gdowska (10.1016/j.trb.2024.103027_b17) 2018; 30 Mousavi (10.1016/j.trb.2024.103027_b22) 2022; 56 Mes (10.1016/j.trb.2024.103027_b21) 2011; 12 Amazon.ca (10.1016/j.trb.2024.103027_b4) 2021 Ulmer (10.1016/j.trb.2024.103027_b32) 2018; 72 Dahle (10.1016/j.trb.2024.103027_b13) 2019; 109 Ulmer (10.1016/j.trb.2024.103027_b31) 2020; 54 Zebra (10.1016/j.trb.2024.103027_b40) 2019 George (10.1016/j.trb.2024.103027_b19) 2008; 9 Alnaggar (10.1016/j.trb.2024.103027_b3) 2021; 98 DMG (10.1016/j.trb.2024.103027_b16) 2018 Wolsey (10.1016/j.trb.2024.103027_b36) 1999 Yildiz (10.1016/j.trb.2024.103027_b39) 2019; 53 Al-Kanj (10.1016/j.trb.2024.103027_b1) 2020; 284 Compute Canada (10.1016/j.trb.2024.103027_b11) 2021 Azi (10.1016/j.trb.2024.103027_b7) 2012; 199 Powell (10.1016/j.trb.2024.103027_b23) 2011 Archetti (10.1016/j.trb.2024.103027_b5) 2016; 254 Allahviranloo (10.1016/j.trb.2024.103027_b2) 2019; 128 Cleophas (10.1016/j.trb.2024.103027_b10) 2019; 273 Voccia (10.1016/j.trb.2024.103027_b34) 2019; 53 |
| References_xml | – volume: 65 start-page: 167 year: 2006 end-page: 198 ident: b18 article-title: Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming publication-title: Mach. Learn. – year: 2021 ident: b4 article-title: Same-day and one-day delivery rates – volume: 9 year: 2020 ident: b30 article-title: On modeling stochastic dynamic vehicle routing problems publication-title: European J. Oper. Res. – volume: 53 start-page: 167 year: 2019 end-page: 184 ident: b34 article-title: The same-day delivery problem for online purchases publication-title: Transp. Sci. – volume: 9 year: 2008 ident: b19 article-title: Value function approximation using multiple aggregation for multiattribute resource management publication-title: J. Mach. Learn. Res. – year: 2021 ident: b37 article-title: Covid-19 pandemic accelerated shift to e-commerce by 5 years, new report says – volume: 6571 year: 2018 ident: b25 article-title: The meal delivery routing problem publication-title: Optimization Online – volume: 284 start-page: 1088 year: 2020 end-page: 1106 ident: b1 article-title: Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles publication-title: European J. Oper. Res. – volume: 123 year: 2021 ident: b38 article-title: Express package routing problem with occasional couriers publication-title: Trans. Res. Part C: Emerg. Technol. – volume: 98 year: 2021 ident: b3 article-title: Crowdsourced delivery: A review of platforms and academic literature publication-title: Omega – year: 2019 ident: b40 article-title: Reinventing the supply chain:the future of fulfillment vision study – volume: 55 start-page: 75 year: 2021 end-page: 100 ident: b33 article-title: The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times publication-title: Transp. Sci. – volume: 53 start-page: 1372 year: 2019 end-page: 1388 ident: b39 article-title: Provably high-quality solutions for the meal delivery routing problem publication-title: Transp. Sci. – year: 2013 ident: b8 article-title: Exclusive: Wal-mart may get customers to deliver packages to online buyers – volume: 54 start-page: 1113 year: 2020 end-page: 1133 ident: b31 article-title: Workforce scheduling in the era of crowdsourced delivery publication-title: Transp. Sci. – volume: 109 start-page: 122 year: 2019 end-page: 133 ident: b13 article-title: The pickup and delivery problem with time windows and occasional drivers publication-title: Comput. Oper. Res. – volume: 72 start-page: 475 year: 2018 end-page: 505 ident: b32 article-title: Same-day delivery with heterogeneous fleets of drones and vehicles publication-title: Networks – volume: 53 start-page: 185 year: 2019 end-page: 202 ident: b29 article-title: Offline–online approximate dynamic programming for dynamic vehicle routing with stochastic requests publication-title: Transp. Sci. – year: 2018 ident: b16 article-title: 2016 TTS: Design and conduct of the survey – start-page: 261 year: 2020 end-page: 276 ident: b27 article-title: The multistage stochastic vehicle routing problem with dynamic occasional drivers publication-title: Int. Conf. Comput. Logist. – volume: 53 start-page: 222 year: 2019 end-page: 235 ident: b6 article-title: Crowdsourced delivery—a dynamic pickup and delivery problem with ad hoc drivers publication-title: Transp. Sci. – start-page: 49 year: 2017 end-page: 63 ident: b12 article-title: The vehicle routing problem with dynamic occasional drivers publication-title: Int. Conf. Comput. Logist. – volume: 54 start-page: 229 year: 2020 end-page: 249 ident: b15 article-title: Same-day delivery with drone resupply publication-title: Transp. Sci. – volume: 296 start-page: 539 year: 2022 end-page: 556 ident: b9 article-title: Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand publication-title: European J. Oper. Res. – volume: 38 start-page: 399 year: 2004 end-page: 419 ident: b28 article-title: The dynamic assignment problem publication-title: Transp. Sci. – volume: 63 start-page: 1489 year: 2015 end-page: 1511 ident: b20 article-title: An approximate dynamic programming algorithm for monotone value functions publication-title: Oper. Res. – volume: 128 start-page: 175 year: 2019 end-page: 190 ident: b2 article-title: A dynamic crowdshipping model and daily travel behavior publication-title: Transp. Res. E Logist. Transp. Rev. – volume: 12 year: 2011 ident: b21 article-title: Hierarchical knowledge gradient for sequential sampling publication-title: J. Mach. Learn. Res. – year: 2011 ident: b23 article-title: Approximate Dynamic Programming: Solving the Curses of Dimensionality, Vol. 842 – year: 2018 ident: b24 article-title: Crowd-shipping of small parcels in a physical internet – volume: 273 start-page: 801 year: 2019 end-page: 816 ident: b10 article-title: Collaborative urban transportation: Recent advances in theory and practice publication-title: European J. Oper. Res. – volume: 30 start-page: 90 year: 2018 end-page: 100 ident: b17 article-title: Stochastic last-mile delivery with crowdshipping publication-title: Transp. Res. Proc. – year: 2020 ident: b35 article-title: Walmart introduces express delivery – year: 1999 ident: b36 article-title: Integer and Combinatorial Optimization, Vol. 55 – year: 2021 ident: b11 article-title: Available resources for RAC 2022 – volume: 199 start-page: 103 year: 2012 end-page: 112 ident: b7 article-title: A dynamic vehicle routing problem with multiple delivery routes publication-title: Ann. Oper. Res. – volume: 43 start-page: 178 year: 2009 end-page: 197 ident: b26 article-title: An approximate dynamic programming algorithm for large-scale fleet management: A case application publication-title: Transp. Sci. – volume: 56 start-page: 612 year: 2022 end-page: 630 ident: b22 article-title: Stochastic last-mile delivery with crowd-shipping and mobile depots publication-title: Transp. Sci. – volume: 29 start-page: 2153 year: 2020 end-page: 2174 ident: b14 article-title: Crowdshipping and same-day delivery: Employing in-store customers to deliver online orders publication-title: Prod. Oper. Manag. – volume: 254 start-page: 472 year: 2016 end-page: 480 ident: b5 article-title: The vehicle routing problem with occasional drivers publication-title: European J. Oper. Res. – volume: 30 start-page: 90 year: 2018 ident: 10.1016/j.trb.2024.103027_b17 article-title: Stochastic last-mile delivery with crowdshipping publication-title: Transp. Res. Proc. – year: 2013 ident: 10.1016/j.trb.2024.103027_b8 – volume: 63 start-page: 1489 year: 2015 ident: 10.1016/j.trb.2024.103027_b20 article-title: An approximate dynamic programming algorithm for monotone value functions publication-title: Oper. Res. doi: 10.1287/opre.2015.1425 – volume: 53 start-page: 185 year: 2019 ident: 10.1016/j.trb.2024.103027_b29 article-title: Offline–online approximate dynamic programming for dynamic vehicle routing with stochastic requests publication-title: Transp. Sci. doi: 10.1287/trsc.2017.0767 – volume: 55 start-page: 75 year: 2021 ident: 10.1016/j.trb.2024.103027_b33 article-title: The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times publication-title: Transp. Sci. doi: 10.1287/trsc.2020.1000 – volume: 53 start-page: 1372 year: 2019 ident: 10.1016/j.trb.2024.103027_b39 article-title: Provably high-quality solutions for the meal delivery routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2018.0887 – year: 2021 ident: 10.1016/j.trb.2024.103027_b11 – volume: 9 year: 2008 ident: 10.1016/j.trb.2024.103027_b19 article-title: Value function approximation using multiple aggregation for multiattribute resource management publication-title: J. Mach. Learn. Res. – volume: 273 start-page: 801 year: 2019 ident: 10.1016/j.trb.2024.103027_b10 article-title: Collaborative urban transportation: Recent advances in theory and practice publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.04.037 – volume: 29 start-page: 2153 year: 2020 ident: 10.1016/j.trb.2024.103027_b14 article-title: Crowdshipping and same-day delivery: Employing in-store customers to deliver online orders publication-title: Prod. Oper. Manag. doi: 10.1111/poms.13219 – year: 2020 ident: 10.1016/j.trb.2024.103027_b35 – start-page: 49 year: 2017 ident: 10.1016/j.trb.2024.103027_b12 article-title: The vehicle routing problem with dynamic occasional drivers – volume: 43 start-page: 178 year: 2009 ident: 10.1016/j.trb.2024.103027_b26 article-title: An approximate dynamic programming algorithm for large-scale fleet management: A case application publication-title: Transp. Sci. doi: 10.1287/trsc.1080.0238 – volume: 199 start-page: 103 year: 2012 ident: 10.1016/j.trb.2024.103027_b7 article-title: A dynamic vehicle routing problem with multiple delivery routes publication-title: Ann. Oper. Res. doi: 10.1007/s10479-011-0991-3 – volume: 123 year: 2021 ident: 10.1016/j.trb.2024.103027_b38 article-title: Express package routing problem with occasional couriers publication-title: Trans. Res. Part C: Emerg. Technol. doi: 10.1016/j.trc.2021.102994 – start-page: 261 year: 2020 ident: 10.1016/j.trb.2024.103027_b27 article-title: The multistage stochastic vehicle routing problem with dynamic occasional drivers – year: 2021 ident: 10.1016/j.trb.2024.103027_b4 – volume: 54 start-page: 1113 year: 2020 ident: 10.1016/j.trb.2024.103027_b31 article-title: Workforce scheduling in the era of crowdsourced delivery publication-title: Transp. Sci. doi: 10.1287/trsc.2020.0977 – volume: 6571 year: 2018 ident: 10.1016/j.trb.2024.103027_b25 article-title: The meal delivery routing problem publication-title: Optimization Online – volume: 54 start-page: 229 year: 2020 ident: 10.1016/j.trb.2024.103027_b15 article-title: Same-day delivery with drone resupply publication-title: Transp. Sci. doi: 10.1287/trsc.2019.0944 – volume: 53 start-page: 222 year: 2019 ident: 10.1016/j.trb.2024.103027_b6 article-title: Crowdsourced delivery—a dynamic pickup and delivery problem with ad hoc drivers publication-title: Transp. Sci. doi: 10.1287/trsc.2017.0803 – year: 2018 ident: 10.1016/j.trb.2024.103027_b24 – year: 2021 ident: 10.1016/j.trb.2024.103027_b37 – volume: 98 year: 2021 ident: 10.1016/j.trb.2024.103027_b3 article-title: Crowdsourced delivery: A review of platforms and academic literature publication-title: Omega doi: 10.1016/j.omega.2019.102139 – volume: 296 start-page: 539 year: 2022 ident: 10.1016/j.trb.2024.103027_b9 article-title: Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2021.04.002 – volume: 65 start-page: 167 year: 2006 ident: 10.1016/j.trb.2024.103027_b18 article-title: Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming publication-title: Mach. Learn. doi: 10.1007/s10994-006-8365-9 – volume: 12 year: 2011 ident: 10.1016/j.trb.2024.103027_b21 article-title: Hierarchical knowledge gradient for sequential sampling publication-title: J. Mach. Learn. Res. – year: 2018 ident: 10.1016/j.trb.2024.103027_b16 – volume: 254 start-page: 472 year: 2016 ident: 10.1016/j.trb.2024.103027_b5 article-title: The vehicle routing problem with occasional drivers publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2016.03.049 – volume: 56 start-page: 612 year: 2022 ident: 10.1016/j.trb.2024.103027_b22 article-title: Stochastic last-mile delivery with crowd-shipping and mobile depots publication-title: Transp. Sci. doi: 10.1287/trsc.2021.1088 – volume: 38 start-page: 399 year: 2004 ident: 10.1016/j.trb.2024.103027_b28 article-title: The dynamic assignment problem publication-title: Transp. Sci. doi: 10.1287/trsc.1030.0073 – volume: 9 year: 2020 ident: 10.1016/j.trb.2024.103027_b30 article-title: On modeling stochastic dynamic vehicle routing problems publication-title: European J. Oper. Res. – volume: 284 start-page: 1088 year: 2020 ident: 10.1016/j.trb.2024.103027_b1 article-title: Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.01.033 – volume: 109 start-page: 122 year: 2019 ident: 10.1016/j.trb.2024.103027_b13 article-title: The pickup and delivery problem with time windows and occasional drivers publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.04.023 – year: 2019 ident: 10.1016/j.trb.2024.103027_b40 – year: 2011 ident: 10.1016/j.trb.2024.103027_b23 – volume: 53 start-page: 167 year: 2019 ident: 10.1016/j.trb.2024.103027_b34 article-title: The same-day delivery problem for online purchases publication-title: Transp. Sci. doi: 10.1287/trsc.2016.0732 – year: 1999 ident: 10.1016/j.trb.2024.103027_b36 – volume: 128 start-page: 175 year: 2019 ident: 10.1016/j.trb.2024.103027_b2 article-title: A dynamic crowdshipping model and daily travel behavior publication-title: Transp. Res. E Logist. Transp. Rev. doi: 10.1016/j.tre.2019.06.002 – volume: 72 start-page: 475 year: 2018 ident: 10.1016/j.trb.2024.103027_b32 article-title: Same-day delivery with heterogeneous fleets of drones and vehicles publication-title: Networks doi: 10.1002/net.21855 |
| SSID | ssj0003401 |
| Score | 2.4525585 |
| Snippet | We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 103027 |
| SubjectTerms | Approximate dynamic programming Crowd-shipping Last-mile delivery Markov decision process Value function approximation |
| Title | Approximate dynamic programming for pickup and delivery problem with crowd-shipping |
| URI | https://dx.doi.org/10.1016/j.trb.2024.103027 |
| Volume | 187 |
| WOSCitedRecordID | wos001284561400001&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0191-2615 databaseCode: AIEXJ dateStart: 20220201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0003401 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0191-2615 databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0003401 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9RAFB50K6gPolWxamUefHLJkmQmm53HrbS0hRaxFfYtzC10tzUbdpOy_nvP3NK0VFHBl5CEnclyzsecy3xzDkIfdcKEMUvRJBlrCFB4HHHK00hB-KGIIfGk3DabyE9PJ7MZ--JzumvbTiCvqslmw-r_qmp4B8o2R2f_Qt3dpPAC7kHpcAW1w_WPFD81VcI3c_BE9VC5fvOBhfU90Cbrubxsa7txoPSVoWb8GPrWMp6MDtG5igyTqw62bdEzbtZpt8jxxYIuRuCLrprhnskwuK7UYVXtVLps1_zakQcAk_DUZaL3lqq1yDkx_MtuWwRstl2rT1rJL-YdP-frEgJm7g4a2Wblw-NRP3mR0o6d5TNq4VTNDYXJJjlZEkFkl91epfN7V3yXfFiMmpUYmS-YKgKxKzdwp5D2mZnXTGtos-DojB-irTTP2GSAtqZH-7PjzoITGvs-lu5_hN1wywu886H7_Zmej3L-HD3zwQWeOlC8QA90tY0eh7Pn6230tFd-8iU660EFe6jgHlQwQAU7qGCACg5QwR4q2EAF34bKK_TtYP_882Hkm2xEkuSkiZQoqRAkllyYHfNYZlqVeVaqpOSKKgmLNhnzVCqiWKyoJnxMEw2myfQxUISR12hQLSv9BmFClUgUxLQwiiZxLrQgmUhzkXDKFCt3UBxEVUhfgd40QrkqAtVwUYB0CyPdwkl3B33qhtSu_MrvfkyD_AvvPzq_sACw_HrY238b9g49uUH0ezRoVq3eRY_kdTNfrz54SP0ENdmXkw |
| linkProvider | Elsevier |
| 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=Approximate+dynamic+programming+for+pickup+and+delivery+problem+with+crowd-shipping&rft.jtitle=Transportation+research.+Part+B%3A+methodological&rft.au=Mousavi%2C+Kianoush&rft.au=Bodur%2C+Merve&rft.au=Cevik%2C+Mucahit&rft.au=Roorda%2C+Matthew+J.&rft.date=2024-09-01&rft.pub=Elsevier+Ltd&rft.issn=0191-2615&rft.volume=187&rft_id=info:doi/10.1016%2Fj.trb.2024.103027&rft.externalDocID=S0191261524001516 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2615&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2615&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2615&client=summon |