In this paper, we study the shortest path tour problem in which a shortest path from a given origin node to a given destination node must be found in a directed graph with non-negative arc lengths. Such path needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be different-sized. A polynomial-time reduction of the problem to a classical shortest path problem over a modified digraph is described and two solution methods based on the above reduction and dynamic programming, respectively, are proposed and compared with the state-of-the-art solving procedure. The proposed methods are tested on existing datasets for this problem and on a large class of new benchmark instances. The computational experience shows that both the proposed methods exhibit a consistent improved performance in terms of computational time with respect to the existing solution method
Solving the Shortest Path Tour Problem / Festa, P; Guerriero, F; Laganà, D; Musmanno, R. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 230:3(2013), pp. 3.464-3.474.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Solving the Shortest Path Tour Problem|
|Data di pubblicazione:||2013|
|Citazione:||Solving the Shortest Path Tour Problem / Festa, P; Guerriero, F; Laganà, D; Musmanno, R. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 230:3(2013), pp. 3.464-3.474.|
|Appare nelle tipologie:||1.1 Articolo in rivista|