Uncertain multiobjective traveling salesman problem

• DOI: 10.1016/j.ejor.2014.09.012
• Publication Date: 2014-09-28T18:32:32Z
• Authors: Zutong Wang; Jiansheng Guo; Mingfa Zheng; Ying Wang
• Keywords: Benchmark (surveying); Operator (biology)

Traveling salesman problem is a fundamental combinatorial optimization model studied in the operations research community for nearly half century, yet there surprisingly little literature that addresses uncertainty and multiple objectives it. A novel TSP variation, called uncertain multiobjective (UMTSP) with variables on arc, proposed this paper basis of theory, new solution approach named applied to obtain Pareto efficient route UMTSP. Considering nature UMTSP, ABC algorithm inserted reverse operator, crossover operator mutation designed problem, which outperforms other algorithms through performance comparison three benchmark TSPs. Finally, UMTSP case study presented illustrate construction shows optimal deterministic can be poor