Novel Heuristic for Intuitionistic Triangular Fuzzy Travelling Salesman Problem

Souhail Dhouib
Additional contact information
Souhail Dhouib: University of Sfax, Tunisia

International Journal of Applied Evolutionary Computation (IJAEC), 2021, vol. 12, issue 4, 39-55

Abstract: The travelling salesman problem (TSP) is a well-known combinatorial problem frequently used in real-world industries to find the minimum cost cycle between all cities. In this paper, the authors consider the distance matrix between all cities in a vagueness environment, where each element in the distance matrix is presented as an intuitionistic triangular fuzzy set. To solve this problem, the novel heuristic Dhouib-Matrix-TSP1 (DM-TSP1) is enhanced with the centroid ranking function for defuzzification and the range statistical metric for cities selection. In fact, this paper presents the first adaptation of DM-TSP1 to solve TSP under intuitionistic environment. DM-TSP1 can easily generate a good initial basic feasible solution just after just n iterations (where n represents the number of cities). The performance of DM-TSP1 is demonstrated by suitable numerical examples.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAEC.2021100104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jaec00:v:12:y:2021:i:4:p:39-55

Access Statistics for this article

International Journal of Applied Evolutionary Computation (IJAEC) is currently edited by Sukhpal Singh Gill

More articles in International Journal of Applied Evolutionary Computation (IJAEC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().