Document Type



The travelling salesman problem is to find a shortest path from the travelling salesman’s hometown, make the round of all the towns in the set, and finally go back home. This paper investigates the travelling salesman problem with fuzzy random travelling time. Three concepts are proposed: expected shortest path, (α, β)-path and chance shortest path according to different optimal desire. Correspondingly, by using the concepts as decision criteria, three fuzzy random programming models for TSP are presented. Finally, a hybrid intelligent algorithm is designed to solve these models, and some numerical examples are provided to illustrate its effectiveness.