Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
•We model a new variant of multi-allocation hub location routing problem.•An adaptive large neighborhood algorithm is introduced to solve the problem.•The algorithm is also applied to single-allocation version of the problem.•Numerical results prove that the algorithm performs well on benchmark inst...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 302; číslo 3; s. 1113 - 1127 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2022
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •We model a new variant of multi-allocation hub location routing problem.•An adaptive large neighborhood algorithm is introduced to solve the problem.•The algorithm is also applied to single-allocation version of the problem.•Numerical results prove that the algorithm performs well on benchmark instances.•The application of multi-allocation can efficiently reduce the operation cost.
In this study, we investigate a multi-allocation hub location routing problem (MAHLRP) for the design of an intra-city express service system, in which flows of mails and parcels are exchanged among the branch offices of the service provider via local tours and hubs. In this application, the pickup and delivery processes are handled simultaneously, and both hub capacity and vehicle capacity are considered. We propose a mixed integer programming formulation for this variant of problem for the first time, followed by a meta-heuristic algorithm, named as adaptive large neighborhood decomposition search, to solve the problem. The proposed model and algorithm are also applied to the single-allocation hub location routing problem (SAHLRP) with minor modifications for comparison reasons. Series of numerical experiments have been conducted on the instances generated from Australian Post data set to test the proposed model and algorithm for both the SAHLRP and the MAHLRP. The results prove that our algorithm outperforms the CPLEX on solving these two problems, as well as that applying the MAHLRP can efficiently reduce the operating cost as compared to the SAHLRP. |
|---|---|
| AbstractList | •We model a new variant of multi-allocation hub location routing problem.•An adaptive large neighborhood algorithm is introduced to solve the problem.•The algorithm is also applied to single-allocation version of the problem.•Numerical results prove that the algorithm performs well on benchmark instances.•The application of multi-allocation can efficiently reduce the operation cost.
In this study, we investigate a multi-allocation hub location routing problem (MAHLRP) for the design of an intra-city express service system, in which flows of mails and parcels are exchanged among the branch offices of the service provider via local tours and hubs. In this application, the pickup and delivery processes are handled simultaneously, and both hub capacity and vehicle capacity are considered. We propose a mixed integer programming formulation for this variant of problem for the first time, followed by a meta-heuristic algorithm, named as adaptive large neighborhood decomposition search, to solve the problem. The proposed model and algorithm are also applied to the single-allocation hub location routing problem (SAHLRP) with minor modifications for comparison reasons. Series of numerical experiments have been conducted on the instances generated from Australian Post data set to test the proposed model and algorithm for both the SAHLRP and the MAHLRP. The results prove that our algorithm outperforms the CPLEX on solving these two problems, as well as that applying the MAHLRP can efficiently reduce the operating cost as compared to the SAHLRP. |
| Author | Yamada, Tadashi Qureshi, Ali Gul Wu, Yuehui |
| Author_xml | – sequence: 1 givenname: Yuehui orcidid: 0000-0002-1755-3360 surname: Wu fullname: Wu, Yuehui email: wu.yuehui.34w@st.kyoto-u.ac.jp organization: Department of Urban Management, Graduate School of Engineering, Kyoto University, Katsura Campus, Nishikyo-ku, Kyoto-shi, Kyoto, 615-8246, Japan – sequence: 2 givenname: Ali Gul surname: Qureshi fullname: Qureshi, Ali Gul email: qureshi.aligul.4c@kyoto-u.ac.jp organization: Department of Urban Management, Graduate School of Engineering, Kyoto University, Katsura Campus, Nishikyo-ku, Kyoto-shi, Kyoto, 615-8246, Japan – sequence: 3 givenname: Tadashi surname: Yamada fullname: Yamada, Tadashi email: yamada.tadashi.2x@kyoto-u.ac.jp organization: Department of Urban Management, Graduate School of Engineering, Kyoto University, Katsura Campus, Nishikyo-ku, Kyoto-shi, Kyoto, 615-8246, Japan |
| BookMark | eNp9kM1qwzAQhEVJoUnaF-hJL2B3JceWDb2E0D8I9NKehSyvbRnZMrIS6NvXSUoPPRQGloX5lp1ZkcXgBiTknkHMgGUPXYyd8zEHzmOYBfyKLFkueJTlGSzIEhIhIs6ZuCGraeoAgKUsXRK7rdQYzBGpVb5BOqBp2tL51rmKVqhdP7rJBOMGOqHyuqXKNs6b0Pa0dp72BxtMpKx1Wp1d7aGkv4t3h2CGho7elRb7W3JdKzvh3c9ck8_np4_da7R_f3nbbfeRTooiREnFqjTZAONljplgSQGlKvKcpYoLwIKLjYCNggKTVCjI52y6hFqoMk3rooRkTfLLXe3dNHmspTbh_FHwyljJQJ5ak508tSZPrUmYBXxG-R909KZX_ut_6PEC4RzqaNDLSRscNFbGow6ycuY__Bu0FYqb |
| CitedBy_id | crossref_primary_10_1109_TITS_2024_3520577 crossref_primary_10_3390_jmse12050710 crossref_primary_10_1016_j_ejor_2024_02_029 crossref_primary_10_3390_drones7070457 crossref_primary_10_1080_21680566_2024_2434230 crossref_primary_10_1007_s10479_022_05117_0 crossref_primary_10_1016_j_tre_2022_102821 crossref_primary_10_1016_j_tre_2025_104396 crossref_primary_10_1016_j_cor_2022_105959 crossref_primary_10_1016_j_tre_2024_103940 crossref_primary_10_1016_j_tre_2025_104347 crossref_primary_10_3390_jmse12101713 crossref_primary_10_1016_j_cie_2025_111086 crossref_primary_10_1016_j_cor_2024_106861 crossref_primary_10_1016_j_ejor_2025_05_006 crossref_primary_10_1016_j_ins_2025_122133 crossref_primary_10_7717_peerj_cs_2840 crossref_primary_10_3390_drones7010006 crossref_primary_10_1016_j_tre_2023_103192 crossref_primary_10_1016_j_ejor_2025_07_033 crossref_primary_10_1016_j_seps_2023_101563 crossref_primary_10_3390_app14177510 |
| Cites_doi | 10.4028/www.scientific.net/AMM.409-410.1188 10.1016/S0377-2217(98)00395-6 10.1007/BF02564791 10.1002/net.21685 10.1016/j.ejor.2015.06.082 10.1023/A:1018994432663 10.1016/0377-2217(94)90318-2 10.1007/s10479-010-0705-2 10.1016/S0377-2217(87)80007-3 10.1016/j.ejor.2014.04.026 10.1016/j.asoc.2010.05.035 10.1287/trsc.1050.0135 10.1016/j.cie.2017.12.020 10.1016/j.cor.2010.07.014 10.1016/j.ejor.2004.09.047 10.1155/2015/525980 10.1016/j.ejor.2013.12.021 10.1016/j.cie.2013.01.012 10.1016/j.apm.2013.02.035 10.1016/j.cor.2006.07.002 10.1016/j.tre.2017.10.004 10.1016/j.ijpe.2003.12.002 10.1016/j.cor.2014.04.014 10.1080/00207543.2019.1693652 10.1016/j.cor.2012.04.007 10.1016/j.tre.2011.04.009 10.1016/j.cie.2019.05.038 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2022.02.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 1127 |
| ExternalDocumentID | 10_1016_j_ejor_2022_02_002 S0377221722000893 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG 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 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 EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c399t-3d1d534012b8e671390ba98815a270e9274704a09e357a08037cb0f7ab55f9b03 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000812288200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 22:51:10 EST 2025 Sat Nov 29 07:19:18 EST 2025 Fri Feb 23 02:39:13 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Hub location routing problem Intra-city express Location Mixed integer programming model Meta-heuristics |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c399t-3d1d534012b8e671390ba98815a270e9274704a09e357a08037cb0f7ab55f9b03 |
| ORCID | 0000-0002-1755-3360 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2022_02_002 crossref_primary_10_1016_j_ejor_2022_02_002 elsevier_sciencedirect_doi_10_1016_j_ejor_2022_02_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-11-01 2022-11-00 |
| PublicationDateYYYYMMDD | 2022-11-01 |
| PublicationDate_xml | – month: 11 year: 2022 text: 2022-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Kratica, Milanović, Stanimirović, Tošić (bib0020) 2011; 11 Hemmelmayr, Cordeau, Crainic (bib0016) 2012; 39 Kartal, Hasgul, Ernst (bib0018) 2017; 108 de Camargo, Miranda, Luna (bib0010) 2008; 35 (Vol. 409, pp. 1188-1192). Trans Tech Publications Ltd. https://doi.org/10.4028/www.scientific.net/AMM.409-410.1188 Campbell (bib0005) 1994; 72 Ropke, Pisinger (bib0028) 2006; 40 Sun, J.U. (.2013). An integrated hub location and multi-depot vehicle routing problem. In Contreras, O'Kelly (bib0008) 2019 Nagy, Salhi (bib0023) 1998; 6 Yang, Bostel, Dejax (bib0032) 2019; 135 Alumur, Campbell, Contreras, Kara, Marianov, O'Kelly (bib0001) 2020 Fontes, Goncalves (bib0014) 2021; 59 Catanzaro, Gourdin, Labbé, Özsoy (bib0006) 2011; 38 Çetiner, Sepil, Süral (bib0007) 2010; 181 Rieck, Ehrenberg, Zimmermann (bib0026) 2014; 236 Lopes, de Andrade, de Queiroz, Resende, Miyazawa (bib0021) 2016; 68 Ebery, Krishnamoorthy, Ernst, Boland (bib0011) 2000; 120 Sun (bib0030) 2015; 2015 Ernst, Krishnamoorthy (bib0012) 1999; 86 Koç, Bektaş, Jabali, Laporte (bib0019) 2016; 248 Rodríguez-Martín, Salazar-González, Yaman (bib0027) 2014; 50 Archetti, Bianchessi, Speranza (bib0002) 2014; 238 Marı́n, Cánovas, Landete (bib0022) 2006; 172 O'Kelly (bib0024) 1987; 32 Basirati, Jokar, Hassannayebi (bib0003) 2019 Karimi (bib0017) 2018; 116 Farahani, Hekmatfar, Arabani, Nikbakhsh (bib0013) 2013; 64 de Camargo, de Miranda, Løkketangen (bib0009) 2013; 37 Wasner, Zäpfel (bib0031) 2004; 90 Ratli, Urošević, El Cadi, Brimberg, Mladenović, Todosijević (bib0025) 2020 Gelareh, Nickel (bib0015) 2011; 47 Bostel, Dejax, Zhang (bib0004) 2015 O'Kelly (10.1016/j.ejor.2022.02.002_bib0024) 1987; 32 Sun (10.1016/j.ejor.2022.02.002_bib0030) 2015; 2015 Ropke (10.1016/j.ejor.2022.02.002_bib0028) 2006; 40 Rieck (10.1016/j.ejor.2022.02.002_bib0026) 2014; 236 Archetti (10.1016/j.ejor.2022.02.002_bib0002) 2014; 238 Lopes (10.1016/j.ejor.2022.02.002_bib0021) 2016; 68 Campbell (10.1016/j.ejor.2022.02.002_bib0005) 1994; 72 Rodríguez-Martín (10.1016/j.ejor.2022.02.002_bib0027) 2014; 50 Kratica (10.1016/j.ejor.2022.02.002_bib0020) 2011; 11 Ebery (10.1016/j.ejor.2022.02.002_bib0011) 2000; 120 de Camargo (10.1016/j.ejor.2022.02.002_bib0010) 2008; 35 Nagy (10.1016/j.ejor.2022.02.002_bib0023) 1998; 6 Fontes (10.1016/j.ejor.2022.02.002_bib0014) 2021; 59 Gelareh (10.1016/j.ejor.2022.02.002_bib0015) 2011; 47 Ratli (10.1016/j.ejor.2022.02.002_bib0025) 2020 10.1016/j.ejor.2022.02.002_bib0029 de Camargo (10.1016/j.ejor.2022.02.002_bib0009) 2013; 37 Contreras (10.1016/j.ejor.2022.02.002_bib0008) 2019 Kartal (10.1016/j.ejor.2022.02.002_bib0018) 2017; 108 Basirati (10.1016/j.ejor.2022.02.002_bib0003) 2019 Hemmelmayr (10.1016/j.ejor.2022.02.002_bib0016) 2012; 39 Catanzaro (10.1016/j.ejor.2022.02.002_bib0006) 2011; 38 Karimi (10.1016/j.ejor.2022.02.002_bib0017) 2018; 116 Ernst (10.1016/j.ejor.2022.02.002_bib0012) 1999; 86 Yang (10.1016/j.ejor.2022.02.002_bib0032) 2019; 135 Çetiner (10.1016/j.ejor.2022.02.002_bib0007) 2010; 181 Alumur (10.1016/j.ejor.2022.02.002_bib0001) 2020 Koç (10.1016/j.ejor.2022.02.002_bib0019) 2016; 248 Bostel (10.1016/j.ejor.2022.02.002_bib0004) 2015 Marı́n (10.1016/j.ejor.2022.02.002_bib0022) 2006; 172 Farahani (10.1016/j.ejor.2022.02.002_bib0013) 2013; 64 Wasner (10.1016/j.ejor.2022.02.002_bib0031) 2004; 90 |
| References_xml | – volume: 47 start-page: 1092 year: 2011 end-page: 1111 ident: bib0015 article-title: Hub location problems in transportation networks publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 108 start-page: 141 year: 2017 end-page: 159 ident: bib0018 article-title: Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 38 start-page: 539 year: 2011 end-page: 549 ident: bib0006 article-title: A branch-and-cut algorithm for the partitioning-hub location-routing problem publication-title: Computers & Operations Research – start-page: 1 year: 2020 end-page: 20 ident: bib0025 article-title: An efficient heuristic for a hub location routing problem publication-title: Optimization Letters – volume: 248 start-page: 33 year: 2016 end-page: 51 ident: bib0019 article-title: The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm publication-title: European Journal of Operational Research – volume: 236 start-page: 863 year: 2014 end-page: 878 ident: bib0026 article-title: Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery publication-title: European Journal of Operational Research – volume: 35 start-page: 1047 year: 2008 end-page: 1064 ident: bib0010 article-title: Benders decomposition for the uncapacitated multiple allocation hub location problem publication-title: Computers & Operations Research – volume: 11 start-page: 1858 year: 2011 end-page: 1866 ident: bib0020 article-title: An evolutionary-based approach for solving a capacitated hub location problem publication-title: Applied Soft Computing – volume: 86 start-page: 141 year: 1999 end-page: 159 ident: bib0012 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research – start-page: 327 year: 2019 end-page: 363 ident: bib0008 article-title: Hub location problems publication-title: Location Science – volume: 120 start-page: 614 year: 2000 end-page: 631 ident: bib0011 article-title: The capacitated multiple allocation hub location problem: Formulations and algorithms publication-title: European Journal of Operational Research – volume: 172 start-page: 274 year: 2006 end-page: 292 ident: bib0022 article-title: New formulations for the uncapacitated multiple allocation hub location problem publication-title: European Journal of Operational Research – volume: 135 start-page: 105 year: 2019 end-page: 119 ident: bib0032 article-title: A MILP model and memetic algorithm for the hub location and routing problem with distinct collection and delivery tours publication-title: Computers & Industrial Engineering – volume: 32 start-page: 393 year: 1987 end-page: 404 ident: bib0024 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: European Journal of Operational Research – volume: 68 start-page: 54 year: 2016 end-page: 90 ident: bib0021 article-title: Heuristics for a hub location-routing problem publication-title: Networks – volume: 2015 year: 2015 ident: bib0030 article-title: An endosymbiotic evolutionary algorithm for the hub location-routing problem publication-title: Mathematical Problems in Engineering – volume: 37 start-page: 7465 year: 2013 end-page: 7480 ident: bib0009 article-title: A new formulation and an exact approach for the many-to-many hub location-routing problem publication-title: Applied Mathematical Modelling – volume: 40 start-page: 455 year: 2006 end-page: 472 ident: bib0028 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: Transportation Science – start-page: 1383 year: 2015 end-page: 1389 ident: bib0004 article-title: A model and a metaheuristic method for the hub location routing problem and application to postal services publication-title: 2015 International Conference on Industrial Engineering and Systems Management – volume: 59 start-page: 30 year: 2021 end-page: 46 ident: bib0014 article-title: A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure publication-title: International Journal of Production Research – volume: 181 start-page: 109 year: 2010 end-page: 124 ident: bib0007 article-title: Hubbing and routing in postal delivery systems publication-title: Annals of Operations Research – volume: 116 start-page: 47 year: 2018 end-page: 58 ident: bib0017 article-title: The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems publication-title: Computers & Industrial Engineering – volume: 6 start-page: 261 year: 1998 end-page: 275 ident: bib0023 article-title: The many-to-many location-routing problem publication-title: Top – volume: 50 start-page: 161 year: 2014 end-page: 174 ident: bib0027 article-title: A branch-and-cut algorithm for the hub location and routing problem publication-title: Computers & Operations Research – reference: Sun, J.U. (.2013). An integrated hub location and multi-depot vehicle routing problem. In – volume: 238 start-page: 685 year: 2014 end-page: 698 ident: bib0002 article-title: Branch-and-cut algorithms for the split delivery vehicle routing problem publication-title: European Journal of Operational Research – volume: 90 start-page: 403 year: 2004 end-page: 419 ident: bib0031 article-title: An integrated multi-depot hub-location vehicle routing model for network planning of parcel service publication-title: International Journal of Production Economics – volume: 72 start-page: 387 year: 1994 end-page: 405 ident: bib0005 article-title: Integer programming formulations of discrete hub location problems publication-title: European Journal of Operational Research – start-page: 1 year: 2019 end-page: 22 ident: bib0003 article-title: Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window publication-title: Neural Computing and Applications – reference: (Vol. 409, pp. 1188-1192). Trans Tech Publications Ltd. https://doi.org/10.4028/www.scientific.net/AMM.409-410.1188 – volume: 64 start-page: 1096 year: 2013 end-page: 1109 ident: bib0013 article-title: Hub location problems: A review of models, classification, solution techniques, and applications publication-title: Computers & Industrial Engineering – volume: 39 start-page: 3215 year: 2012 end-page: 3228 ident: bib0016 article-title: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics publication-title: Computers & Operations Research – year: 2020 ident: bib0001 article-title: Perspectives on modeling hub location problems publication-title: European Journal of Operational Research – ident: 10.1016/j.ejor.2022.02.002_bib0029 doi: 10.4028/www.scientific.net/AMM.409-410.1188 – volume: 120 start-page: 614 issue: 3 year: 2000 ident: 10.1016/j.ejor.2022.02.002_bib0011 article-title: The capacitated multiple allocation hub location problem: Formulations and algorithms publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00395-6 – volume: 6 start-page: 261 issue: 2 year: 1998 ident: 10.1016/j.ejor.2022.02.002_bib0023 article-title: The many-to-many location-routing problem publication-title: Top doi: 10.1007/BF02564791 – volume: 68 start-page: 54 issue: 1 year: 2016 ident: 10.1016/j.ejor.2022.02.002_bib0021 article-title: Heuristics for a hub location-routing problem publication-title: Networks doi: 10.1002/net.21685 – volume: 248 start-page: 33 issue: 1 year: 2016 ident: 10.1016/j.ejor.2022.02.002_bib0019 article-title: The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.06.082 – volume: 86 start-page: 141 year: 1999 ident: 10.1016/j.ejor.2022.02.002_bib0012 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research doi: 10.1023/A:1018994432663 – volume: 72 start-page: 387 issue: 2 year: 1994 ident: 10.1016/j.ejor.2022.02.002_bib0005 article-title: Integer programming formulations of discrete hub location problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)90318-2 – start-page: 1 year: 2019 ident: 10.1016/j.ejor.2022.02.002_bib0003 article-title: Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window publication-title: Neural Computing and Applications – volume: 181 start-page: 109 issue: 1 year: 2010 ident: 10.1016/j.ejor.2022.02.002_bib0007 article-title: Hubbing and routing in postal delivery systems publication-title: Annals of Operations Research doi: 10.1007/s10479-010-0705-2 – volume: 32 start-page: 393 issue: 3 year: 1987 ident: 10.1016/j.ejor.2022.02.002_bib0024 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(87)80007-3 – volume: 238 start-page: 685 issue: 3 year: 2014 ident: 10.1016/j.ejor.2022.02.002_bib0002 article-title: Branch-and-cut algorithms for the split delivery vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.04.026 – volume: 11 start-page: 1858 issue: 2 year: 2011 ident: 10.1016/j.ejor.2022.02.002_bib0020 article-title: An evolutionary-based approach for solving a capacitated hub location problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2010.05.035 – volume: 40 start-page: 455 issue: 4 year: 2006 ident: 10.1016/j.ejor.2022.02.002_bib0028 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 – year: 2020 ident: 10.1016/j.ejor.2022.02.002_bib0001 article-title: Perspectives on modeling hub location problems publication-title: European Journal of Operational Research – volume: 116 start-page: 47 year: 2018 ident: 10.1016/j.ejor.2022.02.002_bib0017 article-title: The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.12.020 – volume: 38 start-page: 539 issue: 2 year: 2011 ident: 10.1016/j.ejor.2022.02.002_bib0006 article-title: A branch-and-cut algorithm for the partitioning-hub location-routing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.07.014 – volume: 172 start-page: 274 issue: 1 year: 2006 ident: 10.1016/j.ejor.2022.02.002_bib0022 article-title: New formulations for the uncapacitated multiple allocation hub location problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.09.047 – volume: 2015 year: 2015 ident: 10.1016/j.ejor.2022.02.002_bib0030 article-title: An endosymbiotic evolutionary algorithm for the hub location-routing problem publication-title: Mathematical Problems in Engineering doi: 10.1155/2015/525980 – start-page: 1383 year: 2015 ident: 10.1016/j.ejor.2022.02.002_bib0004 article-title: A model and a metaheuristic method for the hub location routing problem and application to postal services – start-page: 1 year: 2020 ident: 10.1016/j.ejor.2022.02.002_bib0025 article-title: An efficient heuristic for a hub location routing problem publication-title: Optimization Letters – volume: 236 start-page: 863 issue: 3 year: 2014 ident: 10.1016/j.ejor.2022.02.002_bib0026 article-title: Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.12.021 – volume: 64 start-page: 1096 issue: 4 year: 2013 ident: 10.1016/j.ejor.2022.02.002_bib0013 article-title: Hub location problems: A review of models, classification, solution techniques, and applications publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2013.01.012 – volume: 37 start-page: 7465 issue: 12–13 year: 2013 ident: 10.1016/j.ejor.2022.02.002_bib0009 article-title: A new formulation and an exact approach for the many-to-many hub location-routing problem publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2013.02.035 – volume: 35 start-page: 1047 issue: 4 year: 2008 ident: 10.1016/j.ejor.2022.02.002_bib0010 article-title: Benders decomposition for the uncapacitated multiple allocation hub location problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.07.002 – volume: 108 start-page: 141 year: 2017 ident: 10.1016/j.ejor.2022.02.002_bib0018 article-title: Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2017.10.004 – start-page: 327 year: 2019 ident: 10.1016/j.ejor.2022.02.002_bib0008 article-title: Hub location problems – volume: 90 start-page: 403 issue: 3 year: 2004 ident: 10.1016/j.ejor.2022.02.002_bib0031 article-title: An integrated multi-depot hub-location vehicle routing model for network planning of parcel service publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2003.12.002 – volume: 50 start-page: 161 year: 2014 ident: 10.1016/j.ejor.2022.02.002_bib0027 article-title: A branch-and-cut algorithm for the hub location and routing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.04.014 – volume: 59 start-page: 30 issue: 1 year: 2021 ident: 10.1016/j.ejor.2022.02.002_bib0014 article-title: A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure publication-title: International Journal of Production Research doi: 10.1080/00207543.2019.1693652 – volume: 39 start-page: 3215 issue: 12 year: 2012 ident: 10.1016/j.ejor.2022.02.002_bib0016 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 – volume: 47 start-page: 1092 issue: 6 year: 2011 ident: 10.1016/j.ejor.2022.02.002_bib0015 article-title: Hub location problems in transportation networks publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2011.04.009 – volume: 135 start-page: 105 year: 2019 ident: 10.1016/j.ejor.2022.02.002_bib0032 article-title: A MILP model and memetic algorithm for the hub location and routing problem with distinct collection and delivery tours publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2019.05.038 |
| SSID | ssj0001515 |
| Score | 2.519285 |
| Snippet | •We model a new variant of multi-allocation hub location routing problem.•An adaptive large neighborhood algorithm is introduced to solve the problem.•The... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1113 |
| SubjectTerms | Hub location routing problem Intra-city express Location Meta-heuristics Mixed integer programming model |
| Title | Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2022.02.002 |
| Volume | 302 |
| WOSCitedRecordID | wos000812288200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELaqXYTgwKOAWF7ygVsUlNhxHR8rtAgQWnEoopwiO3Foq2xahWS1P4Yfy_iRNFS7K_aAVKWJZTtp58t4_HlmjNDbUkopyiIKE2WWGWEaFEo9y0Otk1mcC0bLxAYKf-FnZ-lyKb5OJr_7WJiLitd1enkpdv9V1FAGwjahs7cQ99ApFMA5CB2OIHY4_pPg54XcWX-gyjh5B7XhPkHQNn1xoY0LuffTCjzjIauf22bdrs6ty6H1MAzNcrwj84JVp4Lhotl2rYtft_vQXMvrexsXCpqebfRphQb6-Xtn1X-nV916T79CLbvNcDCv1oDfwf_jhzyXhTV0F_ANdcZ0Bcx044Gu8GFanIeEuIDNXgXTiIywRkcKFVQxHQ3OYB3yKxW_4yA27_Rma7K8EuIysZL9MNcv7R-MfoNPYu_utslMH5npI4vgYzKVHhPOBOjM4_mn0-XnYaQ3xqBdpfI_yQdlOf_Bwye52vAZGTOLR-iBn4XguUPPYzTR9RTd7YMgpuhhv9kH9rp_iu6PMlc-QVWPMmxRhscow3-hDDup4wFlGFCGD1GGAWV4uPAowx5lT9G3D6eL9x9Dv3FHmIO924a0iAtGYeZOVKpn8P6LSEmRpjGThEdaGCYkSmQkNGVcwpyF8lxFJZeKsVKoiD5DR_W21s8RTglVLKUyTqBRkVJFE654njMYOGLFZico7v_VLPdZ7c3mKlV2vTxPUDC02bmcLjfWZr2wMm-VOmszA-zd0O7Fre7yEt3bvy2v0FHbdPo1upNftOtfzRsPvD9BHrLW |
| 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=Adaptive+large+neighborhood+decomposition+search+algorithm+for+multi-allocation+hub+location+routing+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Wu%2C+Yuehui&rft.au=Qureshi%2C+Ali+Gul&rft.au=Yamada%2C+Tadashi&rft.date=2022-11-01&rft.issn=0377-2217&rft.volume=302&rft.issue=3&rft.spage=1113&rft.epage=1127&rft_id=info:doi/10.1016%2Fj.ejor.2022.02.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2022_02_002 |
| 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 |