A comparison of two exact algorithms for the sequential ordering problem

Papapanagiotou, Vassilis and Jamal, Jafar Mohammad Jehad A R and Montemanni, Roberto and Shobaki, Ghassan and Gambardella, Luca Maria (2015) A comparison of two exact algorithms for the sequential ordering problem. Technical Report UNSPECIFIED

Text A comparison of two exact algorithms for the.pdf Download (288kB)

Abstract

The sequential ordering problem is an NP-hard combinatorial optimization problem that arises in many realworld applications in logistics and scheduling. In this paper, we experimen- tally 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.

Item Type:	Report (Technical Report)
Subjects:	Computer sciences
Department/unit:	Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI
Depositing User:	Corrado Valeri
Date Deposited:	11 Mar 2016 07:31
Last Modified:	11 Mar 2016 07:31
URI:	http://repository.supsi.ch/id/eprint/7166

Actions (login required)

View Item