Sequential ordering problems for crane scheduling in port terminals

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

doi:10.1504/IJSPM.2009.032597

Sequential ordering problems for crane scheduling in port terminals

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

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
Pages (from-to)	348 - 361
Number of pages	13
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 Mar 2010

Keywords

quay cranes
ant colony optimisation
sequential ordering

Access to Document

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

Cite this

@article{be7ca8536b434323b9f0531685f40eeb,

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 = "quay cranes, ant colony optimisation, sequential ordering",

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

year = "2010",

month = mar,

day = "17",

doi = "10.1504/IJSPM.2009.032597",

language = "English",

volume = "5",

pages = "348 -- 361",

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

issn = "1740-2123",

publisher = "Inderscience",

number = "4",

}

TY - JOUR

T1 - Sequential ordering problems for crane scheduling in port terminals

AU - Smith, Derek

AU - Rizzoli, A.E.

AU - Gambardella, L.M.

AU - Montemanni, R.

PY - 2010/3/17

Y1 - 2010/3/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 - quay cranes

KW - ant colony optimisation

KW - sequential ordering

U2 - 10.1504/IJSPM.2009.032597

DO - 10.1504/IJSPM.2009.032597

M3 - Article

SN - 1740-2123

VL - 5

SP - 348

EP - 361

JO - International Journal of Simulation and Process Modelling

JF - International Journal of Simulation and Process Modelling

IS - 4

ER -

Sequential ordering problems for crane scheduling in port terminals

Abstract

Keywords

Access to Document

Fingerprint

Cite this