2008
HMS 2008 Proceeding
Sequential ordering problems for crane scheduling in port terminals
Authors: Roberto Montemanni, Andrea Rizzoli, Derek Smith, Luca Maria Gambardella
Abstract
The sequential ordering problem is a version of the asym- metric travelling salesman problem 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 sequential ordering problem 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 contri- butions of the basic ingredients of the state-of-the-art algorithm for the sequential ordering problems local searches, ant colony and heuristic manipulation.
I3M Scientific Sponsors
I3M Industrial Sponsors
I3M Media Sponsors
