<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>8970</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>1</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2023-01-28</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network</title>
    <abstract language="eng">Consolidation of commodities and coordination of vehicle routes are fundamental features of supply chain management problems. While locations for consolidation and coordination are typically known a priori, in adaptive transportation networks this is not the case. The identification of such consolidation locations forms part of the decision making process. Supply chain management problems integrating the designation of consolidation locations with the coordination of long haul and local vehicle routing is not only challenging to solve, but also very difficult to formulate mathematically. In this paper, the first mathematical model integrating location clustering with long haul and local vehicle routing is proposed. This mathematical formulation is used to develop algorithms to find high quality solutions. A novel parallel framework is developed that combines exact and heuristic methods to improve the search for high quality solutions and provide valid bounds. The results demonstrate that using exact methods to guide heuristic search is an effective approach to find high quality solutions for difficult supply chain management problems.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-89700</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <author>Junko Hosoda</author>
    <submitter>Yuji Shinano</submitter>
    <author>Stephen J. Maher</author>
    <author>Yuji Shinano</author>
    <author>Jonas Christoffer Villumsen</author>
    <series>
      <title>ZIB-Report</title>
      <number>23-02</number>
    </series>
    <collection role="ccs" number="I.">Computing Methodologies</collection>
    <collection role="pacs" number="00.00.00">GENERAL</collection>
    <collection role="msc" number="68-XX">COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="persons" number="shinano">Shinano, Yuji</collection>
    <collection role="projects" number="HPO-NAVI">HPO-NAVI</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/8970/ZIB-report-23-02.pdf</file>
  </doc>
  <doc>
    <id>9843</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>165</volume>
    <type>article</type>
    <publisherName>Elsevier BV</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>1</belongsToBibliography>
    <completedDate>2024-02-05</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network</title>
    <abstract language="eng">Consolidation of commodities and coordination of vehicle routes are fundamental features of supply chain management problems. While locations for consolidation and coordination are typically known a priori, in adaptive transportation networks this is not the case. The identification of such consolidation locations forms part of the decision making process. Supply chain management problems integrating the designation of consolidation locations with the coordination of long haul and local vehicle routing is not only challenging to solve, but also very difficult to formulate mathematically. In this paper, the first mathematical model integrating location clustering with long haul and local vehicle routing is proposed. This mathematical formulation is used to develop algorithms to find high quality solutions. A novel parallel framework is developed that combines exact and heuristic methods to improve the search for high quality solutions and provide valid bounds. The results demonstrate that using exact methods to guide heuristic search is an effective approach to find high quality solutions for difficult supply chain management problems.</abstract>
    <parentTitle language="eng">Computers &amp; Operations Research</parentTitle>
    <identifier type="doi">10.1016/j.cor.2024.106570</identifier>
    <identifier type="issn">0305-0548</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_doi_json">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T04:26:10Z","timestamp":1729743970707,"version":"3.28.0"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T00:00:00Z","timestamp":1707091200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp;amp; Operations Research"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1016\/j.cor.2024.106570","type":"journal-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T16:31:51Z","timestamp":1707150711000},"page":"106570","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network"],"prefix":"10.1016","volume":"165","author":[{"given":"Junko","family":"Hosoda","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3773-6882","authenticated-orcid":false,"given":"Stephen J.","family":"Maher","sequence":"additional","affiliation":[]},{"given":"Yuji","family":"Shinano","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0056-6656","authenticated-orcid":false,"given":"Jonas Christoffer","family":"Villumsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2024.106570_b1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","article-title":"Using clustering analysis in a capacitated location-routing problem","volume":"179","author":"Barreto","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2024.106570_b2","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1287\/opre.2017.1624","article-title":"The continuous-time service network design problem","volume":"65","author":"Boland","year":"2017","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b3","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ejor.2014.03.012","article-title":"Synchronization in cross-docking networks: A research classification and framework","volume":"239","author":"Buijs","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2024.106570_b4","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1016\/j.cor.2012.04.003","article-title":"Lower and upper bounds for the two-echelon capacitated location-routing problem","volume":"39","author":"Contardo","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b5","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.ejor.2011.11.009","article-title":"General network design: A unified view of combined location and network design problems","volume":"219","author":"Contreras","year":"2012","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2024.106570_b6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","article-title":"Service network design in freight transportation","volume":"122","author":"Crainic","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2024.106570_b7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/1.9780898718515.ch9","article-title":"VRP with pickup and delivery","volume":"9","author":"Desaulniers","year":"2002","journal-title":"Veh. Routing Probl."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing\u2014A survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.cor.2024.106570_b9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","article-title":"A survey of variants and extensions of the location-routing problem","volume":"241","author":"Drexl","year":"2015","journal-title":"European J. Oper. Res."},{"year":"2023","series-title":"Gurobi - the fastest solver","author":"Gurobi","key":"10.1016\/j.cor.2024.106570_b10"},{"issue":"6","key":"10.1016\/j.cor.2024.106570_b11","doi-asserted-by":"crossref","DOI":"10.3390\/su11061634","article-title":"Intermodal container routing: Integrating long-Haul routing and local drayage decisions","volume":"11","author":"Heggen","year":"2019","journal-title":"Sustainability"},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b12","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","article-title":"A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem","volume":"48","author":"Holmberg","year":"2000","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2024.106570_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejtl.2022.100091","article-title":"Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing","volume":"11","author":"Hosoda","year":"2022","journal-title":"EURO J. Transp. Logist."},{"issue":"5","key":"10.1016\/j.cor.2024.106570_b14","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1080\/13675567.2013.820272","article-title":"Capacitated hierarchical clustering heuristic for multi depot location-routing problems","volume":"16","author":"Lam","year":"2013","journal-title":"Int. J. Logist. Res. Appl."},{"issue":"2","key":"10.1016\/j.cor.2024.106570_b15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s13676-017-0114-7","article-title":"Integrating long-haul and local transportation planning: The service network design and routing problem","volume":"8","author":"Medina","year":"2019","journal-title":"EURO J. Transp. Logist."},{"issue":"6","key":"10.1016\/j.cor.2024.106570_b16","first-page":"515","article-title":"An integrated model of facility location and transportation network design","volume":"35","author":"Melkote","year":"2001","journal-title":"Transp. Res. Part A: Policy Prac."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b17","first-page":"217","article-title":"The pickup and delivery problem with time windows and transshipment","volume":"44","author":"Mitrovi\u0107-Mini\u0107","year":"2006","journal-title":"INFOR: Inform. Syst. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2024.106570_b18","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","article-title":"Location-routing: Issues, models and methods","volume":"177","author":"Nagy","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b19","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","article-title":"The two-Echelon capacitated vehicle routing problem: Models and math-based heuristics","volume":"45","author":"Perboli","year":"2011","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2024.106570_b20","series-title":"Comput. Logist.","first-page":"101","article-title":"The pickup and delivery problem with cross-docking opportunity","author":"Petersen","year":"2011"},{"issue":"2","key":"10.1016\/j.cor.2024.106570_b21","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/ijoc.2018.0826","article-title":"A branch-and-bound approach to the Traveling Salesman problem with a drone","volume":"31","author":"Poikonen","year":"2019","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b22","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2013.10.038","article-title":"New mixed integer-programming model for the pickup-and-delivery problem with transshipment","volume":"235","author":"Rais","year":"2014","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2024.106570_b23","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.trc.2020.01.019","article-title":"Joint optimization of customer location clustering and drone-based routing for last-mile deliveries","volume":"114","author":"Salama","year":"2020","journal-title":"Transp. Res. C"},{"issue":"4","key":"10.1016\/j.cor.2024.106570_b24","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1016\/j.cor.2012.11.021","article-title":"The pickup and delivery problem with cross-docking","volume":"40","author":"Santos","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2024.106570_b25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2024.106570_b26","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1287\/ijoc.2017.0762","article-title":"FiberSCIP\u2014A shared memory parallelization of SCIP","volume":"30","author":"Shinano","year":"2018","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2024.106570_b27","doi-asserted-by":"crossref","unstructured":"Tateiwa, Nariaki, Shinano, Yuji, Yamamura, Keiichiro, Yoshida, Akihiro, Kaji, Shizuo, Yasuda, Masaya, Fujisawa, Katsuki, 2021. CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems. In: 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics. HiPC, pp. 42\u201352.","DOI":"10.1109\/HiPC53243.2021.00018"},{"year":"2023","series-title":"UG: Ubiquity Generator framework","author":"UG version 1.0","key":"10.1016\/j.cor.2024.106570_b28"},{"key":"10.1016\/j.cor.2024.106570_b29","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.eswa.2018.03.018","article-title":"Two-echelon location-routing optimization with time windows based on customer clustering","volume":"104","author":"Wang","year":"2018","journal-title":"Expert Syst. Appl."},{"issue":"12","key":"10.1016\/j.cor.2024.106570_b30","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1057\/jors.2008.108","article-title":"Vehicle routing with cross-docking","volume":"60","author":"Wen","year":"2009","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2024.106570_b31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-007-0079-2","article-title":"Service network design for freight transportation: A review","volume":"30","author":"Wieberneit","year":"2008","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cor.2024.106570_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105110","article-title":"A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments","volume":"126","author":"Wolfinger","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2024.106570_b33","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s13676-018-0131-1","article-title":"A matheuristic for a multimodal long haul routing problem","volume":"8","author":"Wolfinger","year":"2019","journal-title":"EURO J. Transp. Logist."},{"issue":"3","key":"10.1016\/j.cor.2024.106570_b34","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1016\/j.ejor.2023.02.030","article-title":"A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows","volume":"309","author":"Yin","year":"2023","journal-title":"European J. Oper. Res."}],"container-title":["Computers &amp;amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482400042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482400042X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T02:22:32Z","timestamp":1729736552000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505482400042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":34,"alternative-id":["S030505482400042X"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.cor.2024.106570","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network","name":"articletitle","label":"Article Title"},{"value":"Computers &amp; Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2024.106570","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106570"}}</enrichment>
    <enrichment key="opus_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="opus_crossrefLicence">https://www.elsevier.com/tdm/userlicense/1.0/</enrichment>
    <enrichment key="opus_import_origin">crossref</enrichment>
    <enrichment key="opus_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PersonAuthorFirstName_3,PersonAuthorLastName_3,PersonAuthorFirstName_4,PersonAuthorLastName_4,PersonAuthorIdentifierOrcid_4,PublisherName,TitleMain_1,Language,TitleParent_1,ArticleNumber,Volume,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <author>Junko Hosoda</author>
    <submitter>Yuji Shinano</submitter>
    <author>Stephen J. Maher</author>
    <author>Yuji Shinano</author>
    <author>Jonas Christoffer Villumsen</author>
    <collection role="persons" number="shinano">Shinano, Yuji</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="projects" number="MODAL-EnergyLab">MODAL-EnergyLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>8343</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing</title>
    <abstract language="eng">The routing of commodities is a tactical problem in supply chain management that aims to synchronise transportation services connecting a network of warehouses and consolidation locations. This paper considers the routing of commodities in a transportation network that is flexible in response to demand through changes to regional warehouse clustering and the designation of consolidation locations. Traditionally, warehouse clustering and consolidation locations are determined as part of strategic planning that is performed months to years in advance of operations---limiting the flexibility in transportation networks to respond to changes in demand. A mathematical programming-based algorithmic framework is proposed to integrate the strategic decisions of location planning with tactical decisions of vehicle routing and synchronisation. A multi-armed bandit problem is developed to explore warehouse clustering decisions and exploit those that lead to small transportation costs. An extensive computational study will show that the proposed algorithmic framework effectively integrates strategic and tactical planning decisions to reduce the overall transportation costs.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-83438</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Junko Hosoda</author>
    <submitter>Stephen Maher</submitter>
    <author>Stephen J. Maher</author>
    <author>Yuji Shinano</author>
    <author>Jonas Christoffer Villumsen</author>
    <series>
      <title>ZIB-Report</title>
      <number>21-12</number>
    </series>
    <collection role="persons" number="shinano">Shinano, Yuji</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/8343/report.pdf</file>
  </doc>
  <doc>
    <id>9874</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>1</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2024-12-09</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Combining Benders’ decomposition and parallelisation to solve large-scale adaptive network supply chain management problems</title>
    <abstract language="eng">Integrated supply chain network design—combining warehouse clustering&#13;
with inter- and intra-cluster vehicle routing—is a fundamental&#13;
feature of supply chain management problems. In this paper, a&#13;
Benders’ decomposition-based parallel heuristic approach for the integrated&#13;
long-haul and local vehicle routing problem is proposed. The&#13;
proposed algorithm comprises lower- and upper-bound search algorithms&#13;
running in parallel to find high-quality solutions for challenging&#13;
supply chain management problems. A novel Benders’ decomposition&#13;
approach is proposed to aid the improvement in the lower bound for&#13;
large-scale problems. The results demonstrate that the Benders’ decomposition&#13;
approach is effective in finding strong lower bounds and&#13;
is beneficial for obtaining high-quality solutions.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-98744</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Junko Hosoda</author>
    <submitter>Yuji Shinano</submitter>
    <author>Stephen J. Maher</author>
    <author>Yuji Shinano</author>
    <series>
      <title>ZIB-Report</title>
      <number>24-12</number>
    </series>
    <collection role="ccs" number="I.">Computing Methodologies</collection>
    <collection role="pacs" number="00.00.00">GENERAL</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="persons" number="shinano">Shinano, Yuji</collection>
    <collection role="projects" number="HPO-NAVI">HPO-NAVI</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="projects" number="MODAL-EnergyLab">MODAL-EnergyLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/9874/ZIB_Report-24-12.pdf</file>
  </doc>
</export-example>
