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.
Sequential ordering problems for crane scheduling in port terminals / Montemanni, Roberto; Smith Derek, H; Rizzoli Andrea, Emilio; Gambardella Luca, Maria. - In: INTERNATIONAL JOURNAL OF SIMULATION AND PROCESS MODELLING. - ISSN 1740-2131. - 5:4(2009), pp. 348-361. [10.1504/IJSPM.2009.032597]
Sequential ordering problems for crane scheduling in port terminals
Montemanni Roberto;
2009
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.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