Sequential ordering problems for crane scheduling in port terminals

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

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid


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.
Iaith wreiddiolSaesneg
Tudalennau (o-i)348 - 361
Nifer y tudalennau13
CyfnodolynInternational Journal of Simulation and Process Modelling
Rhif cyhoeddi4
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 17 Maw 2010

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Sequential ordering problems for crane scheduling in port terminals'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn