A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours
•Solutions of Hub Location Routing Problems with distinct pickup and delivery tours.•MILP model finds solutions of small to medium size instances.•Memetic Algorithm obtains high quality solutions of large problems efficiently.•Sensitivity analysis proves robustness of MA and usefulness for decision-...
Saved in:
| Published in: | Computers & industrial engineering Vol. 135; pp. 105 - 119 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.09.2019
Elsevier |
| Subjects: | |
| ISSN: | 0360-8352, 1879-0550 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •Solutions of Hub Location Routing Problems with distinct pickup and delivery tours.•MILP model finds solutions of small to medium size instances.•Memetic Algorithm obtains high quality solutions of large problems efficiently.•Sensitivity analysis proves robustness of MA and usefulness for decision-making.
In this paper, we study the capacitated single allocation Hub Location-Routing Problem (CSAHLRP) with independent collection and delivery processes. We focus on the design of less-than-truck load (LTL) transport networks for the transport of goods between many shippers and their clients using flow concentration hubs. We seek to integrate the hub location and vehicle routing strategies such that the location of the hubs, the allocation of supplier/client nodes to hubs, the design of routes between nodes allocated to the same hub, as well as the inter-hub freight transportations, can be determined efficiently. We propose a mixed integer linear programming model for the problem with the aim of minimizing the total fixed and variable costs. Computational experiments based on the Australian Post (AP) data set geographical network are conducted with the CPLEX solver. Furthermore, we propose a memetic algorithm (MA) to solve large problems. Computational results show that the exact method can find optimal solutions for small instances and good feasible solutions for some medium-sized tests. In addition to also solving small problems to optimality, the MA succeeds in finding high quality solutions for medium and large CSAHLRPs efficiently. |
|---|---|
| AbstractList | •Solutions of Hub Location Routing Problems with distinct pickup and delivery tours.•MILP model finds solutions of small to medium size instances.•Memetic Algorithm obtains high quality solutions of large problems efficiently.•Sensitivity analysis proves robustness of MA and usefulness for decision-making.
In this paper, we study the capacitated single allocation Hub Location-Routing Problem (CSAHLRP) with independent collection and delivery processes. We focus on the design of less-than-truck load (LTL) transport networks for the transport of goods between many shippers and their clients using flow concentration hubs. We seek to integrate the hub location and vehicle routing strategies such that the location of the hubs, the allocation of supplier/client nodes to hubs, the design of routes between nodes allocated to the same hub, as well as the inter-hub freight transportations, can be determined efficiently. We propose a mixed integer linear programming model for the problem with the aim of minimizing the total fixed and variable costs. Computational experiments based on the Australian Post (AP) data set geographical network are conducted with the CPLEX solver. Furthermore, we propose a memetic algorithm (MA) to solve large problems. Computational results show that the exact method can find optimal solutions for small instances and good feasible solutions for some medium-sized tests. In addition to also solving small problems to optimality, the MA succeeds in finding high quality solutions for medium and large CSAHLRPs efficiently. |
| Author | Bostel, Nathalie Dejax, Pierre Yang, Xiao |
| Author_xml | – sequence: 1 givenname: Xiao orcidid: 0000-0001-6945-9504 surname: Yang fullname: Yang, Xiao organization: Shanghai Customs College, Department of Customs Administration, Shanghai 201204, China – sequence: 2 givenname: Nathalie surname: Bostel fullname: Bostel, Nathalie email: nathalie.bostel@univ-nantes.fr organization: University of Nantes, CNRS, LS2N, F-44000 Nantes, France – sequence: 3 givenname: Pierre surname: Dejax fullname: Dejax, Pierre organization: IMT Atlantique, CNRS, LS2N, 44300 Nantes, France |
| BackLink | https://hal.science/hal-02524875$$DView record in HAL |
| BookMark | eNp9kE1r4zAQhkVpoUnaH9Cbrnuwd0a2YpueQtjdBFx2Kb0LWR-Ngm0VWUnpv6_S7Pawh54GXp5nhnnn5HL0oyHkDiFHwOX3fa6cyRlgkwPPoagvyAzrqsmAc7gkMyiWkNUFZ9dkPk17ACh5gzPyuqIP2_YPHbw2PZWjpoMZTHSKyv7ZBxd3A7U-0LgzdHPoaOuVjM6PH-ijP0Q3PtOX4LveDPQ14VS7KYUqUuX73qhPOO13RxPeaPSHMN2QKyv7ydz-nQvy9PPH03qTtb9_bderNlMlq2ImAUvJuV1aVTGum67DytrCagkSqhoN6LIrG8nqmllUmtWI1bLjBRZcoS4W5Nt57U724iW4QYY34aUTm1UrThkwzsq64kdMbHVmVfDTFIwVysWPZ2OQrhcI4lS12KfciFPVArhIVScT_zP_nfrKuT87Jn1_dCaIKSGjMtqF1JrQ3n1hvwO4b5lz |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2022_02_002 crossref_primary_10_1016_j_ejor_2023_02_003 crossref_primary_10_1016_j_tre_2022_102903 crossref_primary_10_1109_TEM_2024_3458151 crossref_primary_10_1080_01605682_2023_2197933 crossref_primary_10_1016_j_cor_2021_105469 crossref_primary_10_1007_s00521_022_08173_6 crossref_primary_10_1016_j_cor_2022_105923 crossref_primary_10_1111_itor_12950 crossref_primary_10_1016_j_cie_2023_109528 crossref_primary_10_1016_j_jtte_2023_07_014 crossref_primary_10_1007_s12351_024_00876_z crossref_primary_10_47880_inf2802_02 crossref_primary_10_1016_j_cor_2023_106211 crossref_primary_10_1016_j_ejor_2025_05_006 crossref_primary_10_7717_peerj_cs_2840 crossref_primary_10_1109_TSMC_2021_3088776 crossref_primary_10_1111_coin_12374 crossref_primary_10_1007_s12293_021_00334_9 crossref_primary_10_3390_su15054633 crossref_primary_10_14529_mmp240305 crossref_primary_10_1016_j_engappai_2020_104056 crossref_primary_10_3390_su12198042 crossref_primary_10_1109_TITS_2020_2981564 crossref_primary_10_1016_j_wasman_2019_11_041 crossref_primary_10_1080_00207543_2021_1991021 crossref_primary_10_1016_j_jclepro_2021_129760 crossref_primary_10_1016_j_jer_2023_100130 crossref_primary_10_1016_j_cor_2024_106861 crossref_primary_10_3390_drones7010006 crossref_primary_10_1016_j_ejor_2020_09_039 crossref_primary_10_1007_s12518_020_00297_5 crossref_primary_10_1016_j_asoc_2022_109243 crossref_primary_10_1177_03611981221143116 |
| Cites_doi | 10.1016/j.cor.2014.06.009 10.1016/j.cie.2013.01.012 10.1080/00207543.2015.1085655 10.1016/j.eswa.2011.08.146 10.1016/j.cor.2010.07.014 10.1016/0377-2217(94)90318-2 10.1016/j.ijpe.2003.12.002 10.1080/00207543.2015.1084063 10.1016/j.ejor.2013.12.021 10.1080/01966324.1987.10737207 10.1287/trsc.37.2.153.15243 10.1007/s10479-010-0705-2 10.1007/11730095_16 10.1016/j.cor.2010.09.019 10.1016/j.apm.2013.02.035 10.48084/etasr.292 10.1016/j.omega.2011.09.002 10.1016/j.cor.2014.04.014 10.1016/j.ejor.2014.01.005 10.1016/j.cor.2011.05.013 10.1016/j.ejor.2006.04.004 10.1016/0377-2217(89)90188-4 10.1016/j.ejor.2007.06.008 10.1007/BF02564791 10.1155/2015/525980 10.1287/trsc.1120.0410 10.1023/A:1018994432663 10.1007/0-306-48056-5_3 10.1080/00207543.2014.942010 |
| ContentType | Journal Article |
| Copyright | 2019 Attribution - NonCommercial |
| Copyright_xml | – notice: 2019 – notice: Attribution - NonCommercial |
| DBID | AAYXX CITATION 1XC VOOES |
| DOI | 10.1016/j.cie.2019.05.038 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering Computer Science |
| EISSN | 1879-0550 |
| EndPage | 119 |
| ExternalDocumentID | oai:HAL:hal-02524875v1 10_1016_j_cie_2019_05_038 S0360835219303110 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 1XC VOOES |
| ID | FETCH-LOGICAL-c427t-a014a55f6fc725d9bb17ff3fda0a0781e0d4b49a2882f1cd281176b53135c1d3 |
| ISICitedReferencesCount | 38 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000482244100008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Tue Oct 14 20:33:16 EDT 2025 Sat Nov 29 07:21:36 EST 2025 Tue Nov 18 21:09:05 EST 2025 Fri Feb 23 02:29:10 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Memetic algorithm Hub Location-Routing Problem LTL transport Mixed integer programming model |
| Language | English |
| License | Attribution - NonCommercial: http://creativecommons.org/licenses/by-nc |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c427t-a014a55f6fc725d9bb17ff3fda0a0781e0d4b49a2882f1cd281176b53135c1d3 |
| ORCID | 0000-0001-6945-9504 0000-0002-6753-4598 |
| OpenAccessLink | https://hal.science/hal-02524875 |
| PageCount | 15 |
| ParticipantIDs | hal_primary_oai_HAL_hal_02524875v1 crossref_citationtrail_10_1016_j_cie_2019_05_038 crossref_primary_10_1016_j_cie_2019_05_038 elsevier_sciencedirect_doi_10_1016_j_cie_2019_05_038 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-09-01 |
| PublicationDateYYYYMMDD | 2019-09-01 |
| PublicationDate_xml | – month: 09 year: 2019 text: 2019-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2019 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Nagy, Salhi (b0125) 1998; 6 Ernst, Krishnamoorthy (b0080) 1999; 86 Campbell, O’Kelly (b0045) 2012; 46 Deng, Wang, Wang, Zheng (b0070) 2016; 54 Laporte (b0105) 1988 Belenguer, Benavent, Prins, Prodhon, Calvo (b0025) 2011; 38 Dantzig, Fulkerson, Johnson (b0060) 1954; 2 de Camargo, de Miranda, Løkketangen (b0065) 2013; 37 Campbell (b0040) 1994; 72 Farahani, Hekmatfar, Arabani, Nikbakhsh (b0085) 2013; 64 Wasner, Zäpfel (b0185) 2004; 90 Mokhtari, Abbasi (b0120) 2014; 3 Çetiner, Sepil, Süral (b0055) 2010; 181 Reeves (b0145) 2003 Sun (b0180) 2015; 2015 Yu, Lin (b0190) 2016; 54 Fortin, Parizeau (b0090) 2013 Nagy, Salhi (b0130) 2007; 177 Rieck, Ehrenberg, Zimmermann (b0150) 2014; 236 Ardjmand, Weckman, Park, Taherkhani, Singh (b0015) 2015; 53 Zameni, Razmi (b0195) 2015; 8 Sun (b0175) 2013; Vol. 409 Prodhon, Prins (b0140) 2014; 238 Caccetta, Alameen, Abdul-Niby (b0035) 2013; 3 Karaoglan, Altiparmak (b0095) 2015; 55 Setak, Karimi, Rastani (b0170) 2013; 26 Derbel, Jarboui, Hanafi, Chabchoub (b0075) 2012; 39 Manzour-al Ajdad, Torabi, Salhi (b0110) 2012; 39 Karaoglan, Altiparmak, Kara, Dengiz (b0100) 2012; 40 Schneider, Drexl (b0165) 2017 Catanzaro, Gourdin, Labbé, Özsoy (b0050) 2011; 38 Alumur, Kara (b0010) 2008; 190 Mohammadi, Razmi, Tavakkoli-Moghaddam (b0115) 2013; 47 Achuthan, Caccetta, Hill (b0005) 2003; 37 Prins, Prodhon, Calvo (b0135) 2006; 3906 Balakrishnan, Ward, Wong (b0020) 1987; 7 Bostel, Dejax, Zhang (b0030) 2015 Salhi, Rand (b0160) 1989; 39 Rodríguez-Martín, Salazar-González, Yaman (b0155) 2014; 50 Mohammadi (10.1016/j.cie.2019.05.038_b0115) 2013; 47 Nagy (10.1016/j.cie.2019.05.038_b0125) 1998; 6 Laporte (10.1016/j.cie.2019.05.038_b0105) 1988 Karaoglan (10.1016/j.cie.2019.05.038_b0095) 2015; 55 Prins (10.1016/j.cie.2019.05.038_b0135) 2006; 3906 Prodhon (10.1016/j.cie.2019.05.038_b0140) 2014; 238 Schneider (10.1016/j.cie.2019.05.038_b0165) 2017 Mokhtari (10.1016/j.cie.2019.05.038_b0120) 2014; 3 Setak (10.1016/j.cie.2019.05.038_b0170) 2013; 26 Yu (10.1016/j.cie.2019.05.038_b0190) 2016; 54 Catanzaro (10.1016/j.cie.2019.05.038_b0050) 2011; 38 Farahani (10.1016/j.cie.2019.05.038_b0085) 2013; 64 Bostel (10.1016/j.cie.2019.05.038_b0030) 2015 de Camargo (10.1016/j.cie.2019.05.038_b0065) 2013; 37 Alumur (10.1016/j.cie.2019.05.038_b0010) 2008; 190 Sun (10.1016/j.cie.2019.05.038_b0175) 2013; Vol. 409 Balakrishnan (10.1016/j.cie.2019.05.038_b0020) 1987; 7 Campbell (10.1016/j.cie.2019.05.038_b0040) 1994; 72 Belenguer (10.1016/j.cie.2019.05.038_b0025) 2011; 38 Caccetta (10.1016/j.cie.2019.05.038_b0035) 2013; 3 Ardjmand (10.1016/j.cie.2019.05.038_b0015) 2015; 53 Fortin (10.1016/j.cie.2019.05.038_b0090) 2013 Achuthan (10.1016/j.cie.2019.05.038_b0005) 2003; 37 Dantzig (10.1016/j.cie.2019.05.038_b0060) 1954; 2 Salhi (10.1016/j.cie.2019.05.038_b0160) 1989; 39 Sun (10.1016/j.cie.2019.05.038_b0180) 2015; 2015 Derbel (10.1016/j.cie.2019.05.038_b0075) 2012; 39 Karaoglan (10.1016/j.cie.2019.05.038_b0100) 2012; 40 Wasner (10.1016/j.cie.2019.05.038_b0185) 2004; 90 Ernst (10.1016/j.cie.2019.05.038_b0080) 1999; 86 Deng (10.1016/j.cie.2019.05.038_b0070) 2016; 54 Rodríguez-Martín (10.1016/j.cie.2019.05.038_b0155) 2014; 50 Campbell (10.1016/j.cie.2019.05.038_b0045) 2012; 46 Çetiner (10.1016/j.cie.2019.05.038_b0055) 2010; 181 Zameni (10.1016/j.cie.2019.05.038_b0195) 2015; 8 Manzour-al Ajdad (10.1016/j.cie.2019.05.038_b0110) 2012; 39 Nagy (10.1016/j.cie.2019.05.038_b0130) 2007; 177 Reeves (10.1016/j.cie.2019.05.038_b0145) 2003 Rieck (10.1016/j.cie.2019.05.038_b0150) 2014; 236 |
| References_xml | – start-page: 1383 year: 2015 end-page: 1389 ident: b0030 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 (IESM) – volume: 72 start-page: 387 year: 1994 end-page: 405 ident: b0040 article-title: Integer programming formulations of discrete hub location problems publication-title: European Journal of Operational Research – volume: 236 start-page: 863 year: 2014 end-page: 878 ident: b0150 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: 177 start-page: 649 year: 2007 end-page: 672 ident: b0130 article-title: Location-routing: Issues, models and methods publication-title: European Journal of Operational Research – volume: 86 start-page: 141 year: 1999 end-page: 159 ident: b0080 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research – volume: 39 start-page: 461 year: 2012 end-page: 470 ident: b0110 article-title: A hierarchical algorithm for the planar single-facility location routing problem publication-title: Computers & Operations Research – volume: 64 start-page: 1096 year: 2013 end-page: 1109 ident: b0085 article-title: Hub location problems: A review of models, classification, solution techniques, and applications publication-title: Computers & Industrial Engineering – volume: 39 start-page: 150 year: 1989 end-page: 156 ident: b0160 article-title: The effect of ignoring routes when locating depots publication-title: European Journal of Operational Research – volume: 3 start-page: 413 year: 2013 ident: b0035 article-title: An improved clarke and wright algorithm to solve the capacitated vehicle routing problem publication-title: Engineering, Technology & Applied Science Research – volume: 7 start-page: 35 year: 1987 end-page: 61 ident: b0020 article-title: Integrated facility location and vehicle routing models: Recent work and future prospects publication-title: American Journal of Mathematical and Management Sciences – volume: 181 start-page: 109 year: 2010 end-page: 124 ident: b0055 article-title: Hubbing and routing in postal delivery systems publication-title: Annals of Operations Research – volume: 50 start-page: 161 year: 2014 end-page: 174 ident: b0155 article-title: A branch-and-cut algorithm for the hub location and routing problem publication-title: Computers & Operations Research – volume: 47 year: 2013 ident: b0115 article-title: Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries publication-title: Economic Computation & Economic Cybernetics Studies & Research – volume: 6 start-page: 261 year: 1998 end-page: 275 ident: b0125 article-title: The many-to-many location-routing problem publication-title: Top – volume: 37 start-page: 7465 year: 2013 end-page: 7480 ident: b0065 article-title: A new formulation and an exact approach for the many-to-many hub location-routing problem publication-title: Applied Mathematical Modelling – volume: 26 start-page: 997 year: 2013 ident: b0170 article-title: Designing incomplete hub location-routing network in urban transportation problem publication-title: International Journal of Engineering-Transactions C: Aspects – volume: 3 start-page: 647 year: 2014 ident: b0120 article-title: Applying VNPSO algorithm to solve the many-to-many hub location-routing problem in a large scale publication-title: European Online Journal of Natural and Social Sciences – volume: 2015 year: 2015 ident: b0180 article-title: An endosymbiotic evolutionary algorithm for the hub location-routing problem publication-title: Mathematical Problems in Engineering – volume: 38 start-page: 931 year: 2011 end-page: 941 ident: b0025 article-title: A branch-and-cut method for the capacitated location-routing problem publication-title: Computers & Operations Research – volume: 37 start-page: 153 year: 2003 end-page: 169 ident: b0005 article-title: An improved branch-and-cut algorithm for the capacitated vehicle routing problem publication-title: Transportation Science – volume: 2 start-page: 393 year: 1954 end-page: 410 ident: b0060 article-title: Solution of a large-scale traveling-salesman problem publication-title: Journal of the Operations Research – start-page: 623 year: 2013 end-page: 630 ident: b0090 article-title: Revisiting the NSGA-II crowding-distance computation publication-title: Proceedings of the 15th annual conference on Genetic and evolutionary computation – start-page: 55 year: 2003 end-page: 82 ident: b0145 article-title: Genetic algorithms publication-title: Handbook of Metaheuristics – volume: 46 start-page: 153 year: 2012 end-page: 169 ident: b0045 article-title: Twenty-five years of hub location research publication-title: Transportation Science – volume: 40 start-page: 465 year: 2012 end-page: 477 ident: b0100 article-title: The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach publication-title: Omega – volume: 190 start-page: 1 year: 2008 end-page: 21 ident: b0010 article-title: Network hub location problems: The state of the art publication-title: European Journal of Operational Research – volume: 53 start-page: 916 year: 2015 end-page: 928 ident: b0015 article-title: Applying genetic algorithm to a new location and routing model of hazardous materials publication-title: International Journal of Production Research – start-page: 1 year: 2017 end-page: 26 ident: b0165 article-title: A survey of the standard location-routing problem publication-title: Annals of Operations Research – volume: 54 start-page: 3561 year: 2016 end-page: 3577 ident: b0070 article-title: A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem publication-title: International Journal of Production Research – volume: 39 start-page: 2865 year: 2012 end-page: 2871 ident: b0075 article-title: Genetic algorithm with iterated local search for solving a location-routing problem publication-title: Expert Systems with Applications – start-page: 163 year: 1988 end-page: 198 ident: b0105 article-title: Location routing problems publication-title: Vehicle routing: Methods and studies – volume: 55 start-page: 200 year: 2015 end-page: 216 ident: b0095 article-title: A memetic algorithm for the capacitated location-routing problem with mixed backhauls publication-title: Computers & Operations Research – volume: 8 start-page: 11 year: 2015 end-page: 20 ident: b0195 article-title: Multimodal transportation p-hub location routing problem with simultaneous pick-ups and deliveries publication-title: Journal of Optimization in Industrial Engineering – volume: Vol. 409 start-page: 1188 year: 2013 end-page: 1192 ident: b0175 article-title: An integrated hub location and multi-depot vehicle routing problem publication-title: Applied Mechanics and Materials – volume: 54 start-page: 526 year: 2016 end-page: 549 ident: b0190 article-title: Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing publication-title: International Journal of Production Research – volume: 38 start-page: 539 year: 2011 end-page: 549 ident: b0050 article-title: A branch-and-cut algorithm for the partitioning-hub location-routing problem publication-title: Computers & Operations Research – volume: 3906 start-page: 183 year: 2006 end-page: 194 ident: b0135 article-title: A memetic algorithm with population management (MA∣PM) for the capacitated location-routing problem publication-title: Lecture Notes in Computer Science – volume: 238 start-page: 1 year: 2014 end-page: 17 ident: b0140 article-title: A survey of recent research on location-routing problems publication-title: European Journal of Operational Research – volume: 90 start-page: 403 year: 2004 end-page: 419 ident: b0185 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: 26 start-page: 997 issue: 9 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0170 article-title: Designing incomplete hub location-routing network in urban transportation problem publication-title: International Journal of Engineering-Transactions C: Aspects – volume: 55 start-page: 200 year: 2015 ident: 10.1016/j.cie.2019.05.038_b0095 article-title: A memetic algorithm for the capacitated location-routing problem with mixed backhauls publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.06.009 – volume: 64 start-page: 1096 issue: 4 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0085 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: 54 start-page: 526 issue: 2 year: 2016 ident: 10.1016/j.cie.2019.05.038_b0190 article-title: Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1085655 – volume: 39 start-page: 2865 issue: 3 year: 2012 ident: 10.1016/j.cie.2019.05.038_b0075 article-title: Genetic algorithm with iterated local search for solving a location-routing problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.08.146 – volume: 38 start-page: 539 issue: 2 year: 2011 ident: 10.1016/j.cie.2019.05.038_b0050 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: 3 start-page: 647 issue: 4 (s) year: 2014 ident: 10.1016/j.cie.2019.05.038_b0120 article-title: Applying VNPSO algorithm to solve the many-to-many hub location-routing problem in a large scale publication-title: European Online Journal of Natural and Social Sciences – volume: 47 issue: 3 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0115 article-title: Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries publication-title: Economic Computation & Economic Cybernetics Studies & Research – volume: 72 start-page: 387 issue: 2 year: 1994 ident: 10.1016/j.cie.2019.05.038_b0040 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: 623 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0090 article-title: Revisiting the NSGA-II crowding-distance computation – volume: 8 start-page: 11 issue: 17 year: 2015 ident: 10.1016/j.cie.2019.05.038_b0195 article-title: Multimodal transportation p-hub location routing problem with simultaneous pick-ups and deliveries publication-title: Journal of Optimization in Industrial Engineering – start-page: 1383 year: 2015 ident: 10.1016/j.cie.2019.05.038_b0030 article-title: A model and a metaheuristic method for the hub location routing problem and application to postal services – volume: 2 start-page: 393 issue: 4 year: 1954 ident: 10.1016/j.cie.2019.05.038_b0060 article-title: Solution of a large-scale traveling-salesman problem publication-title: Journal of the Operations Research – volume: 90 start-page: 403 issue: 3 year: 2004 ident: 10.1016/j.cie.2019.05.038_b0185 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: 54 start-page: 3561 issue: 12 year: 2016 ident: 10.1016/j.cie.2019.05.038_b0070 article-title: A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1084063 – volume: 236 start-page: 863 issue: 3 year: 2014 ident: 10.1016/j.cie.2019.05.038_b0150 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: 7 start-page: 35 issue: 1–2 year: 1987 ident: 10.1016/j.cie.2019.05.038_b0020 article-title: Integrated facility location and vehicle routing models: Recent work and future prospects publication-title: American Journal of Mathematical and Management Sciences doi: 10.1080/01966324.1987.10737207 – start-page: 1 year: 2017 ident: 10.1016/j.cie.2019.05.038_b0165 article-title: A survey of the standard location-routing problem publication-title: Annals of Operations Research – volume: 37 start-page: 153 issue: 2 year: 2003 ident: 10.1016/j.cie.2019.05.038_b0005 article-title: An improved branch-and-cut algorithm for the capacitated vehicle routing problem publication-title: Transportation Science doi: 10.1287/trsc.37.2.153.15243 – volume: 181 start-page: 109 issue: 1 year: 2010 ident: 10.1016/j.cie.2019.05.038_b0055 article-title: Hubbing and routing in postal delivery systems publication-title: Annals of Operations Research doi: 10.1007/s10479-010-0705-2 – volume: 3906 start-page: 183 year: 2006 ident: 10.1016/j.cie.2019.05.038_b0135 article-title: A memetic algorithm with population management (MA∣PM) for the capacitated location-routing problem publication-title: Lecture Notes in Computer Science doi: 10.1007/11730095_16 – volume: 38 start-page: 931 issue: 6 year: 2011 ident: 10.1016/j.cie.2019.05.038_b0025 article-title: A branch-and-cut method for the capacitated location-routing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.09.019 – volume: 37 start-page: 7465 issue: 12 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0065 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: 3 start-page: 413 issue: 2 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0035 article-title: An improved clarke and wright algorithm to solve the capacitated vehicle routing problem publication-title: Engineering, Technology & Applied Science Research doi: 10.48084/etasr.292 – volume: 40 start-page: 465 issue: 4 year: 2012 ident: 10.1016/j.cie.2019.05.038_b0100 article-title: The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach publication-title: Omega doi: 10.1016/j.omega.2011.09.002 – start-page: 163 year: 1988 ident: 10.1016/j.cie.2019.05.038_b0105 article-title: Location routing problems – volume: Vol. 409 start-page: 1188 year: 2013 ident: 10.1016/j.cie.2019.05.038_b0175 article-title: An integrated hub location and multi-depot vehicle routing problem – volume: 50 start-page: 161 year: 2014 ident: 10.1016/j.cie.2019.05.038_b0155 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: 238 start-page: 1 issue: 1 year: 2014 ident: 10.1016/j.cie.2019.05.038_b0140 article-title: A survey of recent research on location-routing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.01.005 – volume: 39 start-page: 461 issue: 2 year: 2012 ident: 10.1016/j.cie.2019.05.038_b0110 article-title: A hierarchical algorithm for the planar single-facility location routing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.05.013 – volume: 177 start-page: 649 issue: 2 year: 2007 ident: 10.1016/j.cie.2019.05.038_b0130 article-title: Location-routing: Issues, models and methods publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.04.004 – volume: 39 start-page: 150 year: 1989 ident: 10.1016/j.cie.2019.05.038_b0160 article-title: The effect of ignoring routes when locating depots publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(89)90188-4 – volume: 190 start-page: 1 issue: 1 year: 2008 ident: 10.1016/j.cie.2019.05.038_b0010 article-title: Network hub location problems: The state of the art publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.06.008 – volume: 6 start-page: 261 issue: 2 year: 1998 ident: 10.1016/j.cie.2019.05.038_b0125 article-title: The many-to-many location-routing problem publication-title: Top doi: 10.1007/BF02564791 – volume: 2015 year: 2015 ident: 10.1016/j.cie.2019.05.038_b0180 article-title: An endosymbiotic evolutionary algorithm for the hub location-routing problem publication-title: Mathematical Problems in Engineering doi: 10.1155/2015/525980 – volume: 46 start-page: 153 issue: 2 year: 2012 ident: 10.1016/j.cie.2019.05.038_b0045 article-title: Twenty-five years of hub location research publication-title: Transportation Science doi: 10.1287/trsc.1120.0410 – volume: 86 start-page: 141 year: 1999 ident: 10.1016/j.cie.2019.05.038_b0080 article-title: Solution algorithms for the capacitated single allocation hub location problem publication-title: Annals of Operations Research doi: 10.1023/A:1018994432663 – start-page: 55 year: 2003 ident: 10.1016/j.cie.2019.05.038_b0145 article-title: Genetic algorithms publication-title: Handbook of Metaheuristics doi: 10.1007/0-306-48056-5_3 – volume: 53 start-page: 916 issue: 3 year: 2015 ident: 10.1016/j.cie.2019.05.038_b0015 article-title: Applying genetic algorithm to a new location and routing model of hazardous materials publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.942010 |
| SSID | ssj0004591 |
| Score | 2.4629674 |
| Snippet | •Solutions of Hub Location Routing Problems with distinct pickup and delivery tours.•MILP model finds solutions of small to medium size instances.•Memetic... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 105 |
| SubjectTerms | Computer Science Hub Location-Routing Problem LTL transport Memetic algorithm Mixed integer programming model Operations Research |
| Title | A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours |
| URI | https://dx.doi.org/10.1016/j.cie.2019.05.038 https://hal.science/hal-02524875 |
| Volume | 135 |
| WOSCitedRecordID | wos000482244100008&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: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMceBQQLQ-tECciI7-2to8WFKUoVJGIUG7Wer2mjhK7Spy0_4U_y8w-7KiICpC4WNFqd2NlvszOzM58Q8hb6XOwCwrfyQWIITyRzInjMnJK6cXCK2XE1HXBt0l0fh7P58l0MPhha2F2y6iu4-vr5PK_ihrGQNhYOvsX4u42hQH4DEKHJ4gdnn8k-HT05Wwy1S1u1NXASq6komVdfm_WVXux6lILx9t8NGl00E5XKjbbVpenqzYzOkpboBqoRTtCzEjRTYb9MakDzdetuROylAemVcRGAavqu4PInv2wUzcmYD2veNPFBrDyROdqY2h_WXXo-ygXXB2XUzjOTd6uiVl4fVKWCaTZYpo-c0kXcLkOGoT6aNL6OI5gJdPctJ3CDtieyvVctnd6e1oB_3Iw6BjF4j0oTMznSxRdq-aVucG3_RXfA18DTFvQeFi-d-ADZOMhOUjPTuef98jodUNG-9720lylD974ot-ZPXcubABfGTSzR-SB8URoqhH0mAxkfUgeGq-EGp2_OST39ygrn5CrlCK8qIIXBRhQAy_awYsCvCjAiwK8qIWXmmrgRQ28KMKLWnjRHl5qsoUXVfB6SmafTmcfxo5p3uGI0I9ah4PvzRkrsZbMZ0WS515UlkFZcJcjwZR0izAPE-6Di1d6ovCx4vkkhyMhYMIrgmdkWDe1fE6o76GbkfAkTmCJH-SxAHtL8kAWggkuj4hrf9pMGGJ77K-yzGwG4wLGZYbSyFyWgTSOyLtuyaVmdbltcmjllRmzVJubGYDrtmVvQLbd9kjjPk4nGY6Bn-FjoGDnHf_b3i_Ivf5v9ZIM2_VWviJ3xa6tNuvXBqc_AWNavnE |
| 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=A+MILP+model+and+memetic+algorithm+for+the+Hub+Location+and+Routing+problem+with+distinct+collection+and+delivery+tours&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Yang%2C+Xiao&rft.au=Bostel%2C+Nathalie&rft.au=Dejax%2C+Pierre&rft.date=2019-09-01&rft.pub=Elsevier+Ltd&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=135&rft.spage=105&rft.epage=119&rft_id=info:doi/10.1016%2Fj.cie.2019.05.038&rft.externalDocID=S0360835219303110 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |