An Integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup
This paper addresses an exact algorithm for vehicle routing problem with simultaneous pickup and delivery in which customer demands to be collected are stochastic. The problem is modeled as a two-stage stochastic programming problem with recourse, in which routing decisions are made based on known d...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 154; s. 106201 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.06.2023
|
| Témata: | |
| ISSN: | 0305-0548, 1873-765X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper addresses an exact algorithm for vehicle routing problem with simultaneous pickup and delivery in which customer demands to be collected are stochastic. The problem is modeled as a two-stage stochastic programming problem with recourse, in which routing decisions are made based on known delivery demand and deterministic expected pickup demand in the first stage and recourse actions are made in the second stage when stochastic pickup quantities have been revealed. However, failures happen when the load of the vehicle is insufficient to meet the observed pickup demand of a customer. Three recourse policies are proposed to help deal with the failures to proceed with the routing decisions in the first stage. The Integer L-shaped algorithmic framework is used to solve this two-stage stochastic programming problems with recourse. Furthermore, effective lower bounding of the expected recourse cost of partial routes is designed for the three recourse policies, respectively. Computational experiments on the newly generated instances compare the performance of the Integer L-shaped algorithm under the three recourse policies, and the conclusion is validated via numerous simulations. The effectiveness of the proposed lower bounding functionals is confirmed through reduced optimality gaps and lower computing times.
•Solve the vehicle routing problem with simultaneous delivery and stochastic pickup.•Propose Integer L-shaped algorithm to solve this stochastic problem with recourse.•Develop three recourse policies to deal with the failure of vehicle capacity.•Design lower bounds of expected recourse cost for partial routes.•Compare the performance of different recourse policies with interesting analyses. |
|---|---|
| AbstractList | This paper addresses an exact algorithm for vehicle routing problem with simultaneous pickup and delivery in which customer demands to be collected are stochastic. The problem is modeled as a two-stage stochastic programming problem with recourse, in which routing decisions are made based on known delivery demand and deterministic expected pickup demand in the first stage and recourse actions are made in the second stage when stochastic pickup quantities have been revealed. However, failures happen when the load of the vehicle is insufficient to meet the observed pickup demand of a customer. Three recourse policies are proposed to help deal with the failures to proceed with the routing decisions in the first stage. The Integer L-shaped algorithmic framework is used to solve this two-stage stochastic programming problems with recourse. Furthermore, effective lower bounding of the expected recourse cost of partial routes is designed for the three recourse policies, respectively. Computational experiments on the newly generated instances compare the performance of the Integer L-shaped algorithm under the three recourse policies, and the conclusion is validated via numerous simulations. The effectiveness of the proposed lower bounding functionals is confirmed through reduced optimality gaps and lower computing times.
•Solve the vehicle routing problem with simultaneous delivery and stochastic pickup.•Propose Integer L-shaped algorithm to solve this stochastic problem with recourse.•Develop three recourse policies to deal with the failure of vehicle capacity.•Design lower bounds of expected recourse cost for partial routes.•Compare the performance of different recourse policies with interesting analyses. |
| ArticleNumber | 106201 |
| Author | Zhang, Zhenzhen Che, Yuxin |
| Author_xml | – sequence: 1 givenname: Yuxin surname: Che fullname: Che, Yuxin email: jesmineche@gmail.com organization: Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore – sequence: 2 givenname: Zhenzhen orcidid: 0000-0001-9776-8355 surname: Zhang fullname: Zhang, Zhenzhen email: zhenzhenzhang222@gmail.com organization: School of Economics and Management, Tongji University, Shanghai 200092, China |
| BookMark | eNp9kMtqwzAQRUVpoUnaD-hOP-BUj9iy6SqEPgKBblroTsjyOJZrS0aSU_L3dUhXXWQ2w8CcC_fM0bV1FhB6oGRJCc0e26V2fskI49OdMUKv0IzmgiciS7-u0YxwkiYkXeW3aB5CS6YRjM5Qu7Z4ayPsweNdEho1QIVVt3fexKbHtfP4AI3RHWDvxmjsHg_elR30-Gf6wMH0YxeVBTcGXEFnDuCPWNkKh-h0o0I0Gg9Gf4_DHbqpVRfg_m8v0OfL88fmLdm9v243612iWSFiUquc85KUPKt1nipFC8GZzipW0KwghNWVTqHiAAVNC02gFHmerfSKcsXzWpR8geg5V3sXgodaDt70yh8lJfIkS7ZykiVPsuRZ1sSIf4w2UUXjbPTKdBfJpzMJU6WDAS-DNmA1VMaDjrJy5gL9C_m6iFY |
| CitedBy_id | crossref_primary_10_29109_gujsc_1374303 crossref_primary_10_3390_su16041698 crossref_primary_10_1016_j_ejor_2025_05_006 |
| Cites_doi | 10.1023/A:1025605803490 10.1007/PL00013346 10.1287/mnsc.6.1.80 10.1007/s11590-012-0570-9 10.1016/j.jclepro.2016.03.126 10.1016/j.cor.2014.03.028 10.1287/opre.50.3.415.7751 10.1016/j.cie.2012.01.005 10.1287/trsc.1090.0295 10.1016/j.orl.2011.06.012 10.1007/s10878-007-9090-4 10.1007/s11590-012-0555-8 10.1016/j.ejor.2015.02.038 10.1016/j.cor.2018.06.012 10.1016/j.ejor.2018.05.049 10.1287/trsc.2015.0591 10.1287/trsc.2017.0780 10.1016/j.asoc.2013.01.007 10.1287/trsc.1050.0118 10.1051/ro/2017007 10.1287/opre.1080.0520 10.1287/trsc.2014.0524 10.1007/s00500-017-2535-5 10.1016/j.cor.2011.11.021 10.1016/j.ejor.2013.04.044 10.1016/j.ejor.2009.05.015 10.1023/A:1018995927636 10.1016/j.jclepro.2018.11.187 10.1016/0167-6377(93)90002-X 10.1287/trsc.2017.0778 10.1016/j.dam.2014.05.040 10.1016/j.trc.2015.01.010 10.1016/j.cie.2011.08.018 10.1016/j.cor.2009.06.015 10.1016/j.cor.2004.07.009 10.1007/s10732-015-9281-6 10.1016/j.cor.2018.10.020 10.1016/j.cor.2020.104987 10.1016/j.eswa.2016.01.038 10.1016/j.orl.2006.12.009 10.1016/j.ejor.2013.05.050 10.1287/trsc.2018.0876 10.1007/BF03342743 10.1007/s13676-018-0126-y 10.1016/j.ejor.2013.09.045 10.1287/trsc.34.1.99.12278 10.1016/j.ejor.2018.07.039 10.1007/s00500-020-05408-3 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Ltd |
| Copyright_xml | – notice: 2023 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cor.2023.106201 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X |
| ExternalDocumentID | 10_1016_j_cor_2023_106201 S0305054823000655 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-fa833b0b36fc85aa19732c6d29169002fdc5ed3ee9159c0eb78864c413a38f7b3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000951245700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Nov 29 07:24:08 EST 2025 Tue Nov 18 22:33:27 EST 2025 Fri Feb 23 02:37:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Routing Simultaneous delivery and stochastic pickup Recourse policy Integer L-shaped algorithm Stochastic programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-fa833b0b36fc85aa19732c6d29169002fdc5ed3ee9159c0eb78864c413a38f7b3 |
| ORCID | 0000-0001-9776-8355 |
| ParticipantIDs | crossref_primary_10_1016_j_cor_2023_106201 crossref_citationtrail_10_1016_j_cor_2023_106201 elsevier_sciencedirect_doi_10_1016_j_cor_2023_106201 |
| PublicationCentury | 2000 |
| PublicationDate | June 2023 2023-06-00 |
| PublicationDateYYYYMMDD | 2023-06-01 |
| PublicationDate_xml | – month: 06 year: 2023 text: June 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2023 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Koç, Laporte, Tükenmez (b17) 2020; 122 Mendoza, Villegas (b28) 2013; 7 Zhu, Sheu (b52) 2018; 271 Montané, Galvão (b29) 2006; 33 Goodson, Thomas, Ohlmann (b11) 2016; 50 Govindan, Soleimani (b12) 2017; 142 Pandelis, Karamatsoukis, Kyriakidis (b30) 2013; 231 De La Vega, J., Gendreau, M., Morabito, R., Munari, P., 2020. An Integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands. Working Paper, pp. 1–34. Subramanian, Uchoa, Pessoa, Ochi (b41) 2011; 39 Secomandi, Margot (b40) 2009; 57 Prajapati, Kant, Shankar (b32) 2019; 211 Salavati-Khoshghalb, Gendreau, Jabali, Rei (b38) 2019; 273 Majidi, Hosseini-Motlagh, Yaghoubi, Jokar (b24) 2017; 51 Subramanian, Uchoa, Pessoa, Ochi (b42) 2013; 7 Wollenberg (b46) 2015 Vidal, Crainic, Gendreau, Prins (b43) 2014; 234 Avci, Topaloglu (b1) 2016; 53 Louveaux, Salazar-González (b22) 2018; 52 Dantzig, Ramser (b4) 1959; 6 Zhang, Cheang, Li, Lim (b50) 2019; 103 Mendoza, Rousseau, Villegas (b27) 2016; 22 Wassan, Wassan, Nagy (b45) 2008; 15 Secomandi (b39) 2003; 9 Koulaeian, Seidgar, Kiani, Fazlollahtabar (b18) 2015; 22 Christiansen, Lysgaard (b3) 2007; 35 Zachariadis, Tarantilis, Kiranoudis (b48) 2010; 202 Biesinger, Hu, Raidl (b2) 2018; 52 Laporte, Louveaux (b19) 1993; 13 Marinakis, Iordanidou, Marinaki (b25) 2013; 13 Majidi, Hosseini-Motlagh, Ignatius (b23) 2018; 22 Wang, Chen (b44) 2012; 62 Yang, Mathur, Ballou (b47) 2000; 34 Zhang, Chen, Zhang, Cai (b51) 2020; 25 Hjorring, Holt (b14) 1999; 86 Hu, Sheu, Zhao, Lu (b15) 2015; 55 Gendreau, Jabali, Rei (b10) 2014 Pinar, Karaoglan, Altiparmak (b31) 2013; 65 Rei, Gendreau, Soriano (b34) 2010; 44 Zhang, Chaovalitwongse, Zhang (b49) 2012; 39 Dell’Amico, Righini, Salani (b6) 2006; 40 Mendoza, Castanier, Guéret, Medaglia, Velasco (b26) 2010; 37 Dimitrakos, Kyriakidis (b8) 2015; 244 Gutierrez, Dieulle, Labadie, Velasco (b13) 2018; 99 Rieck, Zimmermann (b35) 2013; 6 Qu, Bard (b33) 2015; 49 Salavati-Khoshghalb, Gendreau, Jabali, Rei (b37) 2019; 53 Salavati-Khoshghalb, Gendreau, Jabali, Rei (b36) 2019; 8 Laporte, Louveaux, van Hamme (b20) 2002; 50 Gauvin, Desaulniers, Gendreau (b9) 2014; 50 Jabali, Rei, Gendreau, Laporte (b16) 2014; 177 Liu, Xie, Augusto, Rodriguez (b21) 2013; 230 Dethloff (b7) 2001; 23 Liu (10.1016/j.cor.2023.106201_b21) 2013; 230 Salavati-Khoshghalb (10.1016/j.cor.2023.106201_b37) 2019; 53 Mendoza (10.1016/j.cor.2023.106201_b27) 2016; 22 Christiansen (10.1016/j.cor.2023.106201_b3) 2007; 35 Mendoza (10.1016/j.cor.2023.106201_b26) 2010; 37 Zhu (10.1016/j.cor.2023.106201_b52) 2018; 271 Dell’Amico (10.1016/j.cor.2023.106201_b6) 2006; 40 Louveaux (10.1016/j.cor.2023.106201_b22) 2018; 52 Prajapati (10.1016/j.cor.2023.106201_b32) 2019; 211 Zhang (10.1016/j.cor.2023.106201_b49) 2012; 39 Salavati-Khoshghalb (10.1016/j.cor.2023.106201_b38) 2019; 273 Govindan (10.1016/j.cor.2023.106201_b12) 2017; 142 Laporte (10.1016/j.cor.2023.106201_b19) 1993; 13 Gendreau (10.1016/j.cor.2023.106201_b10) 2014 Secomandi (10.1016/j.cor.2023.106201_b40) 2009; 57 Hjorring (10.1016/j.cor.2023.106201_b14) 1999; 86 Koç (10.1016/j.cor.2023.106201_b17) 2020; 122 Vidal (10.1016/j.cor.2023.106201_b43) 2014; 234 Dimitrakos (10.1016/j.cor.2023.106201_b8) 2015; 244 Zhang (10.1016/j.cor.2023.106201_b51) 2020; 25 Montané (10.1016/j.cor.2023.106201_b29) 2006; 33 Dethloff (10.1016/j.cor.2023.106201_b7) 2001; 23 Mendoza (10.1016/j.cor.2023.106201_b28) 2013; 7 Avci (10.1016/j.cor.2023.106201_b1) 2016; 53 Secomandi (10.1016/j.cor.2023.106201_b39) 2003; 9 Wang (10.1016/j.cor.2023.106201_b44) 2012; 62 Pandelis (10.1016/j.cor.2023.106201_b30) 2013; 231 Gauvin (10.1016/j.cor.2023.106201_b9) 2014; 50 Subramanian (10.1016/j.cor.2023.106201_b41) 2011; 39 Zhang (10.1016/j.cor.2023.106201_b50) 2019; 103 Salavati-Khoshghalb (10.1016/j.cor.2023.106201_b36) 2019; 8 Goodson (10.1016/j.cor.2023.106201_b11) 2016; 50 Qu (10.1016/j.cor.2023.106201_b33) 2015; 49 Hu (10.1016/j.cor.2023.106201_b15) 2015; 55 Yang (10.1016/j.cor.2023.106201_b47) 2000; 34 Jabali (10.1016/j.cor.2023.106201_b16) 2014; 177 Rieck (10.1016/j.cor.2023.106201_b35) 2013; 6 Subramanian (10.1016/j.cor.2023.106201_b42) 2013; 7 10.1016/j.cor.2023.106201_b5 Pinar (10.1016/j.cor.2023.106201_b31) 2013; 65 Laporte (10.1016/j.cor.2023.106201_b20) 2002; 50 Zachariadis (10.1016/j.cor.2023.106201_b48) 2010; 202 Rei (10.1016/j.cor.2023.106201_b34) 2010; 44 Gutierrez (10.1016/j.cor.2023.106201_b13) 2018; 99 Wassan (10.1016/j.cor.2023.106201_b45) 2008; 15 Koulaeian (10.1016/j.cor.2023.106201_b18) 2015; 22 Biesinger (10.1016/j.cor.2023.106201_b2) 2018; 52 Dantzig (10.1016/j.cor.2023.106201_b4) 1959; 6 Majidi (10.1016/j.cor.2023.106201_b24) 2017; 51 Majidi (10.1016/j.cor.2023.106201_b23) 2018; 22 Wollenberg (10.1016/j.cor.2023.106201_b46) 2015 Marinakis (10.1016/j.cor.2023.106201_b25) 2013; 13 |
| References_xml | – volume: 35 start-page: 773 year: 2007 end-page: 781 ident: b3 article-title: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Oper. Res. Lett. – volume: 244 start-page: 990 year: 2015 end-page: 993 ident: b8 article-title: A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order publication-title: European J. Oper. Res. – volume: 39 start-page: 338 year: 2011 end-page: 341 ident: b41 article-title: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery publication-title: Oper. Res. Lett. – volume: 231 start-page: 577 year: 2013 end-page: 586 ident: b30 article-title: Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery publication-title: European J. Oper. Res. – volume: 211 start-page: 503 year: 2019 end-page: 520 ident: b32 article-title: Bequeath life to death: State-of-art review on reverse logistics publication-title: J. Clean. Prod. – volume: 65 start-page: 39 year: 2013 end-page: 53 ident: b31 article-title: A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery publication-title: Comput. Ind. Eng. – volume: 6 start-page: 80 year: 1959 end-page: 91 ident: b4 article-title: The truck dispatching problem publication-title: Manage. Sci. – volume: 99 start-page: 135 year: 2018 end-page: 147 ident: b13 article-title: A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. – volume: 50 start-page: 415 year: 2002 end-page: 423 ident: b20 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Oper. Res. – volume: 25 start-page: 3795 year: 2020 end-page: 3812 ident: b51 article-title: Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery publication-title: Soft Comput. – volume: 86 start-page: 569 year: 1999 end-page: 584 ident: b14 article-title: New optimality cuts for a single-vehicle stochastic routing problem publication-title: Ann. Oper. Res. – volume: 7 start-page: 1569 year: 2013 end-page: 1581 ident: b42 article-title: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery publication-title: Optim. Lett. – volume: 23 start-page: 79 year: 2001 end-page: 96 ident: b7 article-title: Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up publication-title: OR Spektrum – volume: 44 start-page: 136 year: 2010 end-page: 146 ident: b34 article-title: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands publication-title: Transp. Sci. – volume: 37 start-page: 1886 year: 2010 end-page: 1898 ident: b26 article-title: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. – volume: 40 start-page: 235 year: 2006 end-page: 247 ident: b6 article-title: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection publication-title: Transp. Sci. – volume: 57 start-page: 214 year: 2009 end-page: 230 ident: b40 article-title: Reoptimization approaches for the vehicle-routing problem with stochastic demands publication-title: Oper. Res. – volume: 50 start-page: 141 year: 2014 end-page: 153 ident: b9 article-title: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. – volume: 273 start-page: 175 year: 2019 end-page: 189 ident: b38 article-title: An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy publication-title: European J. Oper. Res. – volume: 34 start-page: 99 year: 2000 end-page: 112 ident: b47 article-title: Stochastic vehicle routing problem with restocking publication-title: Transp. Sci. – volume: 271 start-page: 896 year: 2018 end-page: 912 ident: b52 article-title: Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands publication-title: European J. Oper. Res. – reference: De La Vega, J., Gendreau, M., Morabito, R., Munari, P., 2020. An Integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands. Working Paper, pp. 1–34. – volume: 62 start-page: 84 year: 2012 end-page: 95 ident: b44 article-title: A genetic algorithm for the simultaneous delivery and pickup problems with time window publication-title: Comput. Ind. Eng. – volume: 9 start-page: 321 year: 2003 end-page: 352 ident: b39 article-title: Analysis of a rollout approach to sequencing problems with stochastic routing applications publication-title: J. Heuristics – volume: 6 start-page: 77 year: 2013 end-page: 92 ident: b35 article-title: Exact solutions to the symmetric and asymmetric vehicle routing problem with simultaneous delivery and pick-up publication-title: Bus. Res. – volume: 142 start-page: 371 year: 2017 end-page: 384 ident: b12 article-title: A review of reverse logistics and closed-loop supply chains: a Journal of Cleaner Production focus publication-title: J. Clean. Prod. – volume: 22 start-page: 539 year: 2016 end-page: 566 ident: b27 article-title: A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints publication-title: J. Heuristics – volume: 55 start-page: 273 year: 2015 end-page: 297 ident: b15 article-title: A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods publication-title: Transp. Res. C – volume: 39 start-page: 2277 year: 2012 end-page: 2290 ident: b49 article-title: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries publication-title: Comput. Oper. Res. – volume: 13 start-page: 1693 year: 2013 end-page: 1704 ident: b25 article-title: Particle Swarm Optimization for the vehicle routing problem with stochastic demands publication-title: Appl. Soft Comput. – volume: 7 start-page: 1503 year: 2013 end-page: 1516 ident: b28 article-title: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands publication-title: Optim. Lett. – volume: 234 start-page: 658 year: 2014 end-page: 673 ident: b43 article-title: A unified solution framework for multi-attribute vehicle routing problems publication-title: European J. Oper. Res. – volume: 22 start-page: 2851 year: 2018 end-page: 2865 ident: b23 article-title: Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery publication-title: Soft Comput. – volume: 22 start-page: 294 year: 2015 end-page: 313 ident: b18 article-title: A multi depot simultaneous pickup and delivery problem with balanced allocation of routes to drivers publication-title: Int. J. Ind. Eng. – volume: 53 start-page: 160 year: 2016 end-page: 171 ident: b1 article-title: A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery publication-title: Expert Syst. Appl. – volume: 8 start-page: 269 year: 2019 end-page: 298 ident: b36 article-title: A hybrid recourse policy for the vehicle routing problem with stochastic demands publication-title: EURO J. Transp. Logist. – volume: 52 start-page: 673 year: 2018 end-page: 690 ident: b2 article-title: A genetic algorithm in combination with a solution archive for solving the generalized vehicle routing problem with stochastic demands publication-title: Transp. Sci. – volume: 53 start-page: 1334 year: 2019 end-page: 1353 ident: b37 article-title: A Rule-based recourse for the vehicle routing problem with stochastic demands publication-title: Transp. Sci. – volume: 50 start-page: 591 year: 2016 end-page: 607 ident: b11 article-title: Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits publication-title: Transp. Sci. – volume: 122 year: 2020 ident: b17 article-title: A review of vehicle routing with simultaneous pickup and delivery publication-title: Comput. Oper. Res. – year: 2015 ident: b46 article-title: Decision making under uncertainty in routing problems for reverse logistics – volume: 33 start-page: 595 year: 2006 end-page: 619 ident: b29 article-title: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service publication-title: Comput. Oper. Res. – volume: 52 start-page: 1463 year: 2018 end-page: 1478 ident: b22 article-title: Exact approach for the vehicle routing problem with stochastic demands and preventive returns publication-title: Transp. Sci. – volume: 177 start-page: 121 year: 2014 end-page: 136 ident: b16 article-title: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands publication-title: Discrete Appl. Math. – volume: 202 start-page: 401 year: 2010 end-page: 411 ident: b48 article-title: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries publication-title: European J. Oper. Res. – volume: 13 start-page: 133 year: 1993 end-page: 142 ident: b19 article-title: The integer L-shaped method for stochastic integer programs with complete recourse publication-title: Oper. Res. Lett. – volume: 51 start-page: 1151 year: 2017 end-page: 1176 ident: b24 article-title: Fuzzy green vehicle routing problem with simultaneous pickup–delivery and time windows publication-title: RAIRO-Oper. Res. – start-page: 213 year: 2014 end-page: 239 ident: b10 article-title: Chapter 8: Stochastic vehicle routing problems publication-title: Vehicle Routing: Problems, Methods, and Applications, Second Edition – volume: 230 start-page: 475 year: 2013 end-page: 486 ident: b21 article-title: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care publication-title: European J. Oper. Res. – volume: 15 start-page: 368 year: 2008 end-page: 386 ident: b45 article-title: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries publication-title: J. Comb. Optim. – volume: 103 start-page: 81 year: 2019 end-page: 96 ident: b50 article-title: Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer publication-title: Comput. Oper. Res. – volume: 49 start-page: 254 year: 2015 end-page: 270 ident: b33 article-title: A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity publication-title: Transp. Sci. – volume: 9 start-page: 321 issue: 4 year: 2003 ident: 10.1016/j.cor.2023.106201_b39 article-title: Analysis of a rollout approach to sequencing problems with stochastic routing applications publication-title: J. Heuristics doi: 10.1023/A:1025605803490 – year: 2015 ident: 10.1016/j.cor.2023.106201_b46 – volume: 23 start-page: 79 issue: 1 year: 2001 ident: 10.1016/j.cor.2023.106201_b7 article-title: Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up publication-title: OR Spektrum doi: 10.1007/PL00013346 – volume: 6 start-page: 80 issue: 1 year: 1959 ident: 10.1016/j.cor.2023.106201_b4 article-title: The truck dispatching problem publication-title: Manage. Sci. doi: 10.1287/mnsc.6.1.80 – volume: 7 start-page: 1569 issue: 7 year: 2013 ident: 10.1016/j.cor.2023.106201_b42 article-title: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery publication-title: Optim. Lett. doi: 10.1007/s11590-012-0570-9 – volume: 142 start-page: 371 year: 2017 ident: 10.1016/j.cor.2023.106201_b12 article-title: A review of reverse logistics and closed-loop supply chains: a Journal of Cleaner Production focus publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2016.03.126 – volume: 50 start-page: 141 year: 2014 ident: 10.1016/j.cor.2023.106201_b9 article-title: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.03.028 – volume: 50 start-page: 415 issue: 3 year: 2002 ident: 10.1016/j.cor.2023.106201_b20 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Oper. Res. doi: 10.1287/opre.50.3.415.7751 – volume: 65 start-page: 39 issue: 1 year: 2013 ident: 10.1016/j.cor.2023.106201_b31 article-title: A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2012.01.005 – volume: 44 start-page: 136 issue: 1 year: 2010 ident: 10.1016/j.cor.2023.106201_b34 article-title: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands publication-title: Transp. Sci. doi: 10.1287/trsc.1090.0295 – volume: 39 start-page: 338 issue: 5 year: 2011 ident: 10.1016/j.cor.2023.106201_b41 article-title: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2011.06.012 – volume: 15 start-page: 368 issue: 4 year: 2008 ident: 10.1016/j.cor.2023.106201_b45 article-title: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries publication-title: J. Comb. Optim. doi: 10.1007/s10878-007-9090-4 – volume: 7 start-page: 1503 issue: 7 year: 2013 ident: 10.1016/j.cor.2023.106201_b28 article-title: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands publication-title: Optim. Lett. doi: 10.1007/s11590-012-0555-8 – volume: 244 start-page: 990 issue: 3 year: 2015 ident: 10.1016/j.cor.2023.106201_b8 article-title: A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2015.02.038 – volume: 99 start-page: 135 year: 2018 ident: 10.1016/j.cor.2023.106201_b13 article-title: A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.06.012 – volume: 271 start-page: 896 issue: 3 year: 2018 ident: 10.1016/j.cor.2023.106201_b52 article-title: Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.05.049 – volume: 50 start-page: 591 issue: 2 year: 2016 ident: 10.1016/j.cor.2023.106201_b11 article-title: Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits publication-title: Transp. Sci. doi: 10.1287/trsc.2015.0591 – volume: 52 start-page: 1463 issue: 6 year: 2018 ident: 10.1016/j.cor.2023.106201_b22 article-title: Exact approach for the vehicle routing problem with stochastic demands and preventive returns publication-title: Transp. Sci. doi: 10.1287/trsc.2017.0780 – volume: 13 start-page: 1693 issue: 4 year: 2013 ident: 10.1016/j.cor.2023.106201_b25 article-title: Particle Swarm Optimization for the vehicle routing problem with stochastic demands publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2013.01.007 – volume: 40 start-page: 235 issue: 2 year: 2006 ident: 10.1016/j.cor.2023.106201_b6 article-title: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection publication-title: Transp. Sci. doi: 10.1287/trsc.1050.0118 – ident: 10.1016/j.cor.2023.106201_b5 – volume: 51 start-page: 1151 issue: 4 year: 2017 ident: 10.1016/j.cor.2023.106201_b24 article-title: Fuzzy green vehicle routing problem with simultaneous pickup–delivery and time windows publication-title: RAIRO-Oper. Res. doi: 10.1051/ro/2017007 – volume: 57 start-page: 214 issue: 1 year: 2009 ident: 10.1016/j.cor.2023.106201_b40 article-title: Reoptimization approaches for the vehicle-routing problem with stochastic demands publication-title: Oper. Res. doi: 10.1287/opre.1080.0520 – start-page: 213 year: 2014 ident: 10.1016/j.cor.2023.106201_b10 article-title: Chapter 8: Stochastic vehicle routing problems – volume: 49 start-page: 254 issue: 2 year: 2015 ident: 10.1016/j.cor.2023.106201_b33 article-title: A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity publication-title: Transp. Sci. doi: 10.1287/trsc.2014.0524 – volume: 22 start-page: 2851 issue: 9 year: 2018 ident: 10.1016/j.cor.2023.106201_b23 article-title: Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery publication-title: Soft Comput. doi: 10.1007/s00500-017-2535-5 – volume: 39 start-page: 2277 issue: 10 year: 2012 ident: 10.1016/j.cor.2023.106201_b49 article-title: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.11.021 – volume: 230 start-page: 475 issue: 3 year: 2013 ident: 10.1016/j.cor.2023.106201_b21 article-title: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.04.044 – volume: 202 start-page: 401 issue: 2 year: 2010 ident: 10.1016/j.cor.2023.106201_b48 article-title: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2009.05.015 – volume: 86 start-page: 569 year: 1999 ident: 10.1016/j.cor.2023.106201_b14 article-title: New optimality cuts for a single-vehicle stochastic routing problem publication-title: Ann. Oper. Res. doi: 10.1023/A:1018995927636 – volume: 211 start-page: 503 year: 2019 ident: 10.1016/j.cor.2023.106201_b32 article-title: Bequeath life to death: State-of-art review on reverse logistics publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2018.11.187 – volume: 13 start-page: 133 issue: 3 year: 1993 ident: 10.1016/j.cor.2023.106201_b19 article-title: The integer L-shaped method for stochastic integer programs with complete recourse publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(93)90002-X – volume: 52 start-page: 673 year: 2018 ident: 10.1016/j.cor.2023.106201_b2 article-title: A genetic algorithm in combination with a solution archive for solving the generalized vehicle routing problem with stochastic demands publication-title: Transp. Sci. doi: 10.1287/trsc.2017.0778 – volume: 177 start-page: 121 year: 2014 ident: 10.1016/j.cor.2023.106201_b16 article-title: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2014.05.040 – volume: 55 start-page: 273 year: 2015 ident: 10.1016/j.cor.2023.106201_b15 article-title: A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods publication-title: Transp. Res. C doi: 10.1016/j.trc.2015.01.010 – volume: 62 start-page: 84 issue: 1 year: 2012 ident: 10.1016/j.cor.2023.106201_b44 article-title: A genetic algorithm for the simultaneous delivery and pickup problems with time window publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2011.08.018 – volume: 22 start-page: 294 issue: 2 year: 2015 ident: 10.1016/j.cor.2023.106201_b18 article-title: A multi depot simultaneous pickup and delivery problem with balanced allocation of routes to drivers publication-title: Int. J. Ind. Eng. – volume: 37 start-page: 1886 issue: 11 year: 2010 ident: 10.1016/j.cor.2023.106201_b26 article-title: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.06.015 – volume: 33 start-page: 595 issue: 3 year: 2006 ident: 10.1016/j.cor.2023.106201_b29 article-title: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2004.07.009 – volume: 22 start-page: 539 issue: 4 year: 2016 ident: 10.1016/j.cor.2023.106201_b27 article-title: A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints publication-title: J. Heuristics doi: 10.1007/s10732-015-9281-6 – volume: 103 start-page: 81 year: 2019 ident: 10.1016/j.cor.2023.106201_b50 article-title: Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.10.020 – volume: 122 year: 2020 ident: 10.1016/j.cor.2023.106201_b17 article-title: A review of vehicle routing with simultaneous pickup and delivery publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.104987 – volume: 53 start-page: 160 year: 2016 ident: 10.1016/j.cor.2023.106201_b1 article-title: A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2016.01.038 – volume: 35 start-page: 773 issue: 6 year: 2007 ident: 10.1016/j.cor.2023.106201_b3 article-title: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2006.12.009 – volume: 231 start-page: 577 issue: 3 year: 2013 ident: 10.1016/j.cor.2023.106201_b30 article-title: Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.05.050 – volume: 53 start-page: 1334 issue: 5 year: 2019 ident: 10.1016/j.cor.2023.106201_b37 article-title: A Rule-based recourse for the vehicle routing problem with stochastic demands publication-title: Transp. Sci. doi: 10.1287/trsc.2018.0876 – volume: 6 start-page: 77 issue: 1 year: 2013 ident: 10.1016/j.cor.2023.106201_b35 article-title: Exact solutions to the symmetric and asymmetric vehicle routing problem with simultaneous delivery and pick-up publication-title: Bus. Res. doi: 10.1007/BF03342743 – volume: 8 start-page: 269 issue: 3 year: 2019 ident: 10.1016/j.cor.2023.106201_b36 article-title: A hybrid recourse policy for the vehicle routing problem with stochastic demands publication-title: EURO J. Transp. Logist. doi: 10.1007/s13676-018-0126-y – volume: 234 start-page: 658 issue: 3 year: 2014 ident: 10.1016/j.cor.2023.106201_b43 article-title: A unified solution framework for multi-attribute vehicle routing problems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.09.045 – volume: 34 start-page: 99 issue: 1 year: 2000 ident: 10.1016/j.cor.2023.106201_b47 article-title: Stochastic vehicle routing problem with restocking publication-title: Transp. Sci. doi: 10.1287/trsc.34.1.99.12278 – volume: 273 start-page: 175 issue: 1 year: 2019 ident: 10.1016/j.cor.2023.106201_b38 article-title: An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2018.07.039 – volume: 25 start-page: 3795 issue: 5 year: 2020 ident: 10.1016/j.cor.2023.106201_b51 article-title: Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery publication-title: Soft Comput. doi: 10.1007/s00500-020-05408-3 |
| SSID | ssj0000721 |
| Score | 2.4165864 |
| Snippet | This paper addresses an exact algorithm for vehicle routing problem with simultaneous pickup and delivery in which customer demands to be collected are... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106201 |
| SubjectTerms | Integer L-shaped algorithm Recourse policy Routing Simultaneous delivery and stochastic pickup Stochastic programming |
| Title | An Integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup |
| URI | https://dx.doi.org/10.1016/j.cor.2023.106201 |
| Volume | 154 |
| WOSCitedRecordID | wos000951245700001&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 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1db9MwFLVKh9B44KOANr7kB56YgrJ82XmspiFA08TDkAoPRI7jLCkljdK0qvj1XMfXSRkMsQdeoiqK3cjnxLm-OfeYkFcZY8JN_RzIK5gTiMh1RJjCwjXjEGxwAe-kzjL_jJ2f89ks_jgafbW1MJsFqyq-3cb1f4UazgHYunT2BnD3ncIJ-A2gwxFgh-M_AY9pPl3Ne-asClFDSCkWl8umbIvvnapwowrd6KhZrltTjN5tKoNy9VJrDEWltDY2Uwut2zAeTRAmykJoX-ejupTfMGVlXQ5wd4hVx6VlrRrU2KGbUJ91Pim6FOrn9bbsedlnrb8UqvpRYHUa5iI8f9BM2RosLQUMjXdmP7-Gwc4MCUtQzzT5bfI2eYQ5jL02avX8N8O1vxplX3mB9bJCq1ibJ9BFortITBe3yJ7HwpiPyd70_ensw_CuZl1lXn_f9rt3pwC8ch9_jlx2opGLB-QeLiPo1MD_kIxUNSF3bBXDhNy3eFCcvCfk7o715CMyn1YUaUItTWhPEwo0oUgTijShSBOqaUJ3aUItTSjQhA40oYYmj8mnt6cXJ-8c3HfDkV7MWicX3PdTeIKjXPJQiGPt6CSjzIv1N1XXyzMZqsxXKoZYWLoqZZxHgYRwSPg8Z6n_hIyrZaUOCA2PJQxtIHjKskBFgRB5KOKcSc_NXKbUIXHtmCYSTen13iiL5FosD8nrvkltHFn-dnFggUowpDShYgKku77Z05v8xzOyPzwLz8m4bdbqBbktN225al4i434CvUCZCQ |
| 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=An+Integer+L-shaped+algorithm+for+vehicle+routing+problem+with+simultaneous+delivery+and+stochastic+pickup&rft.jtitle=Computers+%26+operations+research&rft.au=Che%2C+Yuxin&rft.au=Zhang%2C+Zhenzhen&rft.date=2023-06-01&rft.issn=0305-0548&rft.volume=154&rft.spage=106201&rft_id=info:doi/10.1016%2Fj.cor.2023.106201&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2023_106201 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |