Multiobjective Travelling Salesman Problem under Stochastic Environment

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.

Hybrid evolutionary algorithms for the Multiobjective Traveling Salesman Problem

“…The multiobjective TSP under stochastic environment was proposed by He et al (2014). Changdar et al (2014) proposed a multiobjective genetic algorithm in order to solve a multiobjective solid TSP considering that the first objective is the cost and the second is the time.…”