Sequential Ordering Problems for Crane Scheduling in Port Terminals

Derek Smith; R. Montemanni; A.E. Rizzoli; L.M. Gambardella

doi:10.1504/IJSPM.2009.032597

Sequential Ordering Problems for Crane Scheduling in Port Terminals

Derek Smith, R. Montemanni, A.E. Rizzoli, L.M. Gambardella

Faculty of Computing, Engineering and Science

Research output: Contribution to journal › Article › peer-review

Abstract

The Sequential Ordering Problem (SOP) is a version of the Asymmetric Travelling Salesman Problem (ATSP) where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The SOP models many real world applications, mainly in the fields of transportation and production planning. In particular, it can be used to optimise quay crane assignments. In this paper, we experimentally evaluate the contributions of the basic ingredients of the state-of-the-art algorithm for the SOPs: Local Searches (LSs), ant colony and heuristic manipulation.

Original language	English
Number of pages	10
Journal	International Journal of Simulation and Process Modelling
Volume	5
Issue number	4
DOIs	https://doi.org/10.1504/IJSPM.2009.032597
Publication status	Published - 17 Sept 2008
Event	11th Intermodal Workshop on Harbor, Maritime and Multimodal Logistic Modeling and Simulation (HMS), International Mediterranean and Latin American Modeling Multiconference (I3M) - Campora San Giovanni, Italy Duration: 17 Sept 2008 → 17 Sept 2008

Keywords

sequential ordering

Access to Document

10.1504/IJSPM.2009.032597Licence: CC BY-NC-ND

Cite this

@article{ae34ac08de5f4684b10a659ee31be70b,

title = "Sequential Ordering Problems for Crane Scheduling in Port Terminals",

abstract = "The Sequential Ordering Problem (SOP) is a version of the Asymmetric Travelling Salesman Problem (ATSP) where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The SOP models many real world applications, mainly in the fields of transportation and production planning. In particular, it can be used to optimise quay crane assignments. In this paper, we experimentally evaluate the contributions of the basic ingredients of the state-of-the-art algorithm for the SOPs: Local Searches (LSs), ant colony and heuristic manipulation.",

keywords = "sequential ordering",

author = "Derek Smith and R. Montemanni and A.E. Rizzoli and L.M. Gambardella",

year = "2008",

month = sep,

day = "17",

doi = "10.1504/IJSPM.2009.032597",

language = "English",

volume = "5",

journal = "International Journal of Simulation and Process Modelling",

issn = "1740-2123",

publisher = "Inderscience",

number = "4",

note = " 11th Intermodal Workshop on Harbor, Maritime and Multimodal Logistic Modeling and Simulation (HMS), International Mediterranean and Latin American Modeling Multiconference (I3M) ; Conference date: 17-09-2008 Through 17-09-2008",

}

TY - JOUR

T1 - Sequential Ordering Problems for Crane Scheduling in Port Terminals

AU - Smith, Derek

AU - Montemanni, R.

AU - Rizzoli, A.E.

AU - Gambardella, L.M.

PY - 2008/9/17

Y1 - 2008/9/17

N2 - The Sequential Ordering Problem (SOP) is a version of the Asymmetric Travelling Salesman Problem (ATSP) where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The SOP models many real world applications, mainly in the fields of transportation and production planning. In particular, it can be used to optimise quay crane assignments. In this paper, we experimentally evaluate the contributions of the basic ingredients of the state-of-the-art algorithm for the SOPs: Local Searches (LSs), ant colony and heuristic manipulation.

AB - The Sequential Ordering Problem (SOP) is a version of the Asymmetric Travelling Salesman Problem (ATSP) where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The SOP models many real world applications, mainly in the fields of transportation and production planning. In particular, it can be used to optimise quay crane assignments. In this paper, we experimentally evaluate the contributions of the basic ingredients of the state-of-the-art algorithm for the SOPs: Local Searches (LSs), ant colony and heuristic manipulation.

KW - sequential ordering

U2 - 10.1504/IJSPM.2009.032597

DO - 10.1504/IJSPM.2009.032597

M3 - Article

SN - 1740-2123

VL - 5

JO - International Journal of Simulation and Process Modelling

JF - International Journal of Simulation and Process Modelling

IS - 4

T2 - 11th Intermodal Workshop on Harbor, Maritime and Multimodal Logistic Modeling and Simulation (HMS), International Mediterranean and Latin American Modeling Multiconference (I3M)

Y2 - 17 September 2008 through 17 September 2008

ER -

Sequential Ordering Problems for Crane Scheduling in Port Terminals

Abstract

Keywords

Access to Document

Fingerprint

Cite this