The sequential ordering problem is an NP-hard combinatorial optimization problem that arises in many real-world applications in logistics and scheduling. In this paper, we experimentally compare two exact algorithms that have been recently proposed for solving this problem. The comparison is done on a large set of benchmarks used in published work. In addition to comparing the performance of two different algorithms, this paper reports the closing of nine instances for the first time as well as seventeen improved upper and lower bounds.
A comparison of two exact algorithms for the sequential ordering problem / Papapanagiotou, Vassilis; Jamal, J; Montemanni, Roberto; Shobaki, Ghassan; Gambardella Luca, Maria. - (2015), pp. 73-78. (Intervento presentato al convegno IEEE Conference on System, Process and Control, ICSPC 2015 tenutosi a Bandar Sunway, Malaysia nel 18 - 20 December 2015) [10.1109/SPC.2015.7473562].
A comparison of two exact algorithms for the sequential ordering problem
Jamal J;Montemanni Roberto;
2015
Abstract
The sequential ordering problem is an NP-hard combinatorial optimization problem that arises in many real-world applications in logistics and scheduling. In this paper, we experimentally compare two exact algorithms that have been recently proposed for solving this problem. The comparison is done on a large set of benchmarks used in published work. In addition to comparing the performance of two different algorithms, this paper reports the closing of nine instances for the first time as well as seventeen improved upper and lower bounds.
| File | Dimensione | Formato | |
|---|---|---|---|
|
07473562.pdf
Accesso riservato
Tipologia:
Versione pubblicata dall'editore
Dimensione
900.87 kB
Formato
Adobe PDF
|
900.87 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
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
