The travelling salesman problem is one of the famous combinatorial optimization problem and has been intensively
studied in the last decades. We present a new extension of the basics problem, where travel times are specified as a range of
possible values.