Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network

Please always quote using this URN: urn:nbn:de:0297-zib-89700
  • 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.

Download full text files

Export metadata

Author:Junko Hosoda, Stephen J. MaherORCiD, Yuji ShinanoORCiD, Jonas Christoffer Villumsen
Document Type:ZIB-Report
MSC-Classification:68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
CCS-Classification:I. Computing Methodologies
PACS-Classification:00.00.00 GENERAL
Date of first Publication:2023/01/28
Series (Serial Number):ZIB-Report (23-02)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.