Large neighborhood search for multi-trip vehicle routing
•Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic configuration tool is used to analyze algorithmic components.•The roulette wheel cannot effectively replace an offline heuristic selection. W...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 255; H. 2; S. 422 - 441 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
Elsevier B.V
01.12.2016
Elsevier Sequoia S.A Elsevier Science |
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic configuration tool is used to analyze algorithmic components.•The roulette wheel cannot effectively replace an offline heuristic selection.
We consider the multi-trip vehicle routing problem, in which each vehicle can perform several routes during the same working shift to serve a set of customers. The problem arises when customers are close to each other or when their demands are large. A common approach consists of solving this problem by combining vehicle routing heuristics with bin packing routines in order to assign routes to vehicles. We compare this approach with a heuristic that makes use of specific operators designed to tackle the routing and the assignment aspects of the problem simultaneously. Two large neighborhood search heuristics are proposed to perform the comparison. We provide insights into the configuration of the proposed algorithms by analyzing the behavior of several of their components. In particular, we question the impact of the roulette wheel mechanism. We also observe that guiding the search with an objective function designed for the multi-trip case is crucial even when exploring the solution space of the vehicle routing problem. We provide several best known solutions for benchmark instances. |
|---|---|
| AbstractList | We consider the multi-trip vehicle routing problem, in which each vehicle can perform several routes during the same working shift to serve a set of customers. The problem arises when customers are close to each other or when their demands are large. A common approach consists of solving this problem by combining vehicle routing heuristics with bin packing routines in order to assign routes to vehicles. We compare this approach with a heuristic that makes use of specific operators designed to tackle the routing and the assignment aspects of the problem simultaneously. Two large neighborhood search heuristics are proposed to perform the comparison. We provide insights into the configuration of the proposed algorithms by analyzing the behavior of several of their components. In particular, we question the impact of the roulette wheel mechanism. We also observe that guiding the search with an objective function designed for the multi-trip case is crucial even when exploring the solution space of the vehicle routing problem. We provide several best known solutions for benchmark instances. •Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic configuration tool is used to analyze algorithmic components.•The roulette wheel cannot effectively replace an offline heuristic selection. We consider the multi-trip vehicle routing problem, in which each vehicle can perform several routes during the same working shift to serve a set of customers. The problem arises when customers are close to each other or when their demands are large. A common approach consists of solving this problem by combining vehicle routing heuristics with bin packing routines in order to assign routes to vehicles. We compare this approach with a heuristic that makes use of specific operators designed to tackle the routing and the assignment aspects of the problem simultaneously. Two large neighborhood search heuristics are proposed to perform the comparison. We provide insights into the configuration of the proposed algorithms by analyzing the behavior of several of their components. In particular, we question the impact of the roulette wheel mechanism. We also observe that guiding the search with an objective function designed for the multi-trip case is crucial even when exploring the solution space of the vehicle routing problem. We provide several best known solutions for benchmark instances. |
| Author | Arda, Yasemin Crama, Yves François, Véronique Laporte, Gilbert |
| Author_xml | – sequence: 1 givenname: Véronique surname: François fullname: François, Véronique email: veronique.francois@ulg.ac.be organization: QuantOM, HEC Management School, University of Liège, Belgium – sequence: 2 givenname: Yasemin surname: Arda fullname: Arda, Yasemin email: yasemin.arda@ulg.ac.be organization: QuantOM, HEC Management School, University of Liège, Belgium – sequence: 3 givenname: Yves orcidid: 0000-0002-7470-4743 surname: Crama fullname: Crama, Yves email: yves.crama@ulg.ac.be organization: QuantOM, HEC Management School, University of Liège, Belgium – sequence: 4 givenname: Gilbert surname: Laporte fullname: Laporte, Gilbert email: gilbert.laporte@cirrelt.ca organization: Canada Research Chair in Distribution Management, HEC Montréal, Canada |
| BookMark | eNp9kcFq3DAQhkVJoJukL9CToZde7M7Ili1DLyU0aWGhl_Y8yNqxV8ZrbSV7oW9fLc4ph5xmBr5vYOa_Ezezn1mIjwgFAtZfxoJHHwqZ-gKqAmr1TuxQNzKvdQ03Ygdl0-RSYvNe3MU4AgAqVDuh9yYMnM3shmPnw9H7QxbZBHvMeh-y0zotLl-CO2cXPjo7cRb8urh5eBC3vZkif3ip9-LP0_ffjz_y_a_nn4_f9rlVJSy51ljpTvZpKlsrOzBgTStljT320LM1bA5oZFNZjUo3jZSm06xsZbDrwJb3otz2To4HJh86RxdJ3ritX6eBjKWOKS3VhG1bYZ2sz5t1Dv7vynGhk4uWp8nM7NdIqEulVAsKE_rpFTr6NczppkRBXZWq1ldKb5QNPsbAPVm3mMX5eQnGTYRA1yBopGsQdA2CoKIURFLlK_Uc3MmEf29LXzeJ028vjgNF63i2fHCB7UIH797S_wMEpKLa |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1007_s10288_018_0389_z crossref_primary_10_1007_s12351_020_00600_7 crossref_primary_10_1016_j_cie_2022_108597 crossref_primary_10_7250_itms_2020_0008 crossref_primary_10_1016_j_cie_2024_110733 crossref_primary_10_1016_j_ejor_2020_10_045 crossref_primary_10_1007_s00291_021_00656_7 crossref_primary_10_1016_j_ejor_2024_02_003 crossref_primary_10_1142_S0217595922500464 crossref_primary_10_1016_j_ejor_2024_04_011 crossref_primary_10_1016_j_compag_2019_02_001 crossref_primary_10_1088_1742_6596_1952_4_042070 crossref_primary_10_1109_TITS_2022_3156547 crossref_primary_10_1007_s44443_025_00127_x crossref_primary_10_1016_j_ejor_2024_03_039 crossref_primary_10_3390_a18090536 crossref_primary_10_1080_23249935_2025_2501198 crossref_primary_10_1016_j_cie_2019_106242 crossref_primary_10_1016_j_cor_2025_107086 crossref_primary_10_1287_trsc_2019_0909 crossref_primary_10_1080_01966324_2018_1451418 crossref_primary_10_1016_j_ejor_2020_09_022 crossref_primary_10_1016_j_cstp_2025_101373 crossref_primary_10_1155_2023_9902545 crossref_primary_10_1007_s10878_023_01016_7 crossref_primary_10_1007_s41604_018_0009_2 crossref_primary_10_1007_s10288_020_00433_2 crossref_primary_10_1007_s40747_025_01815_x crossref_primary_10_1080_00207543_2021_1955994 crossref_primary_10_1287_inte_2023_0049 crossref_primary_10_1007_s10100_019_00625_0 crossref_primary_10_1016_j_asoc_2024_111482 crossref_primary_10_1016_j_eswa_2022_119145 crossref_primary_10_1109_TETCI_2018_2886585 crossref_primary_10_1016_j_cor_2024_106826 crossref_primary_10_1016_j_tre_2025_103976 crossref_primary_10_3390_systems12060205 crossref_primary_10_1016_j_cor_2019_01_002 crossref_primary_10_1016_j_cor_2023_106189 crossref_primary_10_1016_j_cor_2022_105696 crossref_primary_10_3390_wevj15020069 crossref_primary_10_1016_j_cor_2019_07_019 crossref_primary_10_1016_j_trb_2023_102851 crossref_primary_10_1080_17509653_2018_1445045 crossref_primary_10_1007_s11067_019_09492_3 crossref_primary_10_1016_j_cie_2020_106571 crossref_primary_10_1007_s10479_021_04488_0 crossref_primary_10_1016_j_cor_2021_105491 |
| Cites_doi | 10.1287/ijoc.1110.0495 10.1016/0377-2217(93)90221-8 10.1016/j.ejor.2004.09.004 10.1007/s11721-011-0061-0 10.1007/BF02430370 10.1057/palgrave.jors.2600595 10.1287/opre.42.4.626 10.1287/mnsc.18.11.664 10.1007/s10288-016-0306-2 10.1016/S0377-2217(00)00100-4 10.1057/jors.1996.133 10.1016/S0166-218X(03)00434-7 10.1016/j.trb.2003.07.001 10.1287/trsc.1050.0135 10.1287/opre.40.6.1086 10.1007/s10852-007-9069-2 10.1016/j.ejor.2013.06.012 10.1016/j.cor.2005.09.012 10.1016/S0305-0548(03)00158-8 10.1002/net.3230230804 10.1016/j.cor.2005.02.044 |
| ContentType | Journal Article |
| Contributor | QuantOM - Centre for Quantitative Methods and Operations Management |
| Contributor_xml | – sequence: 1 fullname: QuantOM - Centre for Quantitative Methods and Operations Management |
| Copyright | 2016 Elsevier B.V. Copyright Elsevier Sequoia S.A. Dec 1, 2016 |
| Copyright_xml | – notice: 2016 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Dec 1, 2016 |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D JLOSS Q33 |
| DOI | 10.1016/j.ejor.2016.04.065 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Université de Liège - Open Repository and Bibliography (ORBI) (Open Access titles only) Université de Liège - Open Repository and Bibliography (ORBI) |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 441 |
| ExternalDocumentID | oai_orbi_ulg_ac_be_2268_199416 4127313631 10_1016_j_ejor_2016_04_065 S0377221716303034 |
| Genre | Feature |
| 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 AJBFU 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 7SC 7TB 8FD AFXIZ AGCQF AGRNS FR3 JQ2 L7M L~C L~D SSH JLOSS Q33 |
| ID | FETCH-LOGICAL-c530t-88148b2fc5339c2b0a0ca92261f1f0fecaead1a274c81587722ab8e5c4a1bb0c3 |
| ISICitedReferencesCount | 51 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380625800010&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 1872-6860 |
| IngestDate | Sat Nov 29 01:26:01 EST 2025 Sun Sep 28 03:05:04 EDT 2025 Mon Jul 14 10:40:58 EDT 2025 Sat Nov 29 01:41:16 EST 2025 Tue Nov 18 22:41:08 EST 2025 Fri Feb 23 02:27:38 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Automatic algorithm configuration Vehicle routing Multi-trip Large neighborhood search Transportation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c530t-88148b2fc5339c2b0a0ca92261f1f0fecaead1a274c81587722ab8e5c4a1bb0c3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 scopus-id:2-s2.0-84969924840 |
| ORCID | 0000-0002-7470-4743 0000-0002-8777-8565 0000-0002-0454-7164 |
| OpenAccessLink | https://orbi.uliege.be/handle/2268/199416 |
| PQID | 1806435681 |
| PQPubID | 45678 |
| PageCount | 20 |
| ParticipantIDs | liege_orbi_v2_oai_orbi_ulg_ac_be_2268_199416 proquest_miscellaneous_1835559051 proquest_journals_1806435681 crossref_citationtrail_10_1016_j_ejor_2016_04_065 crossref_primary_10_1016_j_ejor_2016_04_065 elsevier_sciencedirect_doi_10_1016_j_ejor_2016_04_065 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-12-01 |
| PublicationDateYYYYMMDD | 2016-12-01 |
| PublicationDate_xml | – month: 12 year: 2016 text: 2016-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2016 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A Elsevier Science |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A – name: Elsevier Science |
| References | Rochat, Taillard (bib0018) 1995; 1 Mingozzi, Roberti, Toth (bib0011) 2013; 25 Petch, Salhi (bib0014) 2004; 133 Ropke, Pisinger (bib0019) 2006; 40 Hansen, Mladenović (bib0009) 2001; 130 López-Ibáñez, Dubois-Lacoste, Stützle, Birattari (bib0010) 2011 Taillard (bib0023) 1993; 23 Fleischmann (bib0007) 1990 Brandão, Mercer (bib0001) 1998; 49 Gendreau, Hertz, Laporte (bib0008) 1992; 40 Taillard, Laporte, Gendreau (bib0024) 1996; 47 Prins (bib0017) 2004; 31 Cattaruzza, Absi, Feillet, Vidal (bib0002) 2014; 236 Cattaruzza, Absi, Feillet (bib0003) 2016 Tillman, Cain (bib0025) 1972; 18 Salhi, Petch (bib0021) 2007; 6 Shaw (bib0022) 1998; 1520 Ropke, Pisinger (bib0020) 2006; 171 Pisinger, Ropke (bib0015) 2007; 34 Potvin, Rousseau (bib0016) 1993; 66 Pellegrini, Birattari, Stützle (bib0013) 2012; 6 Diana, Dessouky (bib0005) 2004; 38 Olivera, Viera (bib0012) 2007; 34 Fisher (bib0006) 1994; 42 Christofides, Mingozzi, Toth (bib0004) 1979 Cattaruzza (10.1016/j.ejor.2016.04.065_sbref0003) 2016 Fisher (10.1016/j.ejor.2016.04.065_bib0006) 1994; 42 Olivera (10.1016/j.ejor.2016.04.065_bib0012) 2007; 34 López-Ibáñez (10.1016/j.ejor.2016.04.065_bib0010) 2011 Pellegrini (10.1016/j.ejor.2016.04.065_bib0013) 2012; 6 Shaw (10.1016/j.ejor.2016.04.065_bib0022) 1998; 1520 Diana (10.1016/j.ejor.2016.04.065_bib0005) 2004; 38 Taillard (10.1016/j.ejor.2016.04.065_bib0024) 1996; 47 Rochat (10.1016/j.ejor.2016.04.065_bib0018) 1995; 1 Cattaruzza (10.1016/j.ejor.2016.04.065_bib0002) 2014; 236 Hansen (10.1016/j.ejor.2016.04.065_bib0009) 2001; 130 Pisinger (10.1016/j.ejor.2016.04.065_bib0015) 2007; 34 Christofides (10.1016/j.ejor.2016.04.065_bib0004) 1979 Ropke (10.1016/j.ejor.2016.04.065_bib0020) 2006; 171 Gendreau (10.1016/j.ejor.2016.04.065_bib0008) 1992; 40 Fleischmann (10.1016/j.ejor.2016.04.065_bib0007) 1990 Mingozzi (10.1016/j.ejor.2016.04.065_bib0011) 2013; 25 Petch (10.1016/j.ejor.2016.04.065_bib0014) 2004; 133 Ropke (10.1016/j.ejor.2016.04.065_bib0019) 2006; 40 Taillard (10.1016/j.ejor.2016.04.065_bib0023) 1993; 23 Potvin (10.1016/j.ejor.2016.04.065_bib0016) 1993; 66 Tillman (10.1016/j.ejor.2016.04.065_bib0025) 1972; 18 Brandão (10.1016/j.ejor.2016.04.065_bib0001) 1998; 49 Prins (10.1016/j.ejor.2016.04.065_bib0017) 2004; 31 Salhi (10.1016/j.ejor.2016.04.065_bib0021) 2007; 6 |
| References_xml | – volume: 23 start-page: 661 year: 1993 end-page: 673 ident: bib0023 article-title: Parallel iterative search methods for vehicle routing problems publication-title: Networks – volume: 25 start-page: 193 year: 2013 end-page: 207 ident: bib0011 article-title: An exact algorithm for the multitrip vehicle routing problem publication-title: INFORMS Journal on Computing – volume: 34 start-page: 28 year: 2007 end-page: 47 ident: bib0012 article-title: Adaptive memory programming for the vehicle routing problem with multiple trips publication-title: Computers and Operations Research – volume: 1 start-page: 147 year: 1995 end-page: 167 ident: bib0018 article-title: Probabilistic diversification and intensification in local search for vehicle routing publication-title: Journal of Heuristics – volume: 47 start-page: 1065 year: 1996 end-page: 1070 ident: bib0024 article-title: Vehicle routing with multiple use of vehicles publication-title: Journal of the Operational Research Society – volume: 18 start-page: 664 year: 1972 end-page: 682 ident: bib0025 article-title: An upper bound algorithm for the single and multiple terminal delivery problem publication-title: Management Science – volume: 31 start-page: 1985 year: 2004 end-page: 2002 ident: bib0017 article-title: A simple and effective evolutionary algorithm for the vehicle routing problem publication-title: Computers & Operations Research – volume: 49 start-page: 799 year: 1998 end-page: 805 ident: bib0001 article-title: The multi-trip vehicle routing problem publication-title: Journal of the Operational Research Society – year: 2016 ident: bib0003 article-title: Vehicle routing problems with multiple trips publication-title: 4OR: A Quarterly Journal of Operations Research – volume: 171 start-page: 750 year: 2006 end-page: 775 ident: bib0020 article-title: A unified heuristic for a large class of vehicle routing problems with backhauls publication-title: European Journal of Operational Research – year: 2011 ident: bib0010 – volume: 1520 start-page: 417 year: 1998 end-page: 431 ident: bib0022 article-title: Using constraint programming and local search methods to solve vehicle routing problems publication-title: Proceedings of the fourth international conference on principles and practice of constraint programming, Cp-98 – volume: 38 start-page: 539 year: 2004 end-page: 557 ident: bib0005 article-title: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows publication-title: Transportation Research Part B: Methodological – start-page: 315 year: 1979 end-page: 338 ident: bib0004 article-title: The vehicle routing problem publication-title: Combinatorial optimization – year: 1990 ident: bib0007 – volume: 34 start-page: 2403 year: 2007 end-page: 2435 ident: bib0015 article-title: A general heuristic for vehicle routing problems publication-title: Computers and Operations Research – volume: 40 start-page: 455 year: 2006 end-page: 472 ident: bib0019 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: Transportation Science – volume: 236 start-page: 833 year: 2014 end-page: 848 ident: bib0002 article-title: A memetic algorithm for the multi trip vehicle routing problem publication-title: European Journal of Operational Research – volume: 42 start-page: 626 year: 1994 end-page: 642 ident: bib0006 article-title: Optimal solution of vehicle routing problems using minimum k-trees publication-title: Operations Research – volume: 133 start-page: 69 year: 2004 end-page: 92 ident: bib0014 article-title: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips publication-title: Discrete Applied Mathematics – volume: 6 start-page: 23 year: 2012 end-page: 48 ident: bib0013 article-title: A critical analysis of parameter adaptation in ant colony optimization publication-title: Swarm Intelligence – volume: 40 start-page: 1086 year: 1992 end-page: 1094 ident: bib0008 article-title: New insertion and postoptimization procedures for the traveling salesman problem publication-title: Operations Research – volume: 66 start-page: 331 year: 1993 end-page: 340 ident: bib0016 article-title: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows publication-title: European Journal of Operational Research – volume: 130 start-page: 449 year: 2001 end-page: 467 ident: bib0009 article-title: Variable neighborhood search: principles and applications publication-title: European Journal of Operational Research – volume: 6 start-page: 591 year: 2007 end-page: 613 ident: bib0021 article-title: A GA based heuristic for the vehicle routing problem with multiple trips publication-title: Journal of Mathematical Modelling and Algorithms – volume: 25 start-page: 193 issue: 2 year: 2013 ident: 10.1016/j.ejor.2016.04.065_bib0011 article-title: An exact algorithm for the multitrip vehicle routing problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1110.0495 – volume: 66 start-page: 331 issue: 3 year: 1993 ident: 10.1016/j.ejor.2016.04.065_bib0016 article-title: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90221-8 – volume: 171 start-page: 750 year: 2006 ident: 10.1016/j.ejor.2016.04.065_bib0020 article-title: A unified heuristic for a large class of vehicle routing problems with backhauls publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.09.004 – volume: 6 start-page: 23 issue: 1 year: 2012 ident: 10.1016/j.ejor.2016.04.065_bib0013 article-title: A critical analysis of parameter adaptation in ant colony optimization publication-title: Swarm Intelligence doi: 10.1007/s11721-011-0061-0 – volume: 1 start-page: 147 year: 1995 ident: 10.1016/j.ejor.2016.04.065_bib0018 article-title: Probabilistic diversification and intensification in local search for vehicle routing publication-title: Journal of Heuristics doi: 10.1007/BF02430370 – volume: 49 start-page: 799 year: 1998 ident: 10.1016/j.ejor.2016.04.065_bib0001 article-title: The multi-trip vehicle routing problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600595 – volume: 42 start-page: 626 year: 1994 ident: 10.1016/j.ejor.2016.04.065_bib0006 article-title: Optimal solution of vehicle routing problems using minimum k-trees publication-title: Operations Research doi: 10.1287/opre.42.4.626 – volume: 18 start-page: 664 year: 1972 ident: 10.1016/j.ejor.2016.04.065_bib0025 article-title: An upper bound algorithm for the single and multiple terminal delivery problem publication-title: Management Science doi: 10.1287/mnsc.18.11.664 – year: 2016 ident: 10.1016/j.ejor.2016.04.065_sbref0003 article-title: Vehicle routing problems with multiple trips publication-title: 4OR: A Quarterly Journal of Operations Research doi: 10.1007/s10288-016-0306-2 – volume: 130 start-page: 449 issue: 3 year: 2001 ident: 10.1016/j.ejor.2016.04.065_bib0009 article-title: Variable neighborhood search: principles and applications publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00100-4 – volume: 1520 start-page: 417 year: 1998 ident: 10.1016/j.ejor.2016.04.065_bib0022 article-title: Using constraint programming and local search methods to solve vehicle routing problems – volume: 47 start-page: 1065 year: 1996 ident: 10.1016/j.ejor.2016.04.065_bib0024 article-title: Vehicle routing with multiple use of vehicles publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1996.133 – volume: 133 start-page: 69 year: 2004 ident: 10.1016/j.ejor.2016.04.065_bib0014 article-title: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(03)00434-7 – volume: 38 start-page: 539 issue: 6 year: 2004 ident: 10.1016/j.ejor.2016.04.065_bib0005 article-title: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2003.07.001 – volume: 40 start-page: 455 year: 2006 ident: 10.1016/j.ejor.2016.04.065_bib0019 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.1050.0135 – volume: 40 start-page: 1086 year: 1992 ident: 10.1016/j.ejor.2016.04.065_bib0008 article-title: New insertion and postoptimization procedures for the traveling salesman problem publication-title: Operations Research doi: 10.1287/opre.40.6.1086 – volume: 6 start-page: 591 year: 2007 ident: 10.1016/j.ejor.2016.04.065_bib0021 article-title: A GA based heuristic for the vehicle routing problem with multiple trips publication-title: Journal of Mathematical Modelling and Algorithms doi: 10.1007/s10852-007-9069-2 – start-page: 315 year: 1979 ident: 10.1016/j.ejor.2016.04.065_bib0004 article-title: The vehicle routing problem – year: 1990 ident: 10.1016/j.ejor.2016.04.065_bib0007 article-title: The vehicle routing problem with multiple use of vehicles – volume: 236 start-page: 833 year: 2014 ident: 10.1016/j.ejor.2016.04.065_bib0002 article-title: A memetic algorithm for the multi trip vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.06.012 – volume: 34 start-page: 2403 year: 2007 ident: 10.1016/j.ejor.2016.04.065_bib0015 article-title: A general heuristic for vehicle routing problems publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.09.012 – volume: 31 start-page: 1985 year: 2004 ident: 10.1016/j.ejor.2016.04.065_bib0017 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: 23 start-page: 661 year: 1993 ident: 10.1016/j.ejor.2016.04.065_bib0023 article-title: Parallel iterative search methods for vehicle routing problems publication-title: Networks doi: 10.1002/net.3230230804 – year: 2011 ident: 10.1016/j.ejor.2016.04.065_bib0010 article-title: The irace package, iterated race for automatic algorithm configuration – volume: 34 start-page: 28 year: 2007 ident: 10.1016/j.ejor.2016.04.065_bib0012 article-title: Adaptive memory programming for the vehicle routing problem with multiple trips publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.02.044 |
| SSID | ssj0001515 |
| Score | 2.463651 |
| Snippet | •Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic... We consider the multi-trip vehicle routing problem, in which each vehicle can perform several routes during the same working shift to serve a set of customers.... |
| SourceID | liege proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 422 |
| SubjectTerms | Algorithm configuration Automatic algorithm configuration Benchmarking Business & economic sciences Customers Heuristic Integer programming Large neighborhood search Motor vehicle fleets Multi-trip Operational research Packing problem Problem solving Production, distribution & gestion de la chaîne logistique Production, distribution & supply chain management Route selection Sciences économiques & de gestion Searching Solution space Studies Transportation Vehicle routing Vehicles |
| Title | Large neighborhood search for multi-trip vehicle routing |
| URI | https://dx.doi.org/10.1016/j.ejor.2016.04.065 https://www.proquest.com/docview/1806435681 https://www.proquest.com/docview/1835559051 https://orbi.uliege.be/handle/2268/199416 |
| Volume | 255 |
| WOSCitedRecordID | wos000380625800010&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: ScienceDirect Freedom Collection 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/eLvHCXMwtV1fb9MwELfKihB74E8BURgoSLyVTInjNPbjNA0BmiYkhlSeLMdxoVWXTFla7Yvs-3JnO2nVwgRIvESpEyeu73J3Pt_9jpC31CS5poqFdJxkIStEGvIiFeEUdFkh4EIiXLGJ7OyMTybic6930-bCrBZZWfLra3H5X0kNbUBsTJ39C3J3D4UGOAeiwxHIDsc_IvwpxnaPSnR5An0tarF3bWBEoQ0gDBsQFaOV-YF9R3W1bFoF9isfvbdXoaFuPYceIqhzJaP5a7fcs8qXV3cb8Ai866K6PVcV1lb9BqrzYtax5XGtLlz7ah3ReKos5Lr1288QiKvZdFDE461gj93MGZetlWUhpS5v89A44cszGo65qy_QSmfqUHw9G9INWctcQrNX28zhZ-1oBOecmB-aeYXwr_HYItu6-hRbSNtfcFA4JrBRQfYl7A7p0ywVICz7Rx9PJp86FY9WoN2e8n_CZ2O5wMHtN_3O4ukvMCxixwawhs35I_LAr0iCI8dJj0nPlANyr02IGJCHbeGPwOuBAdnfQLF8QrjluGCT4wLHHgFwXLDmuMBzXOA57in5-v7k_PhD6AtyhDpNoibkHBbPOZ3Cr0Romkcq0kqAAR9P42k0NVqBXIoVzZjmccpxMlXOTaqZivM80skzsldWpXlOAk0LruChoogFKxgsm0XBEJtSi0wbTYckbidNao9Wj0VTFrINS5xLnGiJEy0jJmGih2TU9bl0WC233p22tJDe2nRWpATWubXfO0s4WdX5TK6oRIB2e75cfJdKy9xImBIuEXU7Hg_JQUtf6b_ZKxlzXAkg9t-QvOkug2DH3TpVmmqJ98BSIEX4vBf_ONKX5P76ezwge029NK_IXb1qZlf1a8_TPwGKiMe2 |
| 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=Large+neighborhood+search+for+multi-trip+vehicle+routing&rft.jtitle=European+journal+of+operational+research&rft.au=Fran%C3%A7ois%2C+V%C3%A9ronique&rft.au=Arda%2C+Yasemin&rft.au=Crama%2C+Yves&rft.au=Laporte%2C+Gilbert&rft.date=2016-12-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=255&rft.issue=2&rft.spage=422&rft.epage=441&rft_id=info:doi/10.1016%2Fj.ejor.2016.04.065&rft.externalDocID=S0377221716303034 |
| 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 |