论文信息 - A branch and bound algorithm for the porbabilistic traveling salesman problem

A branch and bound algorithm for the porbabilistic traveling salesman problem

The Probabilistic Traveling Salesman Problem (PTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), the main difference is the cities are present with a probability. PTSP is NP-Hard, researches are rather directed towards heuristics for having acceptable solutions. In this paper, we propose an branch and bound algorithm for exact resolution for the PTSP .Estimating the evaluation represents the originality of our paper.

Monia Bellalouna | Walid Khaznaji | Soumaya Sassi Mahfoudh

[1] David Simchi-Levi,et al. Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers , 1988, Transp. Sci..

[2] S. Rosenow. Comparison of an Exact Branch-and-Bound and an Approximative Evolutionary Algorithm for the Probabilistic Traveling Salesman Problem , 1999 .

[3] Michel Minoux,et al. Graphes et algorithmes , 1995 .

[4] Vangelis Th. Paschos,et al. Probabilistic combinatorial optimization problems on graphs: A new domain in operational research , 1995 .

[5] Patrick Jaillet,et al. Probabilistic Traveling Salesman Problems , 1985 .

[6] Monia Bellalouna,et al. Problèmes d'optimisation combinatoires probabilistes , 1993 .

[7] Gilbert Laporte,et al. A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[8] Patrick Jaillet,et al. A Priori Optimization , 1990, Oper. Res..

[9] D. Bertsimas,et al. Further results on the probabilistic traveling salesman problem , 1993 .