Solving the resource allocation problem in a multimodal container terminal as a network flow problem

6Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Continuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers (SC) for transportation and storage operations. We assume that SCs are shared among maritime and inland transport modes (truck, train, barge). The problem is thus to decide how many resources to allocate to each transport mode in order to minimize vehicle (vessel, truck, train, barge) delays. We present a mixed integer linear programming model, based on a network flow representation, to solve this allocation problem. The modular structure of the model enables us to represent different container terminals, transport modes and service strategies. We present parts of our model and exemplary applications for a terminal at the "Grand Port Maritime de Marseille" in France. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zehendner, E., Absi, N., Dauzère-Pérès, S., & Feillet, D. (2011). Solving the resource allocation problem in a multimodal container terminal as a network flow problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6971 LNCS, pp. 341–353). https://doi.org/10.1007/978-3-642-24264-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free