%0 Journal Article
%T A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT:
TWO HEURISTIC APPROACHES
%J Iranian Journal of Fuzzy Systems
%I University of Sistan and Baluchestan
%Z 1735-0654
%A Changdar, Chiranjit
%A Maiti, Manas Kumar
%A Maiti, Manoranjan
%D 2013
%\ 02/04/2013
%V 10
%N 1
%P 1-28
%! A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT:
TWO HEURISTIC APPROACHES
%K Solid travelling salesman problem
%K Fuzzy possibility
%K Ant colony optimization
%K Genetic Algorithm
%R 10.22111/ijfs.2013.153
%X A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the environment least. An ant colony optimization (ACO) algorithm is developed to solve the problem. Performance of the algorithm for the problem is compared with another soft computing algorithm, Genetic Algorithm(GA). Problems are solved with crisp as well as fuzzy costs. For fuzzy cost and environmental eect factors, cost function as well as environment constraints become fuzzy. As optimization of a fuzzy objective function is not well de ned, fuzzy possibility approach is used to get optimal decision. To test the eciency of the algorithm, the problem is solved considering only one conveyance facility ignoring the environmental eect constraint, i.e., a classical two dimensional TSP (taking standard data sets from TSPLIB for solving the problem). Dierent numerical examples are used for illustration.
%U https://ijfs.usb.ac.ir/article_153_100415578c754927aaf8d608b87dfdd1.pdf