An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
•We present an exact method to solve vehicle routing problem with stochastic demands.•We lower approximate the optimal restocking policy to bound recourse function.•We enhance the Integer L-shaped method by redefining lower bounding functionals.•We can solve problems with 100 customers having arbitr...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 273; číslo 1; s. 175 - 189 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
16.02.2019
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| 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 | •We present an exact method to solve vehicle routing problem with stochastic demands.•We lower approximate the optimal restocking policy to bound recourse function.•We enhance the Integer L-shaped method by redefining lower bounding functionals.•We can solve problems with 100 customers having arbitrary discrete demands.
This paper examines the Vehicle Routing Problem with Stochastic Demands (VRPSD), in which the actual demand of customers can only be realized upon arriving at the customer location. Under demand uncertainty, a planned route may fail at a specific customer when the observed demand exceeds the residual capacity. There are two ways to face such failure events, a vehicle can either execute a return trip to the depot at the failure location and refill the capacity and complete the split service, or in anticipation of potential failures perform a preventive return to the depot whenever the residual capacity falls below a threshold; overall, these return trips are called recourse actions. In the context of VRPSD, a recourse policy which schedules various recourse actions based on the visits planned beforehand on the route must be designed. An optimal recourse policy prescribes the cost-effective returns based on a set of optimal customer-specific thresholds. We propose an exact solution method to solve the multi-VRPSD under an optimal restocking policy. The Integer L-shaped algorithm is adapted to solve the VRPSD in a branch-and-cut framework. To enhance the efficiency of the presented algorithm, several lower bounding schemes are developed to approximate the expected recourse cost. |
|---|---|
| AbstractList | •We present an exact method to solve vehicle routing problem with stochastic demands.•We lower approximate the optimal restocking policy to bound recourse function.•We enhance the Integer L-shaped method by redefining lower bounding functionals.•We can solve problems with 100 customers having arbitrary discrete demands.
This paper examines the Vehicle Routing Problem with Stochastic Demands (VRPSD), in which the actual demand of customers can only be realized upon arriving at the customer location. Under demand uncertainty, a planned route may fail at a specific customer when the observed demand exceeds the residual capacity. There are two ways to face such failure events, a vehicle can either execute a return trip to the depot at the failure location and refill the capacity and complete the split service, or in anticipation of potential failures perform a preventive return to the depot whenever the residual capacity falls below a threshold; overall, these return trips are called recourse actions. In the context of VRPSD, a recourse policy which schedules various recourse actions based on the visits planned beforehand on the route must be designed. An optimal recourse policy prescribes the cost-effective returns based on a set of optimal customer-specific thresholds. We propose an exact solution method to solve the multi-VRPSD under an optimal restocking policy. The Integer L-shaped algorithm is adapted to solve the VRPSD in a branch-and-cut framework. To enhance the efficiency of the presented algorithm, several lower bounding schemes are developed to approximate the expected recourse cost. |
| Author | Gendreau, Michel Jabali, Ola Salavati-Khoshghalb, Majid Rei, Walter |
| Author_xml | – sequence: 1 givenname: Majid orcidid: 0000-0001-7246-2472 surname: Salavati-Khoshghalb fullname: Salavati-Khoshghalb, Majid email: majid.salavati@cirrelt.ca organization: Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT), C.P. 6128, succ. Centre-ville, Montréal, Québec H3C 3J7, Canada – sequence: 2 givenname: Michel orcidid: 0000-0002-9262-3648 surname: Gendreau fullname: Gendreau, Michel email: michel.gendreau@cirrelt.net organization: Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT), C.P. 6128, succ. Centre-ville, Montréal, Québec H3C 3J7, Canada – sequence: 3 givenname: Ola surname: Jabali fullname: Jabali, Ola email: ola.jabali@polimi.it organization: Dipartimento di elettronica, informazione e bioingegneria, Politecnico di Milano, Piazza Leonardo da Vinci, 32, Milano 20133, Italy – sequence: 4 givenname: Walter surname: Rei fullname: Rei, Walter email: walter.rei@cirrelt.ca organization: Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT), C.P. 6128, succ. Centre-ville, Montréal, Québec H3C 3J7, Canada |
| BookMark | eNp9kL1OwzAUhS1UJFrgBZj8AgnXSWM7EktV8SdVYoHZcuzb1iW1K9st8PaklImB6SznO9L5JmTkg0dCbhiUDBi_3ZS4CbGsgMkSRAl1e0bGTIqq4JLDiIyhFqKoKiYuyCSlDQCwhjVjEmee4qc2mep-FaLL6y3NgabQH5DmNdIDrp3pkcawz86v6C6Grsct_RiqNOVg1jplZ6jFrfY20b23GKn2NOyy2-qeRjy23n_Y0DvzdUXOl7pPeP2bl-Tt4f51_lQsXh6f57NFYabQ5qICsG0NRgreGFFz5Ayhsa2RXSemHe9sq-20sbyWklUoRQ3LGg2X2DHWaF1fEnnaNTGkFHGpjMs6u-Bz1K5XDNTRndqoozt1dKdAqMHdgFZ_0F0czsSv_6G7E4TDqYPDqJJx6A1aF9FkZYP7D_8Gft2NdQ |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2022_10_045 crossref_primary_10_1016_j_ejor_2023_07_029 crossref_primary_10_1007_s12065_021_00648_0 crossref_primary_10_1016_j_orl_2022_11_005 crossref_primary_10_1088_1742_6596_1487_1_012030 crossref_primary_10_1287_trsc_2021_1101 crossref_primary_10_3390_a13120308 crossref_primary_10_1049_itr2_12136 crossref_primary_10_3390_su11072060 crossref_primary_10_1007_s00500_019_04053_9 crossref_primary_10_1016_j_cor_2022_105902 crossref_primary_10_1016_j_ejor_2024_11_036 crossref_primary_10_1287_trsc_2020_1002 crossref_primary_10_1016_j_ejor_2023_03_036 crossref_primary_10_1287_trsc_2018_0876 crossref_primary_10_1016_j_asoc_2021_108086 crossref_primary_10_1016_j_ejor_2019_11_015 crossref_primary_10_1080_23302674_2020_1720034 crossref_primary_10_1016_j_cor_2022_105884 crossref_primary_10_1007_s40815_021_01203_w crossref_primary_10_1016_j_jii_2021_100273 crossref_primary_10_1016_j_ejor_2018_10_045 crossref_primary_10_1002_nav_22234 crossref_primary_10_1007_s12046_021_01722_0 crossref_primary_10_1016_j_eswa_2025_128463 crossref_primary_10_1016_j_iswa_2023_200225 crossref_primary_10_1155_2021_6634132 crossref_primary_10_1109_ACCESS_2020_3010176 crossref_primary_10_1287_trsc_2022_1162 crossref_primary_10_1016_j_ejor_2024_09_007 crossref_primary_10_1108_JM2_06_2022_0146 crossref_primary_10_3390_su13063188 crossref_primary_10_1287_trsc_2020_0976 crossref_primary_10_1287_trsc_2022_1129 crossref_primary_10_1016_j_ejor_2024_05_012 crossref_primary_10_1016_j_ejor_2019_10_010 crossref_primary_10_1016_j_ejor_2022_11_040 crossref_primary_10_1016_j_omega_2021_102480 crossref_primary_10_1016_j_ins_2021_04_054 crossref_primary_10_1080_0305215X_2022_2048829 crossref_primary_10_1016_j_cor_2023_106201 crossref_primary_10_1016_j_engappai_2024_108004 crossref_primary_10_1007_s00291_023_00735_x crossref_primary_10_1080_21681015_2021_1925757 crossref_primary_10_1287_ijoc_2023_1271 crossref_primary_10_1109_ACCESS_2024_3524395 |
| Cites_doi | 10.1007/s13676-016-0099-7 10.1287/opre.49.5.796.10608 10.1007/s10107-003-0481-8 10.1287/mnsc.6.1.80 10.1016/j.cor.2014.03.028 10.1007/s13676-018-0126-y 10.1016/j.orl.2006.12.009 10.1002/nav.3800270114 10.1016/j.dam.2014.05.040 10.1023/A:1018995927636 10.1287/opre.50.3.415.7751 10.1287/opre.38.6.1019 10.1287/trsc.23.3.166 10.1016/0377-2217(86)90242-0 10.1016/0167-6377(93)90002-X 10.1287/trsc.29.2.143 10.1287/trsc.1090.0295 10.1287/opre.1080.0520 10.1007/s13676-016-0100-5 10.1287/trsc.34.1.99.12278 10.1287/trsc.1090.0301 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2018.07.039 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 189 |
| ExternalDocumentID | 10_1016_j_ejor_2018_07_039 S0377221718306611 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-200d930c8765c736e61e05d9c8bb74b6bd9ad45d638812e8730f3ec68eb115aa3 |
| ISICitedReferencesCount | 47 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000449132800015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 05:34:36 EST 2025 Tue Nov 18 22:51:10 EST 2025 Fri Feb 23 02:27:37 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Routing Lower bounding functionals Optimal restocking policy Integer L-shaped algorithm Stochastic demands |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-200d930c8765c736e61e05d9c8bb74b6bd9ad45d638812e8730f3ec68eb115aa3 |
| ORCID | 0000-0001-7246-2472 0000-0002-9262-3648 |
| OpenAccessLink | http://hdl.handle.net/11311/1087447 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2018_07_039 crossref_primary_10_1016_j_ejor_2018_07_039 elsevier_sciencedirect_doi_10_1016_j_ejor_2018_07_039 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-02-16 |
| PublicationDateYYYYMMDD | 2019-02-16 |
| PublicationDate_xml | – month: 02 year: 2019 text: 2019-02-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Salavati-Khoshghalb, Gendreau, Jabali, Rei (bib0024) 2017 Dantzig, Ramser (bib0005) 1959; 6 Yang, Mathur, Ballou (bib0028) 2000; 34 Laporte, Louveaux (bib0016) 1998 Secomandi (bib0026) 2001; 49 Birge, Louveaux (bib0003) 2006 Gendron, Crainic, Frangioni, Guertin (bib0011) 2005 Hjorring, Holt (bib0012) 1999; 86 Louveaux (bib0018) 1998 Yee, Golden (bib0029) 1980; 27 Bianchi, Birattari, Chiarandini, Manfrin, Mastrolilli, Paquete (bib0002) 2004 Dror, Trudeau (bib0007) 1986; 23 Rei, Gendreau, Soriano (bib0023) 2010; 44 Secomandi, Margot (bib0027) 2009; 57 Gauvin, Desaulniers, Gendreau (bib0008) 2014; 50 Louveaux, F. V., & Salazar-González, J.-J. (2017). Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Private communication. Salavati-Khoshghalb, M., Gendreau, M., Jabali, O., & Rei, W. (2018). A hybrid recourse policy for the vehicle routing problem with stochastic demands. EURO Journal on Transportation and Logistics. doi Jabali, Rei, Gendreau, Laporte (bib0013) 2014; 177 Lysgaard, Letchford, Eglese (bib0020) 2004; 100 Bertsimas, Jaillet, Odoni (bib0001) 1990; 38 Dror, Laporte, Trudeau (bib0006) 1989; 23 Gendreau, Jabali, Rei (bib0009) 2014 Oyola, Arntzen, Woodruff (bib0022) 2017; 6 Laporte (bib0014) 2009; 43 . Gendreau, Laporte, Sguin (bib0010) 1995; 29 Christiansen, Lysgaard (bib0004) 2007; 35 Oyola, J., Arntzen, H., & Woodruff, D. L. (2016). The stochastic vehicle routing problem, a literature review, part I: Models. EURO Journal on Transportation and Logistics. doi Laporte, Louveaux, Van Hamme (bib0017) 2002; 50 Laporte, Louveaux (bib0015) 1993; 13 Rei (10.1016/j.ejor.2018.07.039_bib0023) 2010; 44 Yang (10.1016/j.ejor.2018.07.039_bib0028) 2000; 34 Hjorring (10.1016/j.ejor.2018.07.039_bib0012) 1999; 86 Oyola (10.1016/j.ejor.2018.07.039_bib0022) 2017; 6 10.1016/j.ejor.2018.07.039_bib0019 Lysgaard (10.1016/j.ejor.2018.07.039_bib0020) 2004; 100 Secomandi (10.1016/j.ejor.2018.07.039_bib0027) 2009; 57 Salavati-Khoshghalb (10.1016/j.ejor.2018.07.039_bib0024) 2017 Dror (10.1016/j.ejor.2018.07.039_bib0007) 1986; 23 Dror (10.1016/j.ejor.2018.07.039_bib0006) 1989; 23 Jabali (10.1016/j.ejor.2018.07.039_bib0013) 2014; 177 Bertsimas (10.1016/j.ejor.2018.07.039_bib0001) 1990; 38 Gendreau (10.1016/j.ejor.2018.07.039_bib0009) 2014 Laporte (10.1016/j.ejor.2018.07.039_bib0017) 2002; 50 Dantzig (10.1016/j.ejor.2018.07.039_bib0005) 1959; 6 Secomandi (10.1016/j.ejor.2018.07.039_bib0026) 2001; 49 Bianchi (10.1016/j.ejor.2018.07.039_bib0002) 2004 Laporte (10.1016/j.ejor.2018.07.039_bib0016) 1998 10.1016/j.ejor.2018.07.039_bib0021 Christiansen (10.1016/j.ejor.2018.07.039_bib0004) 2007; 35 Laporte (10.1016/j.ejor.2018.07.039_bib0015) 1993; 13 Birge (10.1016/j.ejor.2018.07.039_bib0003) 2006 10.1016/j.ejor.2018.07.039_bib0025 Gendron (10.1016/j.ejor.2018.07.039_bib0011) 2005 Yee (10.1016/j.ejor.2018.07.039_bib0029) 1980; 27 Gendreau (10.1016/j.ejor.2018.07.039_bib0010) 1995; 29 Laporte (10.1016/j.ejor.2018.07.039_bib0014) 2009; 43 Louveaux (10.1016/j.ejor.2018.07.039_bib0018) 1998 Gauvin (10.1016/j.ejor.2018.07.039_bib0008) 2014; 50 |
| References_xml | – volume: 29 start-page: 143 year: 1995 end-page: 155 ident: bib0010 article-title: An exact algorithm for the vehicle routing problem with stochastic demands and customers publication-title: Transportation Science – reference: Oyola, J., Arntzen, H., & Woodruff, D. L. (2016). The stochastic vehicle routing problem, a literature review, part I: Models. EURO Journal on Transportation and Logistics. doi: – volume: 177 start-page: 121 year: 2014 end-page: 136 ident: bib0013 article-title: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands publication-title: Discrete Applied Mathematics – reference: Louveaux, F. V., & Salazar-González, J.-J. (2017). Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Private communication. – volume: 23 start-page: 166 year: 1989 end-page: 176 ident: bib0006 article-title: Vehicle routing with stochastic demands: Properties and solution frameworks publication-title: Transportation Science – volume: 49 start-page: 796 year: 2001 end-page: 802 ident: bib0026 article-title: A rollout policy for the vehicle routing problem with stochastic demands publication-title: Operations Research – volume: 6 start-page: 80 year: 1959 end-page: 91 ident: bib0005 article-title: The truck dispatching problem publication-title: Management Science – volume: 13 start-page: 133 year: 1993 end-page: 142 ident: bib0015 article-title: The integer L-shaped method for stochastic integer programs with complete recourse publication-title: Operations Research Letters – start-page: 244 year: 1998 end-page: 263 ident: bib0018 article-title: An introduction to stochastic transportation models – volume: 44 start-page: 136 year: 2010 end-page: 146 ident: bib0023 article-title: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands publication-title: Transportation Science – year: 2006 ident: bib0003 publication-title: Introduction to stochastic programming – start-page: 159 year: 1998 end-page: 167 ident: bib0016 article-title: Solving stochastic routing problems with the integer L-shaped method – volume: 43 start-page: 408 year: 2009 end-page: 416 ident: bib0014 article-title: Fifty years of vehicle routing publication-title: Transportation Science – year: 2017 ident: bib0024 article-title: A rule-based recourse for the vehicle routing problem with stochastic demands publication-title: Technical Report – volume: 35 start-page: 773 year: 2007 end-page: 781 ident: bib0004 article-title: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research Letters – volume: 86 start-page: 569 year: 1999 end-page: 584 ident: bib0012 article-title: New optimality cuts for a single-vehicle stochastic routing problem publication-title: Annals of Operations Research – start-page: 213 year: 2014 end-page: 239 ident: bib0009 article-title: Stochastic vehicle routing problems publication-title: Vehicle routing: Problems, methods, and applications – reference: Salavati-Khoshghalb, M., Gendreau, M., Jabali, O., & Rei, W. (2018). A hybrid recourse policy for the vehicle routing problem with stochastic demands. EURO Journal on Transportation and Logistics. doi: – start-page: 16 year: 2005 end-page: 21 ident: bib0011 article-title: Oobb: Object-oriented tools for parallel branch-and-bound publication-title: Pareo – reference: . – volume: 57 start-page: 214 year: 2009 end-page: 230 ident: bib0027 article-title: Reoptimization approaches for the vehicle-routing problem with stochastic demands publication-title: Operations Research – volume: 34 start-page: 99 year: 2000 end-page: 112 ident: bib0028 article-title: Stochastic vehicle routing problem with restocking publication-title: Transportation Science – volume: 50 start-page: 415 year: 2002 end-page: 423 ident: bib0017 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research – volume: 50 start-page: 141 year: 2014 end-page: 153 ident: bib0008 article-title: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands publication-title: Computers and Operations Research – volume: 38 start-page: 1019 year: 1990 end-page: 1033 ident: bib0001 article-title: A priori optimization publication-title: Operations Research – start-page: 450 year: 2004 end-page: 460 ident: bib0002 article-title: Metaheuristics for the vehicle routing problem with stochastic demands publication-title: Parallel problem solving from nature - ppsn viii – volume: 23 start-page: 228 year: 1986 end-page: 235 ident: bib0007 article-title: Stochastic vehicle routing with modified savings algorithm publication-title: European Journal of Operational Research – volume: 100 start-page: 423 year: 2004 end-page: 445 ident: bib0020 article-title: A new branch-and-cut algorithm for the capacitated vehicle routing problem publication-title: Mathematical Programming – volume: 27 start-page: 159 year: 1980 end-page: 163 ident: bib0029 article-title: A note on determining operating strategies for probabilistic vehicle routing publication-title: Naval Research Logistics Quarterly – volume: 6 start-page: 349 year: 2017 end-page: 388 ident: bib0022 article-title: The stochastic vehicle routing problem, a literature review, part II: Solution methods publication-title: EURO Journal on Transportation and Logistics – ident: 10.1016/j.ejor.2018.07.039_bib0019 – volume: 6 start-page: 349 issue: 4 year: 2017 ident: 10.1016/j.ejor.2018.07.039_bib0022 article-title: The stochastic vehicle routing problem, a literature review, part II: Solution methods publication-title: EURO Journal on Transportation and Logistics doi: 10.1007/s13676-016-0099-7 – start-page: 213 year: 2014 ident: 10.1016/j.ejor.2018.07.039_bib0009 article-title: Stochastic vehicle routing problems – year: 2006 ident: 10.1016/j.ejor.2018.07.039_bib0003 – volume: 49 start-page: 796 issue: 5 year: 2001 ident: 10.1016/j.ejor.2018.07.039_bib0026 article-title: A rollout policy for the vehicle routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.49.5.796.10608 – volume: 100 start-page: 423 issue: 2 year: 2004 ident: 10.1016/j.ejor.2018.07.039_bib0020 article-title: A new branch-and-cut algorithm for the capacitated vehicle routing problem publication-title: Mathematical Programming doi: 10.1007/s10107-003-0481-8 – volume: 6 start-page: 80 issue: 1 year: 1959 ident: 10.1016/j.ejor.2018.07.039_bib0005 article-title: The truck dispatching problem publication-title: Management Science doi: 10.1287/mnsc.6.1.80 – volume: 50 start-page: 141 year: 2014 ident: 10.1016/j.ejor.2018.07.039_bib0008 article-title: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands publication-title: Computers and Operations Research doi: 10.1016/j.cor.2014.03.028 – ident: 10.1016/j.ejor.2018.07.039_bib0025 doi: 10.1007/s13676-018-0126-y – volume: 35 start-page: 773 issue: 6 year: 2007 ident: 10.1016/j.ejor.2018.07.039_bib0004 article-title: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research Letters doi: 10.1016/j.orl.2006.12.009 – start-page: 16 year: 2005 ident: 10.1016/j.ejor.2018.07.039_bib0011 article-title: Oobb: Object-oriented tools for parallel branch-and-bound – volume: 27 start-page: 159 issue: 1 year: 1980 ident: 10.1016/j.ejor.2018.07.039_bib0029 article-title: A note on determining operating strategies for probabilistic vehicle routing publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800270114 – volume: 177 start-page: 121 year: 2014 ident: 10.1016/j.ejor.2018.07.039_bib0013 article-title: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2014.05.040 – volume: 86 start-page: 569 issue: 0 year: 1999 ident: 10.1016/j.ejor.2018.07.039_bib0012 article-title: New optimality cuts for a single-vehicle stochastic routing problem publication-title: Annals of Operations Research doi: 10.1023/A:1018995927636 – volume: 50 start-page: 415 issue: 3 year: 2002 ident: 10.1016/j.ejor.2018.07.039_bib0017 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.50.3.415.7751 – start-page: 244 year: 1998 ident: 10.1016/j.ejor.2018.07.039_bib0018 article-title: An introduction to stochastic transportation models – volume: 38 start-page: 1019 issue: 6 year: 1990 ident: 10.1016/j.ejor.2018.07.039_bib0001 article-title: A priori optimization publication-title: Operations Research doi: 10.1287/opre.38.6.1019 – year: 2017 ident: 10.1016/j.ejor.2018.07.039_bib0024 article-title: A rule-based recourse for the vehicle routing problem with stochastic demands – volume: 23 start-page: 166 issue: 3 year: 1989 ident: 10.1016/j.ejor.2018.07.039_bib0006 article-title: Vehicle routing with stochastic demands: Properties and solution frameworks publication-title: Transportation Science doi: 10.1287/trsc.23.3.166 – volume: 23 start-page: 228 issue: 2 year: 1986 ident: 10.1016/j.ejor.2018.07.039_bib0007 article-title: Stochastic vehicle routing with modified savings algorithm publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90242-0 – volume: 13 start-page: 133 issue: 3 year: 1993 ident: 10.1016/j.ejor.2018.07.039_bib0015 article-title: The integer L-shaped method for stochastic integer programs with complete recourse publication-title: Operations Research Letters doi: 10.1016/0167-6377(93)90002-X – start-page: 450 year: 2004 ident: 10.1016/j.ejor.2018.07.039_bib0002 article-title: Metaheuristics for the vehicle routing problem with stochastic demands – volume: 29 start-page: 143 issue: 2 year: 1995 ident: 10.1016/j.ejor.2018.07.039_bib0010 article-title: An exact algorithm for the vehicle routing problem with stochastic demands and customers publication-title: Transportation Science doi: 10.1287/trsc.29.2.143 – volume: 44 start-page: 136 issue: 1 year: 2010 ident: 10.1016/j.ejor.2018.07.039_bib0023 article-title: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands publication-title: Transportation Science doi: 10.1287/trsc.1090.0295 – volume: 57 start-page: 214 issue: 1 year: 2009 ident: 10.1016/j.ejor.2018.07.039_bib0027 article-title: Reoptimization approaches for the vehicle-routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.1080.0520 – start-page: 159 year: 1998 ident: 10.1016/j.ejor.2018.07.039_bib0016 article-title: Solving stochastic routing problems with the integer L-shaped method – ident: 10.1016/j.ejor.2018.07.039_bib0021 doi: 10.1007/s13676-016-0100-5 – volume: 34 start-page: 99 issue: 1 year: 2000 ident: 10.1016/j.ejor.2018.07.039_bib0028 article-title: Stochastic vehicle routing problem with restocking publication-title: Transportation Science doi: 10.1287/trsc.34.1.99.12278 – volume: 43 start-page: 408 issue: 4 year: 2009 ident: 10.1016/j.ejor.2018.07.039_bib0014 article-title: Fifty years of vehicle routing publication-title: Transportation Science doi: 10.1287/trsc.1090.0301 |
| SSID | ssj0001515 |
| Score | 2.5130908 |
| Snippet | •We present an exact method to solve vehicle routing problem with stochastic demands.•We lower approximate the optimal restocking policy to bound recourse... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 175 |
| SubjectTerms | Integer L-shaped algorithm Lower bounding functionals Optimal restocking policy Routing Stochastic demands |
| Title | An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy |
| URI | https://dx.doi.org/10.1016/j.ejor.2018.07.039 |
| Volume | 273 |
| WOSCitedRecordID | wos000449132800015&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FKUJw4BFAtDy0B26RK7939xihIihSQbSI3Ky1va4bHLtynai_sb-Kmd21E9qqAiQuVrTy2k7m8863k_lmCHlXYBG4XEWOLxhsUArBHZnmzPGL3MuYm4mQmWYT7OiIz-fi62h01Wth1hWra355Kc7_q6lhDIyN0tm_MPdwURiAz2B0OILZ4fhHhp9h2X5UPsrqtIGtf7lEfgn3XCvNMteqxCnTtll1RoquW8rYZPWuyUqJtZunuVqiDFg3ysVEy2kDq8tS9wHAs37quZuqwrdF9y3ThYG2jzna4kJDEPpYVhKjws7nsrkoT0tZpUZCtOhT7Ve63R1w21Wf5q-GrJBDmUqj7_5SDf7lm9IjP3QiwHZUA4VUvmNElybUdkNuYyReDFDkG7HnvjIrNme-E3PTlKBf0n3THuU37JoF2jN9Wqyv90z7ohtuxEQ0Fvtq0WDNWI_rAq-m6tK18tzH-FD4TLA2An1DmfmOzyLBx2Rn9ulgfjjwAqSO-j8t-yWshMtkG16_0-00aYv6nDwhj-yehc4M1p6Skaon5H4vmZiQx31rEGo9xYQ83Kpz-Yy0s5pqTNIBk7RrqMYkBUxSi0lqMUktJilikm4wSS0mqcYklTW1mKQbTFKDyefk-4eDk_cfHdvsw8lCV3T4CucicDPwzlHGgljFnnKjXGQ8TVmYxmkuZB5GOfgL4KSKg2cqApXFHMiGF0kZvCDjuqnVS0ILWYhI-jwPvADYfpiGLIXzRMThGq5wd4nX_7ZJZivhY0OWKulTHhcJ2iNBeyQuS8Aeu2Q6zDk3dWDuPDvqTZZYJmsYagIIu2Pe3j_Oe0UebF6i12TctSv1htzL1t3ZRfvWAvEXyKLIcg |
| 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+exact+algorithm+to+solve+the+vehicle+routing+problem+with+stochastic+demands+under+an+optimal+restocking+policy&rft.jtitle=European+journal+of+operational+research&rft.au=Salavati-Khoshghalb%2C+Majid&rft.au=Gendreau%2C+Michel&rft.au=Jabali%2C+Ola&rft.au=Rei%2C+Walter&rft.date=2019-02-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=273&rft.issue=1&rft.spage=175&rft.epage=189&rft_id=info:doi/10.1016%2Fj.ejor.2018.07.039&rft.externalDocID=S0377221718306611 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |