Highlights Analyze the computational complexity of the FTNPB on an arbitrary network. Develop an efficient heuristic for solving the FTNPB on an arbitrary network. Carry out intensive computing experiments to test our heuristic. Extend the model to the case where arbitrary number of flows can be bundled up to a given limit.
Abstract We consider a freight transportation network model in which we can send goods with or without bundling. When we choose the bundling option, we can send multiple goods, after grouping into a bundle, at the cost of one unit good; however, bundling and unbundling also incur costs. The model was originally developed to solve the problem of relocating empty containers in hinterland transportation, but it also has an application in multimodal freight transportation. We investigate the complexity of the problem and develop an efficient heuristic that uses a network flow algorithm.
Freight transportation network model with bundling option
2019-12-11
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Freight bundling network models: methodology and application
Taylor & Francis Verlag | 1999
|Preface - FREIGHT BUNDLING NETWORK MODELS: METHODOLOGY AND APPLICATION
Online Contents | 1999
|A Review of Intermodal Rail Freight Bundling Operations
British Library Conference Proceedings | 2015
|