Affiliation:
1. Air Force Engineering University
Abstract
Travelling salesman problem is a fundamental combinatorial optimization model studied in the operations research community, and yet, there is surprisingly little literature that addresses stochastic uncertainties and multiple objectives in it simultaneously. This paper is devoted to a novel TSP variation called stochastic multiobjective TSP (SMOTSP) with random variables on the arc, and a new solution approach is proposed to obtain Pareto efficient route in it, whose validity is proved finally.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. David L Applegate, Robert E Bixby, Vasek Chvatal, and William J Cook. The traveling salesman problem: a computational study. Princeton University Press, (2011).
2. David Applegate, Robert Bixby, Vašek Chvátal, and William Cook. Finding cuts in the tsp (a preliminary report). Certer for Discrete Mathematics & Theoretical Computer Science, (1995).
3. Adrian Dumitrescu. The traveling salesman problem for lines and rays in the plane. Discrete Mathematics, Algorithms and Applications, 4(04), (2012).
4. Sing Liew. Introducing convex layers to the traveling salesman problem. arXiv preprint arXiv: 1204. 2348, (2012).
5. P. Jaillet. Probabilistic Traveling Salesman Problems. PhD thesis, Massachusetts Institute of Technology, (1985).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献