A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service
This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program with recourse is used to describe the problem. This program aims to minimize the sum of the travel cost and the expected cost of recourse act...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society Jg. 68; H. 11; S. 1409 - 1421 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Taylor & Francis
01.11.2017
Taylor & Francis, Ltd Palgrave Macmillan UK Taylor & Francis Ltd |
| Schlagworte: | |
| ISSN: | 0160-5682, 1476-9360 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program with recourse is used to describe the problem. This program aims to minimize the sum of the travel cost and the expected cost of recourse actions resulting from potential route failures. In a two-echelon distribution system, split deliveries are allowed at the first level but not at the second level, thereby increasing the difficulty of calculating the expected failure cost. Three types of routes with or without split deliveries are identified. Different methods are devised or adapted from the literature to compute the failure cost. A genetic-algorithm-based (GA) approach is proposed to solve the 2E-CVRPSD. A simple encoding and decoding scheme, a modified route copy crossover operator, and a satellite-selection-based mutation operator are devised in this approach. The numerical results show that for all instances, the expected cost of the best 2E-CVRPSD solution found by the proposed approach is not greater than that of the best-known 2E-CVRP solution with an average relative gap of 2.57%. Therefore, the GA-based approach can find high-quality solutions for the 2E-CVRPSD. |
|---|---|
| AbstractList | This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program with recourse is used to describe the problem. This program aims to minimize the sum of the travel cost and the expected cost of recourse actions resulting from potential route failures. In a two-echelon distribution system, split deliveries are allowed at the first level but not at the second level, thereby increasing the difficulty of calculating the expected failure cost. Three types of routes with or without split deliveries are identified. Different methods are devised or adapted from the literature to compute the failure cost. A genetic-algorithm-based (GA) approach is proposed to solve the 2E-CVRPSD. A simple encoding and decoding scheme, a modified route copy crossover operator, and a satellite-selection-based mutation operator are devised in this approach. The numerical results show that for all instances, the expected cost of the best 2E-CVRPSD solution found by the proposed approach is not greater than that of the best-known 2E-CVRP solution with an average relative gap of 2.57%. Therefore, the GA-based approach can find high-quality solutions for the 2E-CVRPSD. |
| Author | Lan, Shulin Zhao, Yingxue Wang, Kangzhou |
| Author_xml | – sequence: 1 givenname: Kangzhou surname: Wang fullname: Wang, Kangzhou email: kzhwang@lzu.edu.cn organization: School of ManagementLanzhou University – sequence: 2 givenname: Shulin surname: Lan fullname: Lan, Shulin organization: Department of Industrial and Manufacturing Systems EngineeringThe University of Hong Kong – sequence: 3 givenname: Yingxue surname: Zhao fullname: Zhao, Yingxue organization: School of International Trade and EconomicsUniversity of International Business and Economics |
| BookMark | eNp9kM9q3DAQxkVJoJs0D9BDQdCzEsnW6g_0EkKbBgK95C5keWxrsaWtpM2SF-hzV1uXUgrNQQxovt83M98FOgsxAELvGb1mdCtvMmeN5IQyUZ-kRL5BG8alILoV9AxtaoOSrVDNW3SR845SqinTG_TjFo8QoHhH7DzG5Mu0kM5m6LHd71O0bsIl4jIBLsdIwE0wx4Cd3Vvniy1V9wyTdzPgFA_FhxFXqpthwcfqhXOJbrK5-uMeFhv6jH3Acxz96S_jDOnZO3iHzgc7Z7j6XS_R05fPT3dfyeO3-4e720fiuBCFKM1twxWvJwrYAgzCSVCgetCDc73lHQehdDdY2THVKtE0IJxqhe0HpaC9RB9X27rj9wPkYnbxkEKdaJjWVMiK6Kpiq8qlmHOCweyTX2x6MYyaU9pmTdvUUM0pbSMrI_9hfsXjYyjJ-vlVslnJXKeEEdJfO70CfVihXQ04_dmPK7nVmp9O-LT2fRhiWuwxprk3xb7MMQ3JBuezaf9v_xPMrrad |
| CitedBy_id | crossref_primary_10_3233_IDA_205693 crossref_primary_10_1080_00207543_2025_2512445 crossref_primary_10_1002_net_22233 crossref_primary_10_3390_math12081199 crossref_primary_10_1016_j_ejor_2022_02_022 crossref_primary_10_1007_s10489_018_1360_6 crossref_primary_10_1016_j_heliyon_2022_e09767 crossref_primary_10_1155_2018_5191637 crossref_primary_10_1080_01605682_2019_1650625 crossref_primary_10_1109_TCBB_2019_2952102 crossref_primary_10_1007_s12597_020_00481_6 crossref_primary_10_1080_23302674_2025_2450051 crossref_primary_10_1080_01605682_2021_1890531 crossref_primary_10_1016_j_asoc_2018_12_036 crossref_primary_10_1007_s12597_025_00956_4 crossref_primary_10_1016_j_swevo_2020_100767 crossref_primary_10_30798_makuiibf_1459738 crossref_primary_10_3390_a13090218 crossref_primary_10_1016_j_asoc_2021_107676 crossref_primary_10_1016_j_eswa_2023_121473 crossref_primary_10_1016_j_eswa_2024_124164 crossref_primary_10_1007_s00500_019_03754_5 crossref_primary_10_1016_j_eswa_2024_124141 crossref_primary_10_3390_math8101788 crossref_primary_10_1016_j_cor_2018_11_005 crossref_primary_10_1109_TEVC_2022_3164260 crossref_primary_10_1287_trsc_2022_1162 crossref_primary_10_1016_j_rtbm_2021_100692 crossref_primary_10_3390_su12197934 crossref_primary_10_1016_j_cie_2024_110040 crossref_primary_10_1080_17509653_2025_2490246 crossref_primary_10_1109_TITS_2022_3156685 crossref_primary_10_1016_j_trd_2017_09_018 crossref_primary_10_1016_j_swevo_2022_101208 crossref_primary_10_1016_j_cie_2020_106337 crossref_primary_10_3390_a17110509 crossref_primary_10_1016_j_trb_2018_07_006 crossref_primary_10_3390_app131910659 crossref_primary_10_1007_s11590_022_01946_x crossref_primary_10_1109_ACCESS_2024_3524395 |
| Cites_doi | 10.1016/j.endm.2010.05.081 10.1016/S0305-0548(03)00158-8 10.1016/j.cor.2012.04.007 10.1016/j.asoc.2013.01.007 10.1007/s11590-012-0568-3 10.1287/trsc.1030.0056 10.1016/j.cor.2014.06.008 10.1287/trsc.23.3.166 10.1287/trsc.2013.0500 10.1287/trsc.1030.0057 10.1016/j.cor.2014.07.011 10.1016/j.cor.2012.10.016 10.1007/s11067-013-9190-x 10.1080/0305215X.2014.928818 10.1057/jors.2014.88 10.1016/j.ejor.2011.09.023 10.1057/jors.2015.19 10.1287/trsc.1110.0399 10.1016/0377-2217(80)90124-1 10.1287/opre.1120.1153 10.1287/opre.50.3.415.7751 10.1287/opre.1120.1048 10.1016/j.ijpe.2010.01.013 10.1287/trsc.1110.0368 10.1080/00207543.2011.622310 10.1016/j.orl.2006.12.009 10.1007/s10852-005-9033-y |
| ContentType | Journal Article |
| Copyright | Copyright © 2017, The Operational Research Society 2017 2017 The Operational Research Society The Operational Research Society 2017 Copyright Taylor & Francis Ltd. Nov 2017 |
| Copyright_xml | – notice: Copyright © 2017, The Operational Research Society 2017 – notice: 2017 The Operational Research Society – notice: The Operational Research Society 2017 – notice: Copyright Taylor & Francis Ltd. Nov 2017 |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X7 7XB 87Z 88E 8AL 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L6V M0C M0N M0S M1P M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U U9A |
| DOI | 10.1057/s41274-016-0170-7 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection (ProQuest) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Database Suite (ProQuest) Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ProQuest Health & Medical Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student ProQuest Research Library SciTech Collection (ProQuest) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database (ProQuest) ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Collection (ProQuest) Computing Database ProQuest Health & Medical Collection Medical Database Research Library (ProQuest) Engineering Database Research Library (Corporate) ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Career and Technical Education ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central Database Suite (ProQuest) url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business |
| EISSN | 1476-9360 |
| EndPage | 1421 |
| ExternalDocumentID | 10_1057_s41274_016_0170_7 48759949 11944593 |
| Genre | Research Article |
| GroupedDBID | -~X .DC 0BK 0R~ 29L 30N 3R3 4.4 5GY 7RQ 7WY 7X7 88E 8FE 8FG 8FI 8FJ 8FL 8G5 8R4 8R5 AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AARHV ABBHK ABJCF ABJNI ABKVW ABLIJ ABLJU ABMNI ABPAQ ABPPZ ABUWG ABXUL ABXYU ABYYQ ACGFO ACHQT ACIWK ACNCT ACREN ACTIO ACXJH ADBBV ADEPB ADFRT ADGDI ADGTB ADMHG ADNFJ AEBJH AECXW AEISY AENEX AEUPB AEXYK AEYOC AFAIT AFKRA AFRVT AFTQD AGAYW AGDLA AHAJD AHDZW AIYEW AJRNO AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AMKLP AMTXH AQRUH AQTUD ARAPS ASPBG AVWKF AWYRJ AXYYD AZQEC BENPR BEZIV BGLVJ BKKNO BLEHA BPHCQ BVXVI CBXGM CCCUG CCKSF CCPQU CS3 CYVLN DGEBU DU5 DWQXO EBS EJD F5P FEFRA FRNLG FYUFA GNUQQ GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HMCUK IPSME JAV JBC JENOY JPL JPPEU JST K60 K6V K6~ K7- KYCEM L6V M0C M1P M2O M4Z M7S MS~ O9- P2P P62 PHGZM PHGZT PJZUB PPXIY PQBIZ PQBZA PQGLB PQQKQ PROAC PSQYO PTHSS Q2X RNANH ROSJB RPC RSV RTWRZ SA0 SOJ TAJZE TASJS TBQAZ TDBHL TEN TFL TFT TFW TN5 TTHFI TUROJ U5U UKHRP WH7 XSW ZGOLN ~02 AAYZH ABLWH ADYSH AHSBF ALIPV AMPGV 1OL 3EH 3V. AAAZS AAIAL AAXLS AAYOK ABDPE ABXSQ ACTTO ADULT ADUMR ADXEU AEHZU AEZBV AFBWG AFFNX AGVKY AGWUF AI. AJPNJ AKHJE AKMBP ALRRR APTMU AQSKT BGSSV CAG COF CSNOR CYRSC DAOYK GENNL GROUPED_ABI_INFORM_COMPLETE GUPYA HGD HVGLF H~9 IFELN JAAYA JBMMH JBZCM JHFFW JKQEH JLEZI JLXEF JSODD LJTGL M0N N8N NHB NUSFT PKN PLIJB RNS SNX VH1 VQA ZCG AAYXX ABAWQ ACHJO ADMLS AFFHD AGBKS AGKTX AGYFW ASMEE CITATION 7XB 8AL 8FK JQ2 K9. L.- MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c466t-894a24840176e5eef6c7e8e8de9fccda4b4e689bfa7b1838622e6c836adf88e3 |
| IEDL.DBID | 7RQ |
| ISICitedReferencesCount | 48 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000412853800009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0160-5682 |
| IngestDate | Mon Oct 06 17:16:16 EDT 2025 Tue Nov 18 22:07:13 EST 2025 Sat Nov 29 06:38:25 EST 2025 Fri Feb 21 02:38:28 EST 2025 Thu Jun 19 20:51:05 EDT 2025 Mon Oct 20 23:37:35 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | genetic algorithm stochastic demands city logistics stochastic programming two-echelon capacitated vehicle routing |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c466t-894a24840176e5eef6c7e8e8de9fccda4b4e689bfa7b1838622e6c836adf88e3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://figshare.com/articles/journal_contribution/A_genetic-algorithm-based_approach_to_the_two-echelon_capacitated_vehicle_routing_problem_with_stochastic_demands_in_logistics_service/5752887 |
| PQID | 1990673869 |
| PQPubID | 31386 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1057_s41274_016_0170_7 informaworld_taylorfrancis_310_1057_s41274_016_0170_7 crossref_citationtrail_10_1057_s41274_016_0170_7 jstor_primary_48759949 proquest_journals_1990673869 springer_journals_10_1057_s41274_016_0170_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-11-01 |
| PublicationDateYYYYMMDD | 2017-11-01 |
| PublicationDate_xml | – month: 11 year: 2017 text: 2017-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Abingdon |
| PublicationTitle | The Journal of the Operational Research Society |
| PublicationTitleAbbrev | J Oper Res Soc |
| PublicationYear | 2017 |
| Publisher | Taylor & Francis Taylor & Francis, Ltd Palgrave Macmillan UK Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis, Ltd – name: Palgrave Macmillan UK – name: Taylor & Francis Ltd |
| References | Braysy, Gendreau (CR4) 2005; 39 Dror, Laporte, Trudeau (CR10) 1989; 23 Yuan, Zhang, Shao, Jiang (CR31) 2015; 53 Paydar, Saidi-Mehrabad (CR23) 2013; 40 CR14 Prins (CR26) 2004; 31 CR11 Christiansen, Lysgaard (CR6) 2007; 35 Jacobsen, Madsen (CR15) 1980; 5 Crainic, Mancini, Perboli, Tadei, Computation (CR7) 2011 Li, Tian, Leung (CR19) 2010; 125 Perboli, Tadei, Vigo (CR25) 2011; 45 Lian, Zhang, Gao, Li (CR20) 2012; 50 Yan, Wan, Xiong (CR30) 2015; 66 Vidal, Crainic, Gendreau, Lahrichi, Rei (CR29) 2012; 60 Baldacci, Mingozzi, Roberti, Wolfler Calvo (CR1) 2013; 61 Zeng, Xu, Xu, Shao (CR32) 2014; 2014 Jepsen, Spoorendonk, Ropke (CR16) 2013; 47 Braysy, Gendreau (CR3) 2005; 39 CR5 CR8 Laporte, Louveaux, Hamme (CR17) 2002; 50 Santos, Mateus, Cunha (CR28) 2015; 49 Cuda, Guastaroba, Speranza (CR9) 2015; 55 Zhang, Lam, Chen (CR33) 2013; 13 Goodson, Ohlmann, Thomas (CR12) 2012; 217 Hemmelmayr, Cordeau, Crainic (CR13) 2012; 39 Perboli, Tadei, Tadei (CR24) 2010; 36 Bianchi, Birattari, Chiarandini, Manfrin, Mastrolilli, Paquete, Rossi-Doria, Schiavinotto (CR2) 2005; 5 Lin, Yu, Wang, Zhang, Zhang, Tian, Luo, Liu (CR21) 2015; 47 Santos, Cunha, Mateus (CR27) 2013; 7 Lee, Wang, Lee (CR18) 2015; 66 Marinakis, Iordanidou, Marinaki (CR22) 2013; 13 CIT0030 CIT0010 CIT0031 CIT0012 CIT0033 CIT0013 CIT0016 CIT0015 CIT0018 CIT0017 CIT0019 CIT0021 CIT0020 CIT0001 CIT0023 CIT0022 Zeng Z (CIT0032) 2014; 2014 Crainic TG (CIT0007) 2011 CIT0003 CIT0025 CIT0002 CIT0024 CIT0027 CIT0004 CIT0026 CIT0029 CIT0006 CIT0028 CIT0009 |
| References_xml | – volume: 36 start-page: 639 issue: 1 year: 2010 end-page: 646 ident: CR24 article-title: New families of valid inequalities for the two-echelon vehicle routing problem publication-title: Electronic Notes in Discrete Mathematics doi: 10.1016/j.endm.2010.05.081 – volume: 31 start-page: 1985 issue: 12 year: 2004 end-page: 2002 ident: CR26 article-title: A simple and effective evolutionary algorithm for the vehicle routing problem publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(03)00158-8 – volume: 39 start-page: 3215 issue: 12 year: 2012 end-page: 3228 ident: CR13 article-title: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.04.007 – ident: CR14 – volume: 13 start-page: 1693 issue: 4 year: 2013 end-page: 1704 ident: CR22 article-title: Particle swarm optimization for the vehicle routing problem with stochastic demands publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2013.01.007 – start-page: 179 year: 2011 end-page: 190 ident: CR7 article-title: Multi-start heuristics for the two-echelon vehicle routing problem publication-title: Combinatorial Optimization: 11th European Conference, Torino, Italy – volume: 7 start-page: 1537 issue: 7 year: 2013 end-page: 1547 ident: CR27 article-title: Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem publication-title: Optimization Letters doi: 10.1007/s11590-012-0568-3 – volume: 39 start-page: 104 issue: 1 year: 2005 end-page: 118 ident: CR3 article-title: Vehicle routing problem with time windows, part I: Route construction and local search algorithms publication-title: Transportation Science doi: 10.1287/trsc.1030.0056 – volume: 55 start-page: 185 issue: 1 year: 2015 end-page: 199 ident: CR9 article-title: A survey on two-echelon routing problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.06.008 – volume: 23 start-page: 166 issue: 3 year: 1989 end-page: 176 ident: CR10 article-title: Vehicle routing with stochastic demands: Properties and solution frameworks publication-title: Transportation Science doi: 10.1287/trsc.23.3.166 – volume: 49 start-page: 355 issue: 2 year: 2015 end-page: 368 ident: CR28 article-title: A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem publication-title: Transportation Science doi: 10.1287/trsc.2013.0500 – ident: CR8 – volume: 39 start-page: 119 issue: 1 year: 2005 end-page: 139 ident: CR4 article-title: Vehicle routing problem with time windows, part II: Metaheuristics publication-title: Transportation Science doi: 10.1287/trsc.1030.0057 – volume: 53 start-page: 32 issue: 1 year: 2015 end-page: 41 ident: CR31 article-title: An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.07.011 – volume: 2014 start-page: 1 issue: 1 year: 2014 end-page: 11 ident: CR32 article-title: A hybrid GRASP + VND heuristic for the two-echelon vehicle routing problem arising in city logistics publication-title: Mathematical Problems in Engineering – volume: 40 start-page: 980 issue: 1 year: 2013 end-page: 990 ident: CR23 article-title: A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.10.016 – volume: 13 start-page: 471 issue: 4 year: 2013 end-page: 496 ident: CR33 article-title: A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service publication-title: Networks & Spatial Economics doi: 10.1007/s11067-013-9190-x – volume: 47 start-page: 994 issue: 7 year: 2015 end-page: 1007 ident: CR21 article-title: Multi-objective teaching-learning-based optimization algorithm for reducing carbon emissions and operation time in turning operations publication-title: Engineering Optimization doi: 10.1080/0305215X.2014.928818 – volume: 66 start-page: 1250 issue: 8 year: 2015 end-page: 1258 ident: CR30 article-title: Integrated production planning and scheduling for a mixed batch job-shop based on alternant iterative genetic algorithm publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2014.88 – volume: 217 start-page: 312 issue: 2 year: 2012 end-page: 323 ident: CR12 article-title: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.09.023 – volume: 66 start-page: 1906 issue: 11 year: 2015 end-page: 1918 ident: CR18 article-title: A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2015.19 – volume: 47 start-page: 23 issue: 1 year: 2013 end-page: 37 ident: CR16 article-title: A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem publication-title: Transportation Science doi: 10.1287/trsc.1110.0399 – volume: 5 start-page: 378 issue: 6 year: 1980 end-page: 387 ident: CR15 article-title: A comparative study of heuristics for a two-level routing-location problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(80)90124-1 – volume: 61 start-page: 298 issue: 2 year: 2013 end-page: 314 ident: CR1 article-title: An exact algorithm for the two-echelon capacitated vehicle routing problem publication-title: Operations Research doi: 10.1287/opre.1120.1153 – volume: 50 start-page: 415 issue: 3 year: 2002 end-page: 423 ident: CR17 article-title: An integer -shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.50.3.415.7751 – volume: 60 start-page: 611 issue: 3 year: 2012 end-page: 624 ident: CR29 article-title: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems publication-title: Operations Research doi: 10.1287/opre.1120.1048 – ident: CR11 – volume: 125 start-page: 137 issue: 1 year: 2010 end-page: 145 ident: CR19 article-title: Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2010.01.013 – volume: 45 start-page: 364 issue: 3 year: 2011 end-page: 380 ident: CR25 article-title: The two-echelon capacitated vehicle routing problem: models and math-based heuristics publication-title: Transportation Science doi: 10.1287/trsc.1110.0368 – ident: CR5 – volume: 50 start-page: 4326 issue: 15 year: 2012 end-page: 4343 ident: CR20 article-title: Integrated process planning and scheduling using an imperialist competitive algorithm publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.622310 – volume: 35 start-page: 773 issue: 6 year: 2007 end-page: 781 ident: CR6 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 – volume: 5 start-page: 91 issue: 1 year: 2005 end-page: 110 ident: CR2 article-title: Hybrid metaheuristics for the vehicle routing problem with stochastic demands publication-title: Journal of Mathematical Modelling and Algorithms doi: 10.1007/s10852-005-9033-y – ident: CIT0030 doi: 10.1057/jors.2014.88 – ident: CIT0018 doi: 10.1057/jors.2015.19 – ident: CIT0031 doi: 10.1016/j.cor.2014.07.011 – ident: CIT0003 doi: 10.1287/trsc.1030.0056 – ident: CIT0015 doi: 10.1016/0377-2217(80)90124-1 – ident: CIT0006 doi: 10.1016/j.orl.2006.12.009 – ident: CIT0023 doi: 10.1016/j.cor.2012.10.016 – ident: CIT0033 doi: 10.1007/s11067-013-9190-x – ident: CIT0027 doi: 10.1007/s11590-012-0568-3 – ident: CIT0025 doi: 10.1287/trsc.1110.0368 – ident: CIT0029 doi: 10.1287/opre.1120.1048 – ident: CIT0001 doi: 10.1287/opre.1120.1153 – start-page: 179 volume-title: Combinatorial Optimization: 11th European Conference, Torino, Italy year: 2011 ident: CIT0007 – ident: CIT0024 doi: 10.1016/j.endm.2010.05.081 – ident: CIT0017 doi: 10.1287/opre.50.3.415.7751 – ident: CIT0021 doi: 10.1080/0305215X.2014.928818 – volume: 2014 start-page: 1 issue: 1 year: 2014 ident: CIT0032 publication-title: Mathematical Problems in Engineering – ident: CIT0026 doi: 10.1016/S0305-0548(03)00158-8 – ident: CIT0022 doi: 10.1016/j.asoc.2013.01.007 – ident: CIT0012 doi: 10.1016/j.ejor.2011.09.023 – ident: CIT0013 doi: 10.1016/j.cor.2012.04.007 – ident: CIT0028 doi: 10.1287/trsc.2013.0500 – ident: CIT0010 doi: 10.1287/trsc.23.3.166 – ident: CIT0019 doi: 10.1016/j.ijpe.2010.01.013 – ident: CIT0009 doi: 10.1016/j.cor.2014.06.008 – ident: CIT0002 doi: 10.1007/s10852-005-9033-y – ident: CIT0020 doi: 10.1080/00207543.2011.622310 – ident: CIT0004 doi: 10.1287/trsc.1030.0057 – ident: CIT0016 doi: 10.1287/trsc.1110.0399 |
| SSID | ssj0009019 |
| Score | 2.4016645 |
| Snippet | This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program... |
| SourceID | proquest crossref springer jstor informaworld |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1409 |
| SubjectTerms | Business and Management city logistics Decoding genetic algorithm Identification methods Logistics Management Operations Research/Decision Theory Route planning Routing stochastic demands stochastic programming two-echelon capacitated vehicle routing Vehicle routing |
| SummonAdditionalLinks | – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELagIASHli5UFArygQMPWWQ3jh_HqmrFAVUIqqo3K7HH7EptgjZp-Qf8bsaOXXYRrQTX2E6seOyZ8cx8HyGva2mFL13Bmqqp0EHxmukSPPo8gPpGW8sj8PzpJ3l8rM7O9OdUx93nbPcckowndeKi_dDzKXpQ6PoGD1gWTN4l91DbqcDX8OXr6W-k3SKyeQTkNFYJNcuhzL-9Yk0ZrUGV5vTENcPzj1hpVEFHW_81-cdkM1mcdH8UkW1yB9oJeZAT3idkKxM70LTPJ-TRCkrhhGyn5z19k0Cq3z4hP_cpil6ogGT1-bduuRjmFyyoREczTDkdOormJR1-dAxCwmnXUou62YayNux3BfMwI7rsLkPuNU3cNjRcDVP8K3ZeBxBp6uAi1CPTRUvHeqWF7Wk_nnFPycnR4cnBR5Y4HZjlQgxMaV7POHqVUymgAvDCSlCgHGhvrat5w0Eo3fhaNnjaoL81A2FVKWrnlYJyh2y0XQvPCBXAbcMLKJ1QXFvXOO-VU2jxoomlGr1Liry2xia880C7cW5i3L2SZlwUE3LcwqIYuUveXQ_5PoJ93Na5WhUYM8QbFj_SoZjylnE7UbKuvxBcRq05Tngvi5pJB0lvpmgtRGJWbH6fRWul-aavPP-n3i_Iw1kwV2KN5R7ZGJaX8JLct1fDol--ivvrF3AYICo priority: 102 providerName: Springer Nature – databaseName: Taylor & Francis Online Journals dbid: TFW link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nb9QwELVQhRAcWrpQUSjIBw58yCK7cRz7WFVdcUAVhxX0ZiX2mF2pTdAmbf8Bv5sZxym7CHqAa2zHTjz2zLNn3jD2uiqdCrnPRF3UBQKUYITJISDmAdQ3xjkZiee_fCrPzvT5ufmcfHO65FZJGDoMRBFxr6bFXdXdmJX2QyeniKUQBBMWLjNBseSo9mlZLuZff1HuZjGtB1GoiULp2Xin-ac3bGmlLc7S0U9xywL97dI06qL53n9-xWO2m4xQfjxIzT67B82EPRh94Cdsb8z1wNPSn7BHG8SFE7afnnf8TeKtfvuE_TjmKI0UFCmqi2_tetUvLwVpSc9H5nLetxwtTt7ftALIB7VtuEN17SjSDetdw5JGxNftFblj85TuhtNpMcf_45YV8UpzD5cUosxXDR9CmFau492w7T1li_np4uSjSGkehJNK9UIbWc0kAs1pqaAACMqVoEF7MME5X8lagtKmDlVZ4waEEGwGyulcVT5oDfkB22naBp4xrkC6WmaQe6Wlcb72IWiv0QhGq0vX5pBl4yxblyjQKRPHhY1X8UVph0mx5PZGk2LLQ_butsn3gf_jrsrFpujYPh66hCFDis3vaHcQZey2B0KRxkgc8NEodDbtLZ2dogERc7Vi8ftREDeK_9bL838c3Qv2cEa2TAzAPGI7_foKXrL77rpfdetXcc39BMQRK0Q priority: 102 providerName: Taylor & Francis |
| Title | A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service |
| URI | https://www.tandfonline.com/doi/abs/10.1057/s41274-016-0170-7 https://www.jstor.org/stable/48759949 https://link.springer.com/article/10.1057/s41274-016-0170-7 https://www.proquest.com/docview/1990673869 |
| Volume | 68 |
| WOSCitedRecordID | wos000412853800009&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Collection (ProQuest) customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7RQ dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M7S dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection (ProQuest) customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: 7X7 dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central Database Suite (ProQuest) customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library (ProQuest) customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: M2O dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1476-9360 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature – providerCode: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 1476-9360 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009019 issn: 0160-5682 databaseCode: TFW dateStart: 19500301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEF5BixAcKA1UBEq1Bw48tKpjr_dxQqVqhASEkEZt6MWyd9ckUhuX2C3_gN_NjL1uEyRy4TJS_NpN8nkeuzPfEPIqlUbkkQ1YFmcxBCi5ZjpyOcQ8DuyNNobXxPMnn-VgoCYTPfQLbqVPq2x1Yq2obWFwjXy_B2qz7lCp31_-ZNg1CndXfQuNu2QTDLVAnMvRt1vS3aBu7IEkaiwWKmx3NWO5X_IexGMQSGM8LQMmV-zSCmtpm6m44oP-tW1aW6P-1v9-j8fkkfdD6UEDnG1yx8075H6bBt8hW227B-rf_g55uMRd2CHb_nhJX3vq6jdPyO8DCoDEukiWnv-AYavpBUNDaWlLXk6rgoLTSatfBXOYhlrMqQGLbbDYDa67dlOcEV0UV5iRTX3HG4oLxhR-IDNNkVqaWneBVcp0NqdNFdPMlLRsNN9TMu4fjQ8_Mt_pgRkuRMWU5mnIIdbsSeFi53JhpFNOWadzY2zKM-6E0lmeygx0EERhoRNGRSK1uVIu2iEb82LunhEqHDcZD1xkheLa2MzmubIK_GBwvFSmuyRo_-bEeBZ0bMZxntS78bFMGmQkmPmGyEhkl7y9ueWyoQBZd3G8jJ2kqtdd8qZJShKtuW-nBtnNCBhIas1hwrstjhKvXsrkFkRd8q5F4tLpf43yfP3DXpAHIXotdanlLtmoFlfuJblnrqtZudir3y2Up99RTuQe2fxwNBiO4NMnyUB-CQ5Rhl9RymOQw_gM5Oj4BOS4f_oHX0c1UA |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VgngcKA1UDRTYA0g8tGpir_dxQKgCqlYJEYcI9bayd9ckUhu3sduKP8C_4T8ya3vbBInceuDq9-Ob2W92Z74BeJUKw_PY9miWZAkGKLmiKnY5xjwOxxtlDKuF578PxWgkj47UtzX4HWphfFpl8Im1o7aF8XPku310m3WHSvXx9Iz6rlF-dTW00GhgMXA_LzFkKz8cfsb_-zqK9r-MPx3QtqsANYzzikrF0ohhXNMX3CXO5dwIJ520TuXG2JRlzHGpsjwVGeIdGX_kuJExT20upYvxsrfgNoul8GY1EPRa47dX9xHxmm004TIKi6iJ2C1ZH8M_jNt9-C56VCwNg0siqSExcony_rVKWw9--xv_2Wd7BA9blk32GrPYhDU368DdkOTfgY3QzIK0vq0DDxaUGTuw2W4vyZtWmPvtY_i1R9DcfNUnTY9_4FtWkxPqaYAlQZqdVAVBSk2qy4I6n2RbzIhBPmJ8KR8ed-Em_onIvDj3-eak7edD_HQ4wf9hJqkXzibWnfgabDKdkaZGa2pKUjZ-_QmMb-LTbcH6rJi5bSDcMZOxnostl0wZm9k8l1Yiy0daKTPVhV5AlTatxrtvNXKs61yDROgGiNrn9XkgatGFd1ennDYCJ6sOThahqqt6VilvWsDoeMV5WzWmr-7gw2SlGD7wToCtbp1nqa8x24X3AfgLu_91l6erL_YS7h2Mvw718HA0eAb3I8_P6qLSHViv5ufuOdwxF9W0nL-ozZqAvmF7-APnEYj8 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6Vgio4UBqoCBTYA0hAtUpir727B4QqSkTVKsqhQhWXlb0PEqmNS-y24g_wn_h3zNreNkEitx64-v2YmZ1vd-b7AF5nXKcuNn2aJ3mCAMVJKmPrEPNYHG-k1qwmnv96xEcjcXIix2vwO_TC-LLKEBPrQG0K7efIewMMm7VCpey5tixivD_8eP6DegUpv9Ia5DQaEzm0P68QvpUfDvbxX7-JouHn409faKswQDVL04oKybKIIcYZ8NQm1rpUcyusMFY6rU3GcmZTIXOX8RxtH7P_yKZaxGlmnBA2xsvegbscIaavJhwn3274fvu1pojnb6NJKqKwoJrwXskGCAURw3soz_uULw2JS4SpoUhyKf39a8W2HgiHm__xJ3wED9vsm-w17rIFa3bWgY1Q_N-BzSByQdqY14EHC4yNHdhqt5fkbUvY_e4x_Noj6Ia-G5Rmp9_xLavJGfXpgSGBsp1UBcFUm1RXBbW--LaYEY15ivYtfnjcpZ34JyLz4sLXoZNW54f4aXKC_0ZPMk-oTYw9873ZZDojTe_WVJekbOL9Ezi-jU-3DeuzYmafAkkt0znr29ikgkltcuOcMAKzf0w3RS670A8WpnTL_e4lSE5VXYOQcNUYpfL1ft4oFe_C--tTzhvik1UHJ4tmq6p6tsk10jAqXnHedm3f13fw8FlKhg-8E0xYtUG1VDf224Xd4AQLu_91l2erL_YKNtAN1NHB6PA53I982lb3mu7AejW_sC_gnr6spuX8Ze3hBNQtu8MfYXKSIA |
| 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=A+genetic-algorithm-based+approach+to+the+two-echelon+capacitated+vehicle+routing+problem+with+stochastic+demands+in+logistics+service&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Wang%2C+Kangzhou&rft.au=Lan%2C+Shulin&rft.au=Zhao%2C+Yingxue&rft.date=2017-11-01&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=68&rft.issue=11&rft.spage=1409&rft.epage=1421&rft_id=info:doi/10.1057%2Fs41274-016-0170-7&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon |