IEEE - Institute of Electrical and Electronics Engineers, Inc. - A branch and bound algorithm for the porbabilistic traveling salesman problem

2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

Author(s): Soumaya Sassi Mahfoudh ; Walid Khaznaji ; Monia Bellalouna
Sponsor(s): IEEE Comput.Soc.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 June 2015
Conference Location: Takamatsu, Japan
Conference Date: 1 June 2015
Page(s): 1 - 6
ISBN (Electronic): 978-1-4799-8676-7
DOI: 10.1109/SNPD.2015.7176284
Regular:

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... View More

Advertisement