Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/6363
Title: A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations
Authors: Fábio Silva Moreira
Pedro Amorim
Luís Guimarães
Bernardo Almada-Lobo
Issue Date: 2016
Abstract: This research aims at tackling a real-world long-haul freight transportation problem where tractors are allowed to exchange semi-trailers through several transshipment points until a request reaches its destiny. The unique characteristics of the considered logistics network allow for providing long-haul services by means of short-haul jobs, drastically reducing empty truck journeys. A greater flexibility is achieved with faster responses. Furthermore, the planning goals as well as the nature of the considered trips led to the definition of a new problem, the long-haul freight transportation problem with multiple transshipment locations. A novel mathematical formulation is developed to ensure resource synchronization while including realistic features, which are commonly found separately in the literature. Considering the complexity and dimension of this routing and scheduling problem, a mathematical programming heuristic (matheuristic) is developed with the objective of obtaining good quality solutions in a reasonable amount of time, considering the logistics business context. We provide a comparison between the results obtained for 79 real-world instances. The developed solution method is now the basis of a decision support system of a Portuguese logistics operator (LO).
URI: http://repositorio.inesctec.pt/handle/123456789/6363
http://dx.doi.org/10.1016/j.ejor.2015.07.046
metadata.dc.type: article
Publication
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00G-NP2.pdf
  Restricted Access
2.4 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.