The sequential ordering problem is a version of the asymmetric 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 contributions of the basic ingredients of the state-of-the-art algorithm for the sequential ordering problems: local searches, ant colony and heuristic manipulation. Copyright © (2008) by CAL-TEK S.r.l.
Sequential ordering problems for crane scheduling in port terminals / Montemanni, R.; Rizzoli, A. E.; Smith, D. H.; Gambardella, L. M.. - (2008), pp. 180-189. (Intervento presentato al convegno 10th International Workshop on Harbor Maritime Multimodal Logistics Modeling and Simulation tenutosi a Amantea, ita nel SEP 17-19, 2008).
Sequential ordering problems for crane scheduling in port terminals
Montemanni R.;
2008
Abstract
The sequential ordering problem is a version of the asymmetric 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 contributions of the basic ingredients of the state-of-the-art algorithm for the sequential ordering problems: local searches, ant colony and heuristic manipulation. Copyright © (2008) by CAL-TEK S.r.l.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
