Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem |
| |
Authors: | Leonora Bianchi Ann Melissa Campbell |
| |
Affiliation: | 1. Dalle Molle Institute for Artificial Intelligence, Switzerland;2. Department of Management Sciences, Tippie College of Business, University of Iowa, USA |
| |
Abstract: | The probabilistic traveling salesman problem is a well known problem that is quite challenging to solve. It involves finding the tour with the lowest expected cost for customers that will require a visit with a given probability. There are several proposed algorithms for the homogeneous version of the problem, where all customers have identical probability of being realized. From the literature, the most successful approaches involve local search procedures, with the most famous being the 2-p-opt and 1-shift procedures proposed by Bertsimas [D.J. Bertsimas, L. Howell, Further results on the probabilistic traveling salesman problem, European Journal of Operational Research 65 (1) (1993) 68–95]. Recently, however, evidence has emerged that indicates the equations offered for these procedures are not correct, and even when corrected, the translation to the heterogeneous version of the problem is not simple. In this paper we extend the analysis and correction to the heterogeneous case. We derive new expressions for computing the cost of 2-p-opt and 1-shift local search moves, and we show that the neighborhood of a solution may be explored in O(n2) time, the same as for the homogeneous case, instead of O(n3) as first reported in the literature. |
| |
Keywords: | Combinatorial optimization Probabilistic traveling salesman Heuristics Local search Stochastic vehicle routing |
本文献已被 ScienceDirect 等数据库收录! |
|