The Steiner travelling salesman problem with correlated costs

Letchford, Adam and Nasiri, Saeideh (2015) The Steiner travelling salesman problem with correlated costs. European Journal of Operational Research, 245 (1). 62–69. ISSN 0377-2217

Full text not available from this repository.

Abstract

The Steiner Travelling Salesman Problem (STSP) is a variant of the TSP that is suitable for instances defined on road networks. We consider an extension of the STSP in which the road traversal costs are both stochastic and correlated. This happens, for example, when vehicles are prone to delays due to rush hours, road works or accidents. Following the work of Markowitz on portfolio selection, we model this problem as a bi-objective mean-variance problem. Then, we show how to approximate the efficient frontier via integer programming. We also show how to exploit certain special structures in the correlation matrices. Computational results indicate that our approach is viable for instances with up to 100 nodes. It turns out that minimum variance tours can look rather different from minimum expected cost tours.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
73017
Deposited By:
Deposited On:
24 Feb 2015 08:05
Refereed?:
Yes
Published?:
Published
Last Modified:
20 May 2020 03:37