An Exact A-Based Tree Search Algorithm for TSP With Sequence-and-Load Dependent Risk
The hazardous material transportation requires extensive care owing to the disastrous consequences of accidents, such as chemical spills or radioactive exposures. Consequently, a minimum risk delivery plan that is dynamically decided by the cargo load of the vehicle at each customer must be schedule...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on intelligent transportation systems Jg. 25; H. 9; S. 10817 - 10834 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.09.2024
|
| Schlagworte: | |
| ISSN: | 1524-9050, 1558-0016 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The hazardous material transportation requires extensive care owing to the disastrous consequences of accidents, such as chemical spills or radioactive exposures. Consequently, a minimum risk delivery plan that is dynamically decided by the cargo load of the vehicle at each customer must be scheduled. We introduce a traveling salesman problem (TSP) with a sequence-and-load dependent risk, which differs from the conventional TSP as the arc costs are determined by the hazardous cargo load at each decision epoch. We define our problem in a dynamic programming formulation and present mixed-integer linear program with a nonlinear objective function. To efficiently retrieve exact optimal solutions, we propose an iterative-deepening A*-based tree search algorithm using admissible lower and efficient upper bound algorithms for guaranteed optimality. Numerical experiments indicate that the proposed algorithm outperforms a current state-of-the-art solver. An ablation study and sensitivity analysis demonstrate the effectiveness of the proposed algorithm and derive managerial insights. |
|---|---|
| AbstractList | The hazardous material transportation requires extensive care owing to the disastrous consequences of accidents, such as chemical spills or radioactive exposures. Consequently, a minimum risk delivery plan that is dynamically decided by the cargo load of the vehicle at each customer must be scheduled. We introduce a traveling salesman problem (TSP) with a sequence-and-load dependent risk, which differs from the conventional TSP as the arc costs are determined by the hazardous cargo load at each decision epoch. We define our problem in a dynamic programming formulation and present mixed-integer linear program with a nonlinear objective function. To efficiently retrieve exact optimal solutions, we propose an iterative-deepening A*-based tree search algorithm using admissible lower and efficient upper bound algorithms for guaranteed optimality. Numerical experiments indicate that the proposed algorithm outperforms a current state-of-the-art solver. An ablation study and sensitivity analysis demonstrate the effectiveness of the proposed algorithm and derive managerial insights. |
| Author | Cha, Hyungjoo Lu, Qing-Chang Eun, Joonyup Lee, Chanho Cheong, Taesu Xie, Chi |
| Author_xml | – sequence: 1 givenname: Hyungjoo orcidid: 0009-0005-7662-7760 surname: Cha fullname: Cha, Hyungjoo email: hyungjoo_cha@korea.ac.kr organization: School of Industrial Management Engineering, Korea University, Seoul, South Korea – sequence: 2 givenname: Chanho orcidid: 0009-0008-6621-231X surname: Lee fullname: Lee, Chanho email: 2015170731@korea.ac.kr organization: School of Industrial Management Engineering, Korea University, Seoul, South Korea – sequence: 3 givenname: Chi surname: Xie fullname: Xie, Chi email: chi.xie@tongji.edu.cn organization: School of Transportation Engineering, Urban Mobility Institute, Tongji University, Shanghai, China – sequence: 4 givenname: Qing-Chang orcidid: 0000-0001-9616-2271 surname: Lu fullname: Lu, Qing-Chang email: qclu@chd.edu.cn organization: School of Electronics and Control Engineering, Chang'an University, Xi'an, Shaanxi, China – sequence: 5 givenname: Joonyup orcidid: 0000-0002-4970-8224 surname: Eun fullname: Eun, Joonyup email: jeun@korea.ac.kr organization: Graduate School of Management of Technology, Korea University, Seoul, South Korea – sequence: 6 givenname: Taesu orcidid: 0000-0002-8340-825X surname: Cheong fullname: Cheong, Taesu email: tcheong@korea.ac.kr organization: Department of Battery-Smart Factory, School of Industrial Management Engineering, Korea University, Seoul, South Korea |
| BookMark | eNp9kM9Kw0AQhxepYFt9AMHDvsDW_Ztkj7FWLRQUG_EYJtmJjbabuomgb29CPYgHTzPzG74Z-CZk5BuPhJwLPhOC28tsma1nkks9UyrRJo6OyFgYkzDORTQaeqmZ5YafkEnbvvapNkKMSZZ6uviEsqMpu4IWHc0CIl0jhHJD0-1LE-pus6NVE2i2fqDP_dRv3z_Ql8jAO7ZqwNFr3KN36Dv6WLdvp-S4gm2LZz91Sp5uFtn8jq3ub5fzdMVKGUUdS1SkoCoqg1bJQhc20dyZIuHGWemUMM4gxLZwieAFoJbOcgsxd1UECBFXUyIOd8vQtG3AKt-HegfhKxc8H7Tkg5Z80JL_aOmZ-A9T1h10deO7APX2X_LiQNaI-OuT4VJpqb4BrTlxPw |
| CODEN | ITISFG |
| CitedBy_id | crossref_primary_10_1016_j_autcon_2025_106290 crossref_primary_10_1007_s10586_025_05115_4 |
| Cites_doi | 10.1016/j.orl.2004.02.006 10.1016/j.trd.2014.11.009 10.1109/JSYST.2020.2966788 10.1016/j.ejor.2021.11.045 10.1007/s10107-005-0644-x 10.1016/j.eswa.2020.113714 10.1016/j.ejor.2014.08.005 10.1016/j.eswa.2015.12.036 10.1109/jas.2023.123300 10.1109/TNNLS.2021.3068828 10.1609/socs.v1i1.18164 10.1016/B978-0-12-385963-1.00004-6 10.1109/TITS.2020.2972389 10.1109/TITS.2022.3180288 10.1016/j.cie.2018.10.044 10.1016/j.ins.2017.02.011 10.1109/TITS.2013.2243836 10.1016/0004-3702(85)90084-0 10.1109/TNNLS.2021.3105905 10.1109/TITS.2021.3086625 10.1109/TITS.2017.2742600 10.1016/j.omega.2019.06.004 10.1016/0004-3702(77)90005-4 10.1016/j.cor.2005.06.012 10.1016/S0004-3702(01)00094-7 10.1016/j.trc.2008.10.001 10.1016/j.trb.2019.03.005 10.1016/j.trd.2019.02.010 10.1016/j.cor.2005.06.004 10.1016/j.eswa.2018.08.008 10.1287/opre.2.4.393 10.1145/321043.321046 10.1016/j.tre.2021.102337 10.1016/j.ejor.2021.09.009 10.1007/BF01585563 10.1287/trsc.1090.0301 10.1016/j.ejor.2015.11.034 10.1016/j.sbspro.2010.04.022 10.1287/opre.45.3.378 10.1016/S0377-2217(03)00041-9 10.1016/j.trd.2015.04.010 10.1109/JAS.2022.105677 10.1016/j.trb.2011.02.004 10.1016/j.tre.2021.102325 10.1016/j.cor.2020.104966 10.1109/TITS.2022.3147924 10.1287/trsc.37.2.170.15248 10.1287/opre.18.6.1138 10.1287/opre.4.1.61 10.1109/TITS.2021.3125721 10.1109/ACCESS.2021.3070054 10.1016/j.ejor.2022.02.028 10.1109/TSSC.1968.300136 10.3390/ijerph17041259 10.1016/j.ejor.2017.12.042 10.1057/s41274-016-0173-4 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TITS.2024.3384576 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0016 |
| EndPage | 10834 |
| ExternalDocumentID | 10_1109_TITS_2024_3384576 10502342 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Framework of International Cooperation Program managed by the National Research Foundation of Korea grantid: NRF-2021K2A9A2A06047937 funderid: 10.13039/501100003725 – fundername: National Research Foundation of Korea (NRF) Grant – fundername: Korea Government through Ministry of Trade, Industry and Energy (MOTIE) (Competency Development Program for Industry Specialist) grantid: P0020649 funderid: 10.13039/501100003661 – fundername: Korean Government through Ministry of Science and ICT (MSIT) grantid: NRF-2021R1F1A1059302 – fundername: Korea Institute for Advancement of Technology (KIAT) Grant |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RNS ZY4 AAYXX CITATION |
| ID | FETCH-LOGICAL-c266t-8363afbf5e932b4b9840d5b805d92d315d5ea79bd810bae42d909a70df6aea603 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001205820500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1524-9050 |
| IngestDate | Sat Nov 29 06:35:07 EST 2025 Tue Nov 18 21:01:00 EST 2025 Wed Aug 27 02:03:44 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c266t-8363afbf5e932b4b9840d5b805d92d315d5ea79bd810bae42d909a70df6aea603 |
| ORCID | 0000-0002-4970-8224 0000-0001-9616-2271 0009-0008-6621-231X 0000-0002-8340-825X 0009-0005-7662-7760 |
| PageCount | 18 |
| ParticipantIDs | crossref_primary_10_1109_TITS_2024_3384576 ieee_primary_10502342 crossref_citationtrail_10_1109_TITS_2024_3384576 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-09-01 |
| PublicationDateYYYYMMDD | 2024-09-01 |
| PublicationDate_xml | – month: 09 year: 2024 text: 2024-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE transactions on intelligent transportation systems |
| PublicationTitleAbbrev | TITS |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref57 ref12 ref15 ref59 ref14 ref58 ref53 ref52 ref55 ref10 ref54 Augerat (ref7) 1998 ref17 ref16 ref19 ref18 Administration (ref1) 2001 Levins (ref41) 2018 Nazari (ref49); 31 ref50 ref46 ref45 ref48 ref47 ref42 ref44 ref43 ref8 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref39 Van Rossum (ref56) 2020 ref38 Bujel (ref11) 2018 Future (ref23) 2021 ref24 (ref29) 2022 ref25 ref20 ref64 ref63 ref22 ref66 ref21 ref65 ref28 ref27 (ref26) 2022 ref60 ref62 ref61 Perron (ref51) 2019 |
| References_xml | – ident: ref16 doi: 10.1016/j.orl.2004.02.006 – ident: ref17 doi: 10.1016/j.trd.2014.11.009 – ident: ref35 doi: 10.1109/JSYST.2020.2966788 – ident: ref47 doi: 10.1016/j.ejor.2021.11.045 – ident: ref22 doi: 10.1007/s10107-005-0644-x – ident: ref36 doi: 10.1016/j.eswa.2020.113714 – ident: ref10 doi: 10.1016/j.ejor.2014.08.005 – ident: ref5 doi: 10.1016/j.eswa.2015.12.036 – ident: ref43 doi: 10.1109/jas.2023.123300 – ident: ref59 doi: 10.1109/TNNLS.2021.3068828 – ident: ref2 doi: 10.1609/socs.v1i1.18164 – volume-title: Comparative risks of hazardous materials and non-hazardous materials truck shipment accidents/incidents year: 2001 ident: ref1 – ident: ref3 doi: 10.1016/B978-0-12-385963-1.00004-6 – ident: ref61 doi: 10.1109/TITS.2020.2972389 – ident: ref27 doi: 10.1109/TITS.2022.3180288 – ident: ref33 doi: 10.1016/j.cie.2018.10.044 – ident: ref14 doi: 10.1016/j.ins.2017.02.011 – volume-title: Hazardous Goods Logistics Market Size, Share, Growth|report, 2030 year: 2021 ident: ref23 – ident: ref65 doi: 10.1109/TITS.2013.2243836 – ident: ref37 doi: 10.1016/0004-3702(85)90084-0 – ident: ref63 doi: 10.1109/TNNLS.2021.3105905 – ident: ref64 doi: 10.1109/TITS.2021.3086625 – volume-title: How Common Are Shipping Hazmat Spills? By ASC, Inc year: 2018 ident: ref41 – ident: ref57 doi: 10.1109/TITS.2017.2742600 – ident: ref34 doi: 10.1016/j.omega.2019.06.004 – ident: ref24 doi: 10.1016/0004-3702(77)90005-4 – year: 2018 ident: ref11 article-title: Solving high volume capacitated vehicle routing problem with time windows using recursive-DBSCAN clustering algorithm publication-title: arXiv:1812.02300 – ident: ref4 doi: 10.1016/j.cor.2005.06.012 – volume-title: Hazardous Materials Management (hazmat) | GSA year: 2022 ident: ref29 – ident: ref38 doi: 10.1016/S0004-3702(01)00094-7 – ident: ref9 doi: 10.1016/j.trc.2008.10.001 – ident: ref58 doi: 10.1016/j.trb.2019.03.005 – ident: ref32 doi: 10.1016/j.trd.2019.02.010 – ident: ref12 doi: 10.1016/j.cor.2005.06.004 – ident: ref48 doi: 10.1016/j.eswa.2018.08.008 – year: 1998 ident: ref7 article-title: Computational results with a branch and cut code for the capacitated vehicle routing problem – volume-title: Gurobi Optimizer Reference Manual year: 2022 ident: ref26 – volume: 31 start-page: 1 volume-title: Proc. Adv. Neural Inf. Process. Syst. ident: ref49 article-title: Reinforcement learning for solving the vehicle routing problem – ident: ref13 doi: 10.1287/opre.2.4.393 – ident: ref46 doi: 10.1145/321043.321046 – ident: ref62 doi: 10.1016/j.tre.2021.102337 – volume-title: The Python Library Reference, Release 3.8.2 year: 2020 ident: ref56 – ident: ref20 doi: 10.1016/j.ejor.2021.09.009 – ident: ref25 doi: 10.1007/BF01585563 – ident: ref39 doi: 10.1287/trsc.1090.0301 – ident: ref15 doi: 10.1016/j.ejor.2015.11.034 – ident: ref52 doi: 10.1016/j.sbspro.2010.04.022 – ident: ref18 doi: 10.1287/opre.45.3.378 – ident: ref66 doi: 10.1016/S0377-2217(03)00041-9 – ident: ref53 doi: 10.1016/j.trd.2015.04.010 – ident: ref42 doi: 10.1109/JAS.2022.105677 – ident: ref8 doi: 10.1016/j.trb.2011.02.004 – ident: ref40 doi: 10.1016/j.tre.2021.102325 – ident: ref55 doi: 10.1016/j.cor.2020.104966 – ident: ref60 doi: 10.1109/TITS.2022.3147924 – ident: ref6 doi: 10.1287/trsc.37.2.170.15248 – volume-title: OR-Tools year: 2019 ident: ref51 – ident: ref31 doi: 10.1287/opre.18.6.1138 – ident: ref19 doi: 10.1287/opre.4.1.61 – ident: ref45 doi: 10.1109/TITS.2021.3125721 – ident: ref54 doi: 10.1109/ACCESS.2021.3070054 – ident: ref30 doi: 10.1016/j.ejor.2022.02.028 – ident: ref28 doi: 10.1109/TSSC.1968.300136 – ident: ref44 doi: 10.3390/ijerph17041259 – ident: ref21 doi: 10.1016/j.ejor.2017.12.042 – ident: ref50 doi: 10.1057/s41274-016-0173-4 |
| SSID | ssj0014511 |
| Score | 2.4388204 |
| Snippet | The hazardous material transportation requires extensive care owing to the disastrous consequences of accidents, such as chemical spills or radioactive... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 10817 |
| SubjectTerms | Accidents Hazardous material delivery Hazardous materials Heuristic algorithms iterative deepening A Logistics Optimization Routing Transportation traveling salesman problem |
| Title | An Exact A-Based Tree Search Algorithm for TSP With Sequence-and-Load Dependent Risk |
| URI | https://ieeexplore.ieee.org/document/10502342 |
| Volume | 25 |
| WOSCitedRecordID | wos001205820500001&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0016 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014511 issn: 1524-9050 databaseCode: RIE dateStart: 20000101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA86POjBb3F-kYMnIZq2Sdscp04UZAxXcbeSNK86nJ1snfjn-9JW2UXBW9u8QPml6Xu_vC9CTvMMRzyQTCtpmQDrMRNmAdOR0hCZ3PcNr5pNRL1ePByqfpOsXuXCAEAVfAbn7rLy5dtJNndHZbjDJaoYgX_c5SgK62StH5eBK7RVFUf1BVMo2LgwPa4ukrtkgFTQF-dIyIR09UUWlNBCV5VKqdxs_PN1Nsl6Yz3STr3cW2QJim2ytlBTcIcknYJ2P3VW0g67RBVlaTIFoHVYMe2MnyfTUfnyRtFYpcmgT5_wDkfrgGqmC8vuJ9rS66Y5bkkfRrPXXfJ4002ublnTOoFlqHFLFgdhoHOTS0D7zAijkMdZaWIurfJt4EkrAZfD2NjjRoPwreJKR9zmoQYd8mCPtIpJAfuEegJ8kMjqojAXcQjaeGi1KNzsFsmWtW3Cv7FMs6auuGtvMU4rfsFV6uBPHfxpA3-bnP1Mea-LavwlvOugXxCsUT_45fkhWXXT6ziwI9Iqp3M4JivZRzmaTU-qb-YL5Ny9Sg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT4QwEG6MmqgH38a3PXgy6VqgBXpcdTca141xMXojLR10o7JmRePPdwpo9qKJN6ADIVPKzNd5fIQc5hmOeCCZVtIyAdZjJswCpiOlITK57xtekU1E_X58f6-um2L1qhYGAKrkM2i5wyqWb0fZu9sqwxUu0cQI_OPOOOqsplzrJ2jgWm1V7VF9wRSKNkFMj6vj5CIZIBj0RQshmZCuw8iEGZrgVanMSnfpny-0TBYb_5G26wlfIVNQrJKFia6CayRpF7TzqbOSttkJGilLkzEArROLafv5YTQelo8vFN1Vmgyu6R2e4WidUs10YVlvpC09a-hxS3ozfHtaJ7fdTnJ6zhryBJahzS1ZHISBzk0uAT00I4xCJGelibm0yreBJ60EnBBjY48bDcK3iisdcZuHGnTIgw0yXYwK2CTUE-CDRFwXhbmIQ9DGQ79F4XK3CLes3SL8W5dp1nQWdwQXz2mFMLhKnfpTp_60Uf8WOfq55bVuq_GX8LpT_YRgrfXtX64fkLnz5KqX9i76lztk3j2qzgrbJdPl-B32yGz2UQ7fxvvV9_MF8tfAkw |
| 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=An+Exact+A-Based+Tree+Search+Algorithm+for+TSP+With+Sequence-and-Load+Dependent+Risk&rft.jtitle=IEEE+transactions+on+intelligent+transportation+systems&rft.au=Cha%2C+Hyungjoo&rft.au=Lee%2C+Chanho&rft.au=Xie%2C+Chi&rft.au=Lu%2C+Qing-Chang&rft.date=2024-09-01&rft.issn=1524-9050&rft.eissn=1558-0016&rft.volume=25&rft.issue=9&rft.spage=10817&rft.epage=10834&rft_id=info:doi/10.1109%2FTITS.2024.3384576&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TITS_2024_3384576 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1524-9050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1524-9050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1524-9050&client=summon |