A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure
With the explosion of e-commerce, optimising parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation which takes place between sorting centres and delivery depots and is performed on a two-level hierarchical network. In our case study, we descri...
Saved in:
| Published in | International journal of production research Vol. 61; no. 21; pp. 7198 - 7212 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
London
Taylor & Francis
02.11.2023
Taylor & Francis LLC |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0020-7543 1366-588X 1366-588X |
| DOI | 10.1080/00207543.2022.2147233 |
Cover
| Abstract | With the explosion of e-commerce, optimising parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation which takes place between sorting centres and delivery depots and is performed on a two-level hierarchical network. In our case study, we describe the application framework of this industrial problem faced by a French postal company: There are two vehicle types that must be balanced over the network on a daily basis, and there are two possible sorting points for each parcel, which allows a better consolidation of parcels. These industrial constraints are formalised in the Long-Haul Parcel Transportation Problem (LHPTP). We present a Mixed Integer Linear Program (MILP) and a hierarchical algorithm with aggregation of demands which uses the MILP as a subroutine. We perform numerical experiments on large-size datasets provided by a postal company, which consist of approximately 2500 demands on a network of 225 sites. These tests enable the tuning of certain parameters resulting in a tailored heuristic for the LHPTP. Our algorithm can serve as a decision aid tool for transportation managers to build daily transportation plans, modeled on solutions produced given daily demand forecasts and can also be used to improve the network design. |
|---|---|
| AbstractList | With the explosion of e-commerce, optimising parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation which takes place between sorting centres and delivery depots and is performed on a two-level hierarchical network. In our case study, we describe the application framework of this industrial problem faced by a French postal company: There are two vehicle types that must be balanced over the network on a daily basis, and there are two possible sorting points for each parcel, which allows a better consolidation of parcels. These industrial constraints are formalised in the Long-Haul Parcel Transportation Problem (LHPTP). We present a Mixed Integer Linear Program (MILP) and a hierarchical algorithm with aggregation of demands which uses the MILP as a subroutine. We perform numerical experiments on large-size datasets provided by a postal company, which consist of approximately 2500 demands on a network of 225 sites. These tests enable the tuning of certain parameters resulting in a tailored heuristic for the LHPTP. Our algorithm can serve as a decision aid tool for transportation managers to build daily transportation plans, modeled on solutions produced given daily demand forecasts and can also be used to improve the network design. With the explosion of e-commerce, optimizing parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation which takes place between sorting centers and delivery depots and is performed on a twolevel hierarchical network. In our case study, we describe the application framework of this industrial problem faced by a French postal company: There are two vehicle types which must be balanced over the network on a daily basis, and there are two possible sorting points for each parcel, which allows a better consolidation of parcels. These industrial constraints are formalized in the Long-Haul Parcel Transportation Problem (LHPTP). We present a Mixed Integer Linear Program (MILP) and a hierarchical algorithm with aggregation of demands which uses the MILP as a subroutine. We perform numerical experiments on large-size datasets provided by a postal company, which consist of approximately 2500 demands on a network of 225 sites. These tests enable the tuning of certain parameters resulting in a tailored heuristic for the LHPTP. Our algorithm can serve as a decision aid tool for transportation managers to build daily transportation plans, modeled on solutions produced given daily demand forecasts, and can also be used to improve the network design. |
| Author | Gras, Camille Newman, Alantha Herr, Nathalie |
| Author_xml | – sequence: 1 givenname: Camille surname: Gras fullname: Gras, Camille email: camille.gras@grenoble-inp.org organization: Institute of Engineering Université Grenoble Alpes, CNRS, Grenoble INP – sequence: 2 givenname: Nathalie surname: Herr fullname: Herr, Nathalie organization: Probayes – sequence: 3 givenname: Alantha surname: Newman fullname: Newman, Alantha organization: Institute of Engineering Université Grenoble Alpes, CNRS, Grenoble INP |
| BackLink | https://hal.science/hal-03853078$$DView record in HAL |
| BookMark | eNqNkU1r3DAQhkVIIZu0P6Eg6KkHb_RhaeVbl9A0hYVeEuhNTC0pdqqVXElu2H9fGaf0FioYJDTPO8y8c4nOQwwWofeUbClR5JoQRnai5VtGGNsy2u4Y52doQ7mUjVDq-znaLEyzQBfoMucnUo9Q7QaZPTa2H_MYA4bRYPCPMY1lOGIXE_YxPDYDzB5PkHrrcUkQ8hRTgbIofkC2BtfHMNpUiWHsweNgy3NMP3Euae7LnOxb9MaBz_bdy32FHm4_39_cNYdvX77e7A9N37K2ND3vLKEGOt4BtVII4awTzCkL0lHTtqanztRBiLE7Jk2NmmG0o9Z2QnX8Csm17hwmOD2D93pK4xHSSVOiF6_0X6_04pV-8aoKP67CAf5JIoz6bn_Qyx_hSnCyU79pZT-s7JTir9nmop_inEKdSzMlueRUtksrYqX6FHNO1v13J59W3RjqAo5QjfRGFzj5mFw1v65K89dL_AGVZJ13 |
| Cites_doi | 10.1016/j.ejor.2020.05.049 10.1016/S0377-2217(87)80007-3 10.1080/00207543.2019.1571253 10.1080/00207543.2019.1656842 10.2514/6.2021-1233 10.1016/j.cor.2014.06.008 10.1007/978-3-319-24264-4_30 10.1109/ICAL.2007.4338551 10.1016/S0925-5273(00)00152-3 10.1016/0966-6923(94)90032-9 10.1111/1467-9787.00134 10.4995/wpom.v2i1.804 10.1016/j.trb.2010.11.002 10.1007/0-306-48058-1_13 10.1016/j.tre.2008.02.001 10.1007/978-3-030-85914-5_18 10.1080/00207543.2020.1746428 10.1007/978-3-642-27612-5_3 10.1016/S0377-2217(99)00233-7 10.1080/00207543.2019.1680894 10.1287/trsc.24.4.245 10.1287/trsc.1060.0174 10.1007/978-3-319-12856-6_6 10.1016/j.eswa.2014.02.027 10.1016/S0191-2615(03)00013-4 10.1016/S0966-6923(98)00010-6 10.1080/00207543.2015.1040127 |
| ContentType | Journal Article |
| Copyright | 2022 Informa UK Limited, trading as Taylor & Francis Group 2022 2022 Informa UK Limited, trading as Taylor & Francis Group Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2022 Informa UK Limited, trading as Taylor & Francis Group 2022 – notice: 2022 Informa UK Limited, trading as Taylor & Francis Group – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D 1XC VOOES ADTOC UNPAY |
| DOI | 10.1080/00207543.2022.2147233 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1366-588X |
| EndPage | 7212 |
| ExternalDocumentID | oai:HAL:hal-03853078v1 10_1080_00207543_2022_2147233 2147233 |
| Genre | Research Article |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 29J 2DF 30N 4.4 5GY 5VS 8VB A8Z AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFO ACGFS ACGOD ACIWK ACNCT ACTIO ADCVX ADGTB ADXPE AEGXH AEISY AEMOZ AENEX AEOZL AEPSL AEYOC AFKVX AFRVT AGDLA AGMYJ AHDZW AHQJS AIAGR AIJEM AIYEW AJWEG AKBVH AKOOK AKVCP ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO DU5 EBD EBE EBO EBR EBS EBU EMK EPL ESTFP E~A E~B GTTXZ H13 HF~ HZ~ H~9 H~P I-F IPNFZ J.P K1G KYCEM LJTGL M4Z ML~ NA5 NX~ O9- P2P PQQKQ QWB RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TH9 TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZL0 ~S~ AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D 07I 1OL 1TA 1XC 4B5 ABDPE ABRLO ACKIV ACTTO ADUMR ADXEU AEHZU AEZBV AFBWG AFFNX AFION AGBKS AGBLW AGVKY AGWUF AGYFW AI. AKHJE AKMBP ALRRR ALXIB BGSSV BWMZZ C0- C5H CAG COF CYRSC DAOYK DEXXA EJD FETWF IFELN L8C NUSFT OPCYK RNS TAJZE TAP UB6 VH1 VOOES ZCG ZY4 ADTOC UNPAY |
| ID | FETCH-LOGICAL-c424t-c39e01da939a1e6555fef52f8ea6f1d44dc1fd0200de726d726ea62191ee95893 |
| IEDL.DBID | UNPAY |
| ISSN | 0020-7543 1366-588X |
| IngestDate | Sun Oct 26 02:34:46 EDT 2025 Tue Oct 14 20:52:10 EDT 2025 Wed Aug 13 08:18:43 EDT 2025 Wed Oct 01 04:11:15 EDT 2025 Mon Oct 20 23:45:32 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 21 |
| Keywords | Network Design Long-Haul Transportation Hierarchical Network Parcel Transportation Optimization |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 other-oa |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c424t-c39e01da939a1e6555fef52f8ea6f1d44dc1fd0200de726d726ea62191ee95893 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-5094-5921 0000-0003-0723-6123 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://hal.science/hal-03853078 |
| PQID | 2863631649 |
| PQPubID | 30924 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_2863631649 informaworld_taylorfrancis_310_1080_00207543_2022_2147233 hal_primary_oai_HAL_hal_03853078v1 crossref_primary_10_1080_00207543_2022_2147233 unpaywall_primary_10_1080_00207543_2022_2147233 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2023-11-02 |
| PublicationDateYYYYMMDD | 2023-11-02 |
| PublicationDate_xml | – month: 11 year: 2023 text: 2023-11-02 day: 02 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London |
| PublicationTitle | International journal of production research |
| PublicationYear | 2023 |
| Publisher | Taylor & Francis Taylor & Francis LLC |
| Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis LLC |
| References | CIT0010 CIT0012 CIT0011 CIT0014 CIT0013 CIT0016 CIT0015 CIT0018 CIT0017 CIT0019 CIT0021 CIT0020 CIT0001 CIT0023 CIT0022 CIT0003 CIT0025 CIT0002 CIT0024 CIT0005 CIT0027 CIT0004 CIT0026 CIT0007 CIT0029 CIT0006 CIT0028 CIT0009 CIT0008 |
| References_xml | – ident: CIT0026 doi: 10.1016/j.ejor.2020.05.049 – ident: CIT0020 doi: 10.1016/S0377-2217(87)80007-3 – ident: CIT0012 doi: 10.1080/00207543.2019.1571253 – ident: CIT0013 doi: 10.1080/00207543.2019.1656842 – ident: CIT0009 – ident: CIT0028 doi: 10.2514/6.2021-1233 – ident: CIT0006 doi: 10.1016/j.cor.2014.06.008 – ident: CIT0001 doi: 10.1007/978-3-319-24264-4_30 – ident: CIT0029 doi: 10.1109/ICAL.2007.4338551 – ident: CIT0027 doi: 10.1016/S0925-5273(00)00152-3 – ident: CIT0022 doi: 10.1016/0966-6923(94)90032-9 – ident: CIT0002 doi: 10.1111/1467-9787.00134 – ident: CIT0008 doi: 10.4995/wpom.v2i1.804 – ident: CIT0019 doi: 10.1016/j.trb.2010.11.002 – ident: CIT0005 doi: 10.1007/0-306-48058-1_13 – ident: CIT0017 doi: 10.1016/j.tre.2008.02.001 – ident: CIT0010 doi: 10.1007/978-3-030-85914-5_18 – ident: CIT0007 doi: 10.1080/00207543.2020.1746428 – ident: CIT0011 doi: 10.1007/978-3-642-27612-5_3 – ident: CIT0004 doi: 10.1016/S0377-2217(99)00233-7 – ident: CIT0025 doi: 10.1080/00207543.2019.1680894 – ident: CIT0015 doi: 10.1287/trsc.24.4.245 – ident: CIT0024 – ident: CIT0003 doi: 10.1287/trsc.1060.0174 – ident: CIT0018 doi: 10.1007/978-3-319-12856-6_6 – ident: CIT0014 doi: 10.1016/j.eswa.2014.02.027 – ident: CIT0016 doi: 10.1016/S0191-2615(03)00013-4 – ident: CIT0021 doi: 10.1016/S0966-6923(98)00010-6 – ident: CIT0023 doi: 10.1080/00207543.2015.1040127 |
| SSID | ssj0000584 |
| Score | 2.4151201 |
| Snippet | With the explosion of e-commerce, optimising parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation... With the explosion of e-commerce, optimizing parcel transportation has become increasingly important. We study the long-haul stage of parcel transportation... |
| SourceID | unpaywall hal proquest crossref informaworld |
| SourceType | Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 7198 |
| SubjectTerms | Algorithms Computer Science hierarchical network Integer programming Linear programming long-haul transportation Mixed integer Network design Optimisation Optimization parcel transportation Transportation networks Transportation problem Transportation problem (Operations research) |
| Title | A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure |
| URI | https://www.tandfonline.com/doi/abs/10.1080/00207543.2022.2147233 https://www.proquest.com/docview/2863631649 https://hal.science/hal-03853078 |
| UnpaywallVersion | submittedVersion |
| Volume | 61 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Food Science Source customDbUrl: eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 1366-588X databaseCode: A8Z dateStart: 19611101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/login.aspx?authtype=ip,uid&profile=ehost&defaultdb=fsr providerName: EBSCOhost – providerCode: PRVLSH databaseName: aylor and Francis Online customDbUrl: mediaType: online eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 1366-588X databaseCode: AHDZW dateStart: 19970101 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAWR databaseName: Taylor & Francis Science and Technology Library-DRAA customDbUrl: eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 1366-588X databaseCode: 30N dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.tandfonline.com/page/title-lists providerName: Taylor & Francis |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lj9MwEB7ttgfgwBtRWFYW4uoS27GTHCNgVSFYcaCicLHc2N6uNqTVbgqCX884TqouBx6RIllxojj-xp5xPPMNwIs0WbLceE8TJ3OaeiGo4YWiS1RvLHOVNF2uw_enajZP3y7k4gDIEAuzQouzn_tDmYaNKxTD_BDGSqK1PYLx_PRD-Tl6biQ0k9GHXihFZZ4vhiCdQJ-N9aEaF4GcT0M-Hi7ENfVzuOqcH_cpSq8Zmje2zcb8-G7qek_nnNyJvo9XHVVhcDW5mG7b5bT6-RuR458-5y7c7g1OUkYJuQcHrrkPt_ZoCB-ALYntU-0Qc26Jqc_Wl-ft6ivBFpN63ZzRldnWZBPiImvSDnzoHagk6EFLsBCyanf7Egg7aaJ7OYn8tNtL9xDmJ28-vprRPvsCrVKetrQShUuYNYUoDHNKSumdl9znzijPbJrainmLfZxYl3Fl8cQanACZc4VEM-gRjJp14x4DyVyWOCZdCF9PLa5QFDN4cJSDjOHMP4HpAIreRJINzXbcpRFFHVDUPYoTeI69ubs3UGTPync6XBt6-BubQLGPrG67XyA-5ivR4i8vOBrEQPeD-krzXAklcH1ZTODlTjT-rcVP_vuJp3AzpLbv4h75EYwQLvcMDaB2eQzjcvb6y6fjfiz8AoS2-2A |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZT9wwEB4BfaB9oC0t6gKlVsWrt_GV43GFiraw7BNIvFne2GYRIbui2Vbtr-84xzZUqlqJSJGiOIeP8Rz2zDcAxzKasdR4TyOnUiq9ENTwLKYzFG8scbkyda7Di2k8vpJn1-q6FwsT3CqDDe0boIiaV4fJHRajO5e4EMKNkk4KNO84H4ZMO1yITXimUNkPWQxENP3NjVXaIjFHNLzTRfH87TOP5NPmvPaO7GOYPtJEt1fl0vz4boqiJ5ROX0LeNafxRbkbrqrZMP_5B9Lj09r7CnZanZWMGiJ7DRuu3IUXPSTDN2BHxLbZeoi5tcQUN4uH22p-T7BNpFiUN3RuVgVZhtDKglQdpHpNFySIUkvwIiTmrrc2kHJI2XiokwbidvXg3sLV6efLkzFtEzjQXHJZ0VxkLmLWZCIzzMVKKe-84j51JvbMSmlz5i02LrIu4bHFE0uQhzLnMoWa1B5slYvSvQOSuCRyTLkQAS8tGjkxM3hwJKWEofAYwLAbNr1scDo0W8OfNt2nQ_fptvsG8BEHd_1sQNkejyY63Aubpcj60m9sAFl_7HVVr6L4JuWJFv_4wWFHKLrlC181T2MRCzRRswF8WhPP_9V4_wmV-QDb48uLiZ58mZ4fwHMsEnVAJT-ELRxE9x41q2p2VE-dXzdQEm0 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Zb9QwEB7RInE8lKuIhQIW4tVLfCZ5XFFWC5QVD1TizXJiu1s1za7aLAh-PeMcyxYJgdRIkaI4h8eezBHPfAPwWiYFy2wINPEqozIIQS3PNS1QvbHUl8q2tQ4_zfXsWH74qoZowss-rDL60KEDimhldfy4Vy4MEXExgxsVnRTo3XE-joV2uBA7cFPHVbGYxZHMfwtjlfVAzAmN9wxJPH97zBX1tLNogyO3IUyvGKK31_XK_vhuq2pLJ03vQTFQ04WinI3XTTEuf_4B9Hgtcu_DXm-xkknHYg_ghq8fwt0tHMNH4CbE9bV6iD11xFYny4vTZnFOkCRSLesTurDriqxiYmVFmgFQveUKEhWpI3gQy3K3CxvIN6Tu4tNJB3C7vvD7cDx99-XtjPblG2gpuWxoKXKfMGdzkVvmtVIq-KB4yLzVgTkpXcmCQ-IS51OuHe7YghKUeZ8rtKMew269rP0TIKlPE8-Uj_nv0qGLo5nFjSMjpQxVxwjGw6yZVYfSYdgG_LQbPhOHz_TDN4JXOLebayPG9mxyZOK5uFSKgi_7xkaQb0-9adp_KKEreGLEP15wMPCJ6aXCpeGZFlqgg5qP4M2Gd_6vx0-v0ZmXcOvz4dQcvZ9_fAZ3sEW02ZT8AHZxDv1zNKua4kX74fwCuhMREQ |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED5t3QPsARg_tMJAFuLVJbZjJ3msEFOFxsQDlbony43tdVpIqy3dtP31nOOk6ngAFimSFSeK4-_sO8d33wF8SpM5y433NHEyp6kXghpeKDpH9cYyV0rT5jr8fqom0_TbTM52gPSxMAu0OLu5P5Rp2LhCMcx3YU9JtLYHsDc9_TE-i54bCc1k9KEXSlGZ57M-SCfQZ2N9qMZFIOejkI-HC_FA_ewuWufHbYrSB4bmk3W9Mne3pqq2dM7x8-j7eN1SFQZXk8vRupmPyvs_iBz_9jkv4FlncJJxlJAD2HH1S9jfoiF8BXZMbJdqh5gLS0x1vry6aBa_CLaYVMv6nC7MuiKrEBdZkabnQ29BJUEPWoKFkFW73ZdA2Ekd3ctJ5KddX7nXMD3--vPLhHbZF2iZ8rShpShcwqwpRGGYU1JK77zkPndGeWbT1JbMW-zjxLqMK4sn1uAEyJwrJJpBb2BQL2t3CCRzWeKYdCF8PbW4QlHM4MFRDjKGM_8QRj0oehVJNjTbcJdGFHVAUXcoDuEj9ubm3kCRPRmf6HCt7-EbNoRiG1ndtL9AfMxXosU_XnDUi4HuBvW15rkSSuD6shjC541o_F-L3z76iXfwNKS2b-Me-REMEC73Hg2gZv6hGwO_AbF0-b8 |
| 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+decision+aid+algorithm+for+long-haul+parcel+transportation+based+on+hierarchical+network+structure&rft.jtitle=International+journal+of+production+research&rft.au=Gras%2C+Camille&rft.au=Herr%2C+Nathalie&rft.au=Newman%2C+Alantha&rft.date=2023-11-02&rft.pub=Taylor+%26+Francis&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=61&rft.issue=21&rft.spage=7198&rft.epage=7212&rft_id=info:doi/10.1080%2F00207543.2022.2147233&rft.externalDocID=2147233 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon |