A corridor method-based algorithm for the pre-marshalling problem

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

Abstract

To ease the situation and to ensure a high performance of ship, train and truck operations at container terminals, containers sometimes are pre-stowed near to the loading place and in such an order that it fits the loading sequence. This is done after the stowage plan is finished and before ship loading starts. Such a problem may be referred to as pre-marshalling. Motivated by most recent publications on this problem we describe a metaheuristic approach which is able to solve this type of problem. The approach utilizes the paradigm of the corridor method. ©Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Caserta, M., & Voß, S. (2009). A corridor method-based algorithm for the pre-marshalling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5484 LNCS, pp. 788–797). https://doi.org/10.1007/978-3-642-01129-0_89

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