Efficient implementation of the genetic algorithm to solve rich vehicle routing problems
The aim of this paper is to further study the rich vehicle routing problem (RVRP), which is a well-known combinatorial optimization problem arising in many transportation and logistics settings. This problem is known to be subject to a number of real life constraints, such as the number and capacity...
Saved in:
| Published in | Operational research Vol. 21; no. 3; pp. 1763 - 1791 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.09.2021
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1109-2858 1866-1505 |
| DOI | 10.1007/s12351-019-00521-0 |
Cover
| Abstract | The aim of this paper is to further study the rich vehicle routing problem (RVRP), which is a well-known combinatorial optimization problem arising in many transportation and logistics settings. This problem is known to be subject to a number of real life constraints, such as the number and capacity limitation of vehicles, time constraints including ready and due dates for each customer, heterogeneous vehicle fleets and different warehouses for vehicles. A Genetic Algorithm (GA)-based approach is proposed to tackle this highly constrained problem. The proposed approach efficiently resolves the problem despite its high complexity. To the best of our knowledge, no GA have been used for solving multi-depot heterogeneous limited fleet VRP with time windows so far. The new algorithm has been tested on benchmark and real-world instances. In fact, promising computational results have shown its good cost-effectiveness. |
|---|---|
| AbstractList | The aim of this paper is to further study the rich vehicle routing problem (RVRP), which is a well-known combinatorial optimization problem arising in many transportation and logistics settings. This problem is known to be subject to a number of real life constraints, such as the number and capacity limitation of vehicles, time constraints including ready and due dates for each customer, heterogeneous vehicle fleets and different warehouses for vehicles. A Genetic Algorithm (GA)-based approach is proposed to tackle this highly constrained problem. The proposed approach efficiently resolves the problem despite its high complexity. To the best of our knowledge, no GA have been used for solving multi-depot heterogeneous limited fleet VRP with time windows so far. The new algorithm has been tested on benchmark and real-world instances. In fact, promising computational results have shown its good cost-effectiveness. |
| Author | Rabbouch, Bochra Saâdaoui, Foued Mraihi, Rafaa |
| Author_xml | – sequence: 1 givenname: Bochra surname: Rabbouch fullname: Rabbouch, Bochra organization: Institut Supérieur de Gestion de Tunis, Université de Tunis – sequence: 2 givenname: Foued orcidid: 0000-0002-0574-2922 surname: Saâdaoui fullname: Saâdaoui, Foued email: foued.saadaoui@gmail.com organization: Department of Statistics, Faculty of Sciences, King Abdulaziz University – sequence: 3 givenname: Rafaa surname: Mraihi fullname: Mraihi, Rafaa organization: Ecole Supérieure de Commerce de Tunis, Université de Manouba |
| BookMark | eNp9kE9LwzAYh4NMcM59AU8Bz9UkbbL0KGP-gYEXBW-hTd-0GW0zk2zgtzdaQfCwXPILvM_7C88lmo1uBISuKbmlhKzuAmU5pxmhZUYIZymdoTmVQmSUEz5LmZIyY5LLC7QMYUfSydlKFnKO3jfGWG1hjNgO-x6GlKpo3YidwbED3MII0Wpc9a3zNnYDjg4H1x8Be6s7fITO6j493CHascV77-q0Jlyhc1P1AZa_9wK9PWxe10_Z9uXxeX2_zXRRsJg1XFDDhZYNIcxQqE2jSxCNKSUY2dSEQ53npdYEdGFI1WgmuNEcTFmJpmH5At1Me1PxxwFCVDt38GOqVIwLKWlRiiJNsWlKexeCB6P23g6V_1SUqG-JapKokkT1I1GRBMl_kLaTnOgr259G8wkNqWdswf_96gT1BSxCiok |
| CitedBy_id | crossref_primary_10_1007_s12351_020_00600_7 crossref_primary_10_1007_s12351_021_00663_0 crossref_primary_10_1080_17509653_2024_2422308 crossref_primary_10_1080_0305215X_2023_2190103 crossref_primary_10_1109_ACCESS_2022_3206947 crossref_primary_10_1080_03610918_2022_2160460 crossref_primary_10_1007_s12351_021_00639_0 crossref_primary_10_1007_s13369_020_04612_5 crossref_primary_10_1109_TITS_2022_3197424 crossref_primary_10_1007_s12351_023_00751_3 crossref_primary_10_1109_ACCESS_2024_3406222 crossref_primary_10_1109_TCE_2023_3335392 |
| Cites_doi | 10.1016/j.trc.2010.07.008 10.1287/opre.1120.1048 10.1016/j.ejor.2014.07.048 10.1007/s12351-018-0403-4 10.1016/j.endm.2017.03.023 10.1080/0952813X.2019.1652356 10.1057/palgrave.jors.2601707 10.17148/IJARCCE.2014.31118 10.1111/j.1475-3995.2006.00557.x 10.1109/TASE.2009.2019265 10.1016/j.jocs.2017.04.003 10.1080/0305215X.2013.791813 10.1007/s12351-018-0421-2 10.1016/j.endm.2018.01.008 10.1007/s12351-018-0396-z 10.1016/j.csda.2008.11.011 10.1016/j.cie.2017.05.001 10.1016/j.ejor.2019.02.048 10.1007/s10479-017-2576-2 10.1016/j.aei.2018.08.006 10.1287/ijoc.8.2.165 10.1016/j.swevo.2018.08.012 10.1145/2666003 10.1016/j.eswa.2014.03.028 10.1016/j.ejor.2019.01.041 10.1016/j.asoc.2019.03.008 10.1007/s10732-005-5432-5 10.1016/j.neucom.2017.04.026 10.1007/s12351-019-00452-w 10.1007/s12351-017-0314-9 10.1007/s10878-014-9767-4 10.1590/0101-7438.2016.036.03.0421 10.1057/palgrave.jors.2601163 10.1007/s12351-017-0363-0 10.1007/s12351-015-0173-1 10.1016/j.jclepro.2019.03.185 10.1007/s00500-016-2114-1 10.1016/j.cam.2015.03.050 10.1016/j.eswa.2019.02.009 10.1007/978-3-319-76351-4_15 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2019 Springer-Verlag GmbH Germany, part of Springer Nature 2019. |
| Copyright_xml | – notice: Springer-Verlag GmbH Germany, part of Springer Nature 2019 – notice: Springer-Verlag GmbH Germany, part of Springer Nature 2019. |
| DBID | AAYXX CITATION 3V. 7TB 7WY 7WZ 7XB 87Z 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G HCIFZ K60 K6~ K8~ KR7 L.- L6V M0C M7S PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PTHSS Q9U |
| DOI | 10.1007/s12351-019-00521-0 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Business Premium Collection Technology Collection (via ProQuest SciTech Premium Collection) ProQuest One ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) SciTech Premium Collection (via ProQuest) ProQuest Business Collection (Alumni Edition) ProQuest Business Collection DELNET Management Collection Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Engineering Database (Proquest) ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Engineering Collection Business Premium Collection Civil Engineering Abstracts ABI/INFORM Global Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest DELNET Management Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) Business Premium Collection (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | ABI/INFORM Global (Corporate) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1866-1505 |
| EndPage | 1791 |
| ExternalDocumentID | 10_1007_s12351_019_00521_0 |
| GroupedDBID | -57 -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 30V 3V. 4.4 406 408 40D 40E 5VS 67Z 6NX 7WY 875 8FE 8FG 8FL 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTV ABHQN ABJCF ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYQZM B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DDRTE DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GROUPED_ABI_INFORM_COMPLETE H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HZ~ IKXTQ IWAJR IXD I~X I~Z J-C J0Z JBSCW JZLTJ K60 K6~ K8~ KOV L6V LLZTM M0C M4Y M7S MA- NPVJJ NQJWS NU0 O9- O93 O9G O9J P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 YLTOR Z45 Z5O Z81 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 7TB 7XB 8FD 8FK FR3 KR7 L.- PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c442t-d561f56c8d002f1ebfdc9e6df98ef8db05eb339cc0ec4f0adc265fc5ef9a6dd23 |
| IEDL.DBID | BENPR |
| ISSN | 1109-2858 |
| IngestDate | Fri Jul 25 12:23:06 EDT 2025 Thu Apr 24 23:12:32 EDT 2025 Wed Oct 01 04:21:08 EDT 2025 Fri Feb 21 02:47:49 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Time windows Heterogeneous limited fleet Genetic algorithm Multi depot Rich VRP MDHVRPTW VRPLIB Combinatorial optimization problem |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c442t-d561f56c8d002f1ebfdc9e6df98ef8db05eb339cc0ec4f0adc265fc5ef9a6dd23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0574-2922 |
| PQID | 2568814964 |
| PQPubID | 326268 |
| PageCount | 29 |
| ParticipantIDs | proquest_journals_2568814964 crossref_primary_10_1007_s12351_019_00521_0 crossref_citationtrail_10_1007_s12351_019_00521_0 springer_journals_10_1007_s12351_019_00521_0 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-09-01 |
| PublicationDateYYYYMMDD | 2021-09-01 |
| PublicationDate_xml | – month: 09 year: 2021 text: 2021-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationSubtitle | An International Journal |
| PublicationTitle | Operational research |
| PublicationTitleAbbrev | Oper Res Int J |
| PublicationYear | 2021 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
| References | Eskandarpour, Ouelhadj, Hatami, Juan, Khosravi (CR8) 2019; 277 Yu, Yang (CR45) 2017; 2 Osaba, Yang, Diaz, Onieva, Masegosa, Perallos (CR25) 2016; 21 Potvin, Bengio (CR27) 1996; 8 Rabbouch, Saâdaoui, Mraihi (CR28) 2016; 260 Vidal, Crainic, Gendreau, Lahrichi, Rei (CR40) 2012; 60 Ramalingam, Vivekanandan (CR33) 2014; 3 Souza Neto, Pureza (CR38) 2016; 36 Dondo, Cerdá (CR7) 2006; 13 Xiao, Zhao, Kaku, Mladenovic (CR41) 2014; 46 Tilk, Drexl, Irnich (CR39) 2019; 276 Yahyaoui, Kaabachi, Krichen, Dekdouk (CR42) 2018 Rabbouch, Saâdaoui, Mraihi (CR31) 2019 Caceres-Cruz, Arias, Guimarans, Riera, Juan (CR3) 2015; 47 Oliveira, Mauceri, Carroll, Pallonetto (CR24) 2018; 64 CR35 Derbel, Jarboui, Bhiri (CR6) 2019; 272 Cordeau, Laporte, Mercier (CR5) 2004; 55 Li, Soleimani, Zohal (CR19) 2019; 227 Li, Li, Pardalos (CR18) 2016; 31 Mirabi, Shokri, Sadeghieh (CR21) 2016; 3 Holland (CR13) 1975 Yang, Zhao, Ye, Ma (CR44) 2017 Faiz, Krichen, Inoubli (CR9) 2014; 17 Kaboudani, Ghodsypour, Kia, Shahmardan (CR14) 2018 Yakici (CR43) 2016; 109 Polacek, Hartl, Doerner, Reimann (CR26) 2004; 10 Moussavi, Mahdjoub, Grunder (CR23) 2019; 125 CR29 Harzi, Krichen (CR12) 2017; 58 Krichen, Faiz, Tlili, Tej (CR15) 2014; 41 Lau, Chan, Tsui, Pang (CR17) 2009; 7 Mohammed, Abd Ghani, Hamed, Mostafa, Ahmad, Ibrahim (CR22) 2017; 21 Sicilia, Quemadab, Royoc, Escuínd (CR36) 2016; 291 Goodarzi, Zegordi (CR11) 2018 Bettinelli, Ceselli, Righin (CR2) 2011; 19 Rajabi-Bahaabadi, Shariat-Mohaymany, Babaei, Vigo (CR32) 2019 Alexiou, Katsavounis (CR1) 2015; 15 Sim, Hart, Urquhart, Pigden, Minisci, Vasile, Periaux, Gauger, Giannakoglou, Quagliarella (CR37) 2019 Lahyeni, Khemakhem, Semet (CR16) 2015; 241 Saâdaoui (CR34) 2010; 54 Liu, Jiang (CR20) 2019; 80 Cordeau, Laporte, Mercier (CR4) 2001; 52 Rabbouch, Saâdaoui, Mraihi (CR30) 2018; 38 Ghannadpour, Zarrabi (CR10) 2019; 44 H Derbel (521_CR6) 2019; 272 J Li (521_CR18) 2016; 31 A Bettinelli (521_CR2) 2011; 19 AH Goodarzi (521_CR11) 2018 F Saâdaoui (521_CR34) 2010; 54 D Alexiou (521_CR1) 2015; 15 S Faiz (521_CR9) 2014; 17 MA Mohammed (521_CR22) 2017; 21 JH Holland (521_CR13) 1975 H Rabbouch (521_CR28) 2016; 260 T Vidal (521_CR40) 2012; 60 E Yakici (521_CR43) 2016; 109 SF Ghannadpour (521_CR10) 2019; 44 JY Potvin (521_CR27) 1996; 8 Y Kaboudani (521_CR14) 2018 G Yu (521_CR45) 2017; 2 JA Sicilia (521_CR36) 2016; 291 H Yahyaoui (521_CR42) 2018 JF Cordeau (521_CR5) 2004; 55 S Krichen (521_CR15) 2014; 41 M Eskandarpour (521_CR8) 2019; 277 RG Dondo (521_CR7) 2006; 13 A Ramalingam (521_CR33) 2014; 3 J Caceres-Cruz (521_CR3) 2015; 47 R Lahyeni (521_CR16) 2015; 241 Y Li (521_CR19) 2019; 227 H Yang (521_CR44) 2017 JF Cordeau (521_CR4) 2001; 52 R Liu (521_CR20) 2019; 80 M Rajabi-Bahaabadi (521_CR32) 2019 M Mirabi (521_CR21) 2016; 3 M Polacek (521_CR26) 2004; 10 521_CR29 H Rabbouch (521_CR30) 2018; 38 JF Souza Neto (521_CR38) 2016; 36 B Rabbouch (521_CR31) 2019 521_CR35 Y Xiao (521_CR41) 2014; 46 HCW Lau (521_CR17) 2009; 7 PRC Oliveira (521_CR24) 2018; 64 M Harzi (521_CR12) 2017; 58 K Sim (521_CR37) 2019 SE Moussavi (521_CR23) 2019; 125 C Tilk (521_CR39) 2019; 276 E Osaba (521_CR25) 2016; 21 |
| References_xml | – volume: 19 start-page: 723 issue: 5 year: 2011 end-page: 740 ident: CR2 article-title: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows publication-title: Transp Res Part C doi: 10.1016/j.trc.2010.07.008 – volume: 60 start-page: 611 issue: 3 year: 2012 end-page: 624 ident: CR40 article-title: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems publication-title: Oper Res doi: 10.1287/opre.1120.1048 – volume: 241 start-page: 1 issue: 1 year: 2015 end-page: 14 ident: CR16 article-title: Rich vehicle routing problems: from a taxonomy to a definition publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.07.048 – year: 2018 ident: CR42 article-title: Two metaheuristic approaches for solving the multi-compartment vehicle routing problem publication-title: Oper Res Int J doi: 10.1007/s12351-018-0403-4 – volume: 58 start-page: 175 year: 2017 end-page: 182 ident: CR12 article-title: Variable neighborhood descent for solving the vehicle routing problem with time windows publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2017.03.023 – volume: 3 start-page: 1373 issue: 3 year: 2016 end-page: 1390 ident: CR21 article-title: Modeling and solving the multi-depot vehicle routing problem with time window by considering the flexible end depot in each route publication-title: Int J Supply Oper Manag – volume: 17 start-page: 105 issue: 1 year: 2014 end-page: 110 ident: CR9 article-title: A DSS based on GIS and Tabu search for solving the CVRP: the Tunisian case publication-title: Egypt J Remote Sens Space Sci – year: 2019 ident: CR31 article-title: Empirical mode simulated annealing for solving the capacitated vehicle routing problem publication-title: J Exp Theor Artif Intell doi: 10.1080/0952813X.2019.1652356 – volume: 55 start-page: 542 issue: 5 year: 2004 end-page: 546 ident: CR5 article-title: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problem with time windows publication-title: J Oper Res doi: 10.1057/palgrave.jors.2601707 – volume: 3 start-page: 8433 issue: 11 year: 2014 end-page: 8439 ident: CR33 article-title: Genetic algorithm based solution model for multi-depot vehicle routing problem with time windows publication-title: Int J Adv Res Comput Commun Eng doi: 10.17148/IJARCCE.2014.31118 – volume: 13 start-page: 441 issue: 5 year: 2006 end-page: 459 ident: CR7 article-title: A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows publication-title: Int Trans Oper Res doi: 10.1111/j.1475-3995.2006.00557.x – volume: 7 start-page: 383 issue: 2 year: 2009 end-page: 392 ident: CR17 article-title: Application of genetic algorithms to solve the multidepot vehicle routing problem publication-title: IEEE Trans Autom Sci Eng doi: 10.1109/TASE.2009.2019265 – ident: CR35 – ident: CR29 – volume: 21 start-page: 255 year: 2017 end-page: 262 ident: CR22 article-title: Solving vehicle routing problem by using improved genetic algorithm for optimal solution publication-title: J Comput Sci doi: 10.1016/j.jocs.2017.04.003 – volume: 46 start-page: 1 issue: 4 year: 2014 end-page: 18 ident: CR41 article-title: Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems publication-title: Eng Optim doi: 10.1080/0305215X.2013.791813 – year: 2019 ident: CR37 article-title: A new rich vehicle routing problem model and benchmark resource publication-title: Advances in evolutionary and deterministic methods for design, optimization and control in engineering and sciences – year: 2018 ident: CR11 article-title: Vehicle routing problem in a kanban controlled supply chain system considering cross-docking strategy publication-title: Oper Res Int J doi: 10.1007/s12351-018-0421-2 – volume: 64 start-page: 65 year: 2018 end-page: 74 ident: CR24 article-title: A genetic algorithm for a green vehicle routing problem publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2018.01.008 – year: 2018 ident: CR14 article-title: Vehicle routing and scheduling in cross docks with forward and reverse logistics publication-title: Oper Res Int J doi: 10.1007/s12351-018-0396-z – volume: 54 start-page: 750 issue: 3 year: 2010 end-page: 766 ident: CR34 article-title: Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods publication-title: Comput Stat Data Anal doi: 10.1016/j.csda.2008.11.011 – volume: 109 start-page: 288 year: 2016 end-page: 294 ident: CR43 article-title: A rich min-max vehicle routing problem publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.05.001 – volume: 277 start-page: 479 issue: 2 year: 2019 end-page: 491 ident: CR8 article-title: Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.02.048 – volume: 272 start-page: 243 issue: 1–2 year: 2019 end-page: 272 ident: CR6 article-title: A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem publication-title: Ann Oper Res doi: 10.1007/s10479-017-2576-2 – volume: 38 start-page: 392 year: 2018 end-page: 403 ident: CR30 article-title: A vision-based statistical methodology for automatically modeling continuous urban traffic flows publication-title: Adv Eng Inform doi: 10.1016/j.aei.2018.08.006 – volume: 8 start-page: 165 year: 1996 end-page: 172 ident: CR27 article-title: The vehicle routing problem with time windows part II: genetic search publication-title: INFORMS J Comput doi: 10.1287/ijoc.8.2.165 – volume: 44 start-page: 728 year: 2019 end-page: 747 ident: CR10 article-title: Multi-objective heterogeneous vehicle routing and scheduling problem with energy minimizing publication-title: Swarm Evol Comput doi: 10.1016/j.swevo.2018.08.012 – year: 1975 ident: CR13 publication-title: Adaptation in natural and artificial systems – volume: 47 start-page: 1 issue: 2 year: 2015 end-page: 28 ident: CR3 article-title: Rich vehicle routing problem: survey publication-title: ACM Comput Surv doi: 10.1145/2666003 – volume: 41 start-page: 6483 issue: 14 year: 2014 end-page: 6493 ident: CR15 article-title: Tabu-based GIS for solving the vehicle routing problem publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2014.03.028 – volume: 276 start-page: 549 issue: 2 year: 2019 end-page: 565 ident: CR39 article-title: Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.01.041 – volume: 80 start-page: 18 year: 2019 end-page: 30 ident: CR20 article-title: A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2019.03.008 – volume: 10 start-page: 613 year: 2004 end-page: 627 ident: CR26 article-title: A variable neighborhood search for the multidepot vehicle routing problem with time windows publication-title: J Heuristics doi: 10.1007/s10732-005-5432-5 – volume: 260 start-page: 157 year: 2016 end-page: 173 ident: CR28 article-title: Unsupervised video summarization using cluster analysis for automatic vehicles counting and recognizing publication-title: Neurocomputing doi: 10.1016/j.neucom.2017.04.026 – year: 2019 ident: CR32 article-title: Reliable vehicle routing problem in stochastic networks with correlated travel times publication-title: Oper Res Int J doi: 10.1007/s12351-019-00452-w – volume: 2 start-page: 2 year: 2017 end-page: 8 ident: CR45 article-title: Dynamic routing with real-time traffic information publication-title: Oper Res Int J doi: 10.1007/s12351-017-0314-9 – volume: 31 start-page: 515 issue: 2 year: 2016 end-page: 532 ident: CR18 article-title: Multi-depot vehicle routing problem with time windows under shared depot resources publication-title: J Comb Optim doi: 10.1007/s10878-014-9767-4 – volume: 36 start-page: 421 issue: 3 year: 2016 end-page: 446 ident: CR38 article-title: Modeling and solving a rich vehicle routing problem for the delivery of goods in urban areas publication-title: Pesquisa Operacional doi: 10.1590/0101-7438.2016.036.03.0421 – volume: 52 start-page: 928 issue: 8 year: 2001 end-page: 936 ident: CR4 article-title: A unified tabu search heuristic for vehicle routing problems with time windows publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601163 – year: 2017 ident: CR44 article-title: Disturbance management for vehicle routing with time window changes publication-title: Oper Res Int J doi: 10.1007/s12351-017-0363-0 – volume: 15 start-page: 199 issue: 2 year: 2015 end-page: 211 ident: CR1 article-title: A multi-objective transportation routing problem publication-title: Oper Res Int J doi: 10.1007/s12351-015-0173-1 – volume: 227 start-page: 1161 year: 2019 end-page: 1172 ident: CR19 article-title: An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives publication-title: J Clean Prod doi: 10.1016/j.jclepro.2019.03.185 – volume: 21 start-page: 5295 issue: 18 year: 2016 end-page: 5308 ident: CR25 article-title: A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy publication-title: Soft Comput doi: 10.1007/s00500-016-2114-1 – volume: 291 start-page: 468 year: 2016 end-page: 477 ident: CR36 article-title: An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics publication-title: J Comput Appl Math doi: 10.1016/j.cam.2015.03.050 – volume: 125 start-page: 317 year: 2019 end-page: 332 ident: CR23 article-title: A matheuristic approach to the integration of worker assignment and vehicle routing problems: application to home healthcare scheduling publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.02.009 – volume: 21 start-page: 5295 issue: 18 year: 2016 ident: 521_CR25 publication-title: Soft Comput doi: 10.1007/s00500-016-2114-1 – volume-title: Adaptation in natural and artificial systems year: 1975 ident: 521_CR13 – volume: 21 start-page: 255 year: 2017 ident: 521_CR22 publication-title: J Comput Sci doi: 10.1016/j.jocs.2017.04.003 – volume-title: Advances in evolutionary and deterministic methods for design, optimization and control in engineering and sciences year: 2019 ident: 521_CR37 – ident: 521_CR29 doi: 10.1007/978-3-319-76351-4_15 – volume: 109 start-page: 288 year: 2016 ident: 521_CR43 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.05.001 – volume: 10 start-page: 613 year: 2004 ident: 521_CR26 publication-title: J Heuristics doi: 10.1007/s10732-005-5432-5 – year: 2018 ident: 521_CR42 publication-title: Oper Res Int J doi: 10.1007/s12351-018-0403-4 – year: 2017 ident: 521_CR44 publication-title: Oper Res Int J doi: 10.1007/s12351-017-0363-0 – volume: 44 start-page: 728 year: 2019 ident: 521_CR10 publication-title: Swarm Evol Comput doi: 10.1016/j.swevo.2018.08.012 – volume: 3 start-page: 1373 issue: 3 year: 2016 ident: 521_CR21 publication-title: Int J Supply Oper Manag – volume: 52 start-page: 928 issue: 8 year: 2001 ident: 521_CR4 publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601163 – ident: 521_CR35 – volume: 47 start-page: 1 issue: 2 year: 2015 ident: 521_CR3 publication-title: ACM Comput Surv doi: 10.1145/2666003 – volume: 31 start-page: 515 issue: 2 year: 2016 ident: 521_CR18 publication-title: J Comb Optim doi: 10.1007/s10878-014-9767-4 – volume: 2 start-page: 2 year: 2017 ident: 521_CR45 publication-title: Oper Res Int J doi: 10.1007/s12351-017-0314-9 – volume: 125 start-page: 317 year: 2019 ident: 521_CR23 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2019.02.009 – volume: 15 start-page: 199 issue: 2 year: 2015 ident: 521_CR1 publication-title: Oper Res Int J doi: 10.1007/s12351-015-0173-1 – volume: 272 start-page: 243 issue: 1–2 year: 2019 ident: 521_CR6 publication-title: Ann Oper Res doi: 10.1007/s10479-017-2576-2 – volume: 17 start-page: 105 issue: 1 year: 2014 ident: 521_CR9 publication-title: Egypt J Remote Sens Space Sci – volume: 277 start-page: 479 issue: 2 year: 2019 ident: 521_CR8 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.02.048 – year: 2019 ident: 521_CR31 publication-title: J Exp Theor Artif Intell doi: 10.1080/0952813X.2019.1652356 – volume: 3 start-page: 8433 issue: 11 year: 2014 ident: 521_CR33 publication-title: Int J Adv Res Comput Commun Eng doi: 10.17148/IJARCCE.2014.31118 – volume: 80 start-page: 18 year: 2019 ident: 521_CR20 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2019.03.008 – volume: 227 start-page: 1161 year: 2019 ident: 521_CR19 publication-title: J Clean Prod doi: 10.1016/j.jclepro.2019.03.185 – year: 2019 ident: 521_CR32 publication-title: Oper Res Int J doi: 10.1007/s12351-019-00452-w – volume: 276 start-page: 549 issue: 2 year: 2019 ident: 521_CR39 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.01.041 – volume: 19 start-page: 723 issue: 5 year: 2011 ident: 521_CR2 publication-title: Transp Res Part C doi: 10.1016/j.trc.2010.07.008 – volume: 38 start-page: 392 year: 2018 ident: 521_CR30 publication-title: Adv Eng Inform doi: 10.1016/j.aei.2018.08.006 – volume: 291 start-page: 468 year: 2016 ident: 521_CR36 publication-title: J Comput Appl Math doi: 10.1016/j.cam.2015.03.050 – year: 2018 ident: 521_CR11 publication-title: Oper Res Int J doi: 10.1007/s12351-018-0421-2 – volume: 46 start-page: 1 issue: 4 year: 2014 ident: 521_CR41 publication-title: Eng Optim doi: 10.1080/0305215X.2013.791813 – volume: 64 start-page: 65 year: 2018 ident: 521_CR24 publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2018.01.008 – volume: 13 start-page: 441 issue: 5 year: 2006 ident: 521_CR7 publication-title: Int Trans Oper Res doi: 10.1111/j.1475-3995.2006.00557.x – year: 2018 ident: 521_CR14 publication-title: Oper Res Int J doi: 10.1007/s12351-018-0396-z – volume: 260 start-page: 157 year: 2016 ident: 521_CR28 publication-title: Neurocomputing doi: 10.1016/j.neucom.2017.04.026 – volume: 41 start-page: 6483 issue: 14 year: 2014 ident: 521_CR15 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2014.03.028 – volume: 58 start-page: 175 year: 2017 ident: 521_CR12 publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2017.03.023 – volume: 241 start-page: 1 issue: 1 year: 2015 ident: 521_CR16 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.07.048 – volume: 36 start-page: 421 issue: 3 year: 2016 ident: 521_CR38 publication-title: Pesquisa Operacional doi: 10.1590/0101-7438.2016.036.03.0421 – volume: 60 start-page: 611 issue: 3 year: 2012 ident: 521_CR40 publication-title: Oper Res doi: 10.1287/opre.1120.1048 – volume: 7 start-page: 383 issue: 2 year: 2009 ident: 521_CR17 publication-title: IEEE Trans Autom Sci Eng doi: 10.1109/TASE.2009.2019265 – volume: 8 start-page: 165 year: 1996 ident: 521_CR27 publication-title: INFORMS J Comput doi: 10.1287/ijoc.8.2.165 – volume: 55 start-page: 542 issue: 5 year: 2004 ident: 521_CR5 publication-title: J Oper Res doi: 10.1057/palgrave.jors.2601707 – volume: 54 start-page: 750 issue: 3 year: 2010 ident: 521_CR34 publication-title: Comput Stat Data Anal doi: 10.1016/j.csda.2008.11.011 |
| SSID | ssj0000327848 ssib004298988 |
| Score | 2.3438087 |
| Snippet | The aim of this paper is to further study the rich vehicle routing problem (RVRP), which is a well-known combinatorial optimization problem arising in many... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1763 |
| SubjectTerms | Business and Management Combinatorial analysis Computational Intelligence Constraints Genetic algorithms Logistics Management Science Operations Research Operations Research/Decision Theory Optimization Original Paper Route planning Vehicle routing Vehicles Windows (intervals) |
| SummonAdditionalLinks | – databaseName: SpringerLINK - Czech Republic Consortium dbid: AGYKE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4oXPTg24ii2YM3LSntbt0eiQGJRk-S4KnpvsSo1EDh4K93dmkFiZpwa9LtpN2Znfm2M_MtwLlEHQuRGu-qmfoeDY3vCWZiT2qmcZ2LkDm6pvuHqNujt33WL5rCxmW1e5mSdJ563uwWhMxufWPP_svEq3WoOr6tClRbN0937UUfy0saLueRQ5tec11xTZtQ4IwX_TO_C_4Zo-bAcylX6kJQZxt65cvPKk9eG5NcNOTnEq_jql-3A1sFJiWtmRHtwpoe7sHmAlPhPvTbjmoCIxR5eS9Lzq1OSWYIYkiCdmjbIUn69pyNXvLBO8kzgnY91QQ97YBM9cAKJ6NsYgutSXGQzfgAep3243XXKw5l8CSlQe4pBFyGRZIr9KWmqYVRMtaRMjHXhivhM9yeh7GUvpbU-KmSQcSMZNrEaaRUEB5CZZgN9REQhF6Gihjtg_k0pYYHceqbUEWplpFgugbNUg2JLBjL7cEZb8mca9nOWoKzlrhZS_waXHw_8zHj6_h3dL3UblKs3XGCIJBz3DhGtAaXpbLmt_-Wdrza8BPYCGyBjCtYq0MlH030KSKcXJwVBv0FZ6rweQ priority: 102 providerName: Springer Nature |
| Title | Efficient implementation of the genetic algorithm to solve rich vehicle routing problems |
| URI | https://link.springer.com/article/10.1007/s12351-019-00521-0 https://www.proquest.com/docview/2568814964 |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1866-1505 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: AFBBN dateStart: 20010101 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1866-1505 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: 8FG dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1866-1505 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: AGYKE dateStart: 20010101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1866-1505 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: U2A dateStart: 20010101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Lb9swDCbyuKyHoXuh2dpAh906YY4tefJhGJIhD2xYUAwLkJ0MPZsCbdy1bn__SMVeugHryQYkCzBJkZRIfgR4a5HHxujAP4x0wkUWEm5kKLj10uM-N5mMcE3flvliJb6s5boDy7YWhtIqW50YFbWrLN2Rv0fTrBS687n4dP2LU9coiq62LTR001rBfYwQY13op4SM1YP-ZLo8-_5Q-6oWoCvq6owCb7FebkShBiVVU1mzq69LM0mn7YLT9Sm-_W299i7pP1HUaJxmh_C08SrZeCcGz6Djt8_h4AHW4AtYTyNYBNoYdnHVJo0TV1gVGHqBDCWJChqZvjzH_643V6yuGErmvWeoKzfs3m9ocXZT3VGqNGta0dy-hNVs-uPzgjdtFbgVIq25Q5cpyNwqh9owjLwJzhY-d6FQPihnEokH7KywNvFWhEQ7m-YyWOlDoXPn0uwV9LbV1h8BQ-cpCFMgh2UitAgqLXQSMpdrb3Mj_QBGLblK22COU-uLy3KPlkwkLpHEZSRxmQzg9M831zvEjUdnH7dcKJvdd1vuZWUA71rO7If_v9rrx1d7A09SSmmJKWbH0Ktv7vwJ-iS1GUJXzeZD6I9nk8mSnvOfX6fDRvxwdJWOfwNHCOI1 |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxRBEK4QOIgHgyJxddU-yEk7zs50j90HYnwsWQQ2xkCyt6GfrsmyA7sDxj_Hb6O6t8dFErlxm2Rm-lDv6qr6CuCNQR5rrTz90FMZZYXPqOZeUuO4Qz3XBY9wTYfDcnDMvo34aAWu2lmY0FbZ2sRoqG1twh35e3TNQmA4X7KPZ-c0bI0K1dV2hYZKqxXsToQYS4Md--7Pb0zh5jt7X5Hf23m-2z_6MqBpywA1jOUNtRhBeF4aYdE4-J7T3hrpSuulcF5YnXHMNwtpTOYM85myJi-5N9x5qUprA_ABuoA1VjCJyd_a5_7w-4-b1l60gGDRNxSh0Bfn83qhtCG4SJM8i3m-vOAhu5c0XNfi07_echkC36raRme4uwGPUhRLPi3E7jGsuOkTeHgD23ATRv0IToE-jfw6bZvUgxSQ2hOMOglKbhigJGryE-ncjE9JUxPUhEtH0DaPyaUbh8PJrL4Irdkkrb6ZP4XjeyHwFqxO66l7BgSDNc-0RIniGVPMi1yqzBe2VM6UmrsO9FpyVSZhnIdVG5Nqic4cSFwhiatI4irrwNu__5wtED7u_LrbcqFK2j6vlrLZgXctZ5av_3_a87tPew0PBkeHB9XB3nD_BaznoZ0mtrd1YbWZXbiXGA81-lUSOgIn9y3n15zHHfU |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9xADLYQSKgcqgJFLAU6BzjREdlkJkwOqKoKyxtxKNLeQubFIsGG7mZB_LX-OuzZpEsrwY1bpCRzsL-xPWP7M8CGQR1rXXi-0y4iLhIfcS19xo2TDve5TmSgazo7Tw8vxXFXdqfgT9MLQ2WVjU0MhtqWhu7It9E1K4XhfCq2fV0WcbHX-X7_m9MEKcq0NuM0xhA5cU-PeHwb7h7toa4347iz_-vnIa8nDHAjRFxxi9GDl6lRFg2Dbzvtrclcan2mnFdWRxLPmklmTOSM8FFhTZxKb6TzWZFaS6QHaP5ndojFnbrUOwcv7bxqqMCCV0goxRc689qU1FBS1T08406-OJF0rs84XdTi079-chL8_pevDW6w8wk-1vEr-zEG3DxMuf4CzL1gNVyE7n6gpUBvxm7umvJ00j8rPcN4kyFmqXWSFbfXKNWqd8eqkuEeeHAMrXKPPbgeLc4G5YiKslk99Gb4GS7fRbxLMN0v-24ZGIZpXugMsSQjUQiv4qyIfGLTwplUS9eCdiOu3NTs5jRk4zaf8DKTiHMUcR5EnEct2Pr7z_2Y2-PNr1cbLeT1Ph_mE1S24Fujmcnr11dbeXu1rzCL6M5Pj85PvsCHmOpoQl3bKkxXg5Fbw0Co0usBcQyu3hviz8tyG48 |
| 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=Efficient+implementation+of+the+genetic+algorithm+to+solve+rich+vehicle+routing+problems&rft.jtitle=Operational+research&rft.au=Bochra%2C+Rabbouch&rft.au=Foued%2C+Sa%C3%A2daoui&rft.au=Mraihi+Rafaa&rft.date=2021-09-01&rft.pub=Springer+Nature+B.V&rft.issn=1109-2858&rft.eissn=1866-1505&rft.volume=21&rft.issue=3&rft.spage=1763&rft.epage=1791&rft_id=info:doi/10.1007%2Fs12351-019-00521-0&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1109-2858&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1109-2858&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1109-2858&client=summon |