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. A problem manipulation technique to be used in conjunction with heuristic algorithms is discussed. The aim of the technique is to make the search space associated with each problem more attractive for the underlying heuristic algorithms. This novel methodology is tested in combination with the state-of-the-art method for the sequential ordering problem. Improved results are obtained, particularly for the largest problems considered.

A heuristic manipulation technique for the sequential ordering problem / Montemanni, Roberto; Smith, Dh; Gambardella Luca, Maria. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 35:12(2008), pp. 3931-3944. [10.1016/j.cor.2007.05.003]

A heuristic manipulation technique for the sequential ordering problem

Montemanni Roberto;
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. A problem manipulation technique to be used in conjunction with heuristic algorithms is discussed. The aim of the technique is to make the search space associated with each problem more attractive for the underlying heuristic algorithms. This novel methodology is tested in combination with the state-of-the-art method for the sequential ordering problem. Improved results are obtained, particularly for the largest problems considered.
2008
35
12
3931
3944
A heuristic manipulation technique for the sequential ordering problem / Montemanni, Roberto; Smith, Dh; Gambardella Luca, Maria. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 35:12(2008), pp. 3931-3944. [10.1016/j.cor.2007.05.003]
Montemanni, Roberto; Smith, Dh; Gambardella Luca, Maria
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
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

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1176642
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 35
  • ???jsp.display-item.citation.isi??? 31
social impact