Retrieved from Iss. 112, 2022
Pages 241 -247
Received 25.06.2022
Revised 08.11.2022
Accepted 15.12.2022
Retrieved from Iss. 112, 2022
Pages 241 -247
Abstract
This article discusses the annealing simulation method for solving the fuzzy traveling salesman problem, which is formulated as the problem of finding a route to visit a given number of cities without repetitions with a minimum travel time. The content of the annealing simulation method is presented, the method formalization algorithm is described. The axiomatics of fuzzy triangular numbers are given. A fuzzy traveling salesman problem is formulated, in which the time parameters of movement between cities are given in the form of right fuzzy numbers, the carrier value in which depends on various external conditions and factors. The results of calculations for solving the traveling salesman problem in clear and fuzzy forms with different parameters of slices of fuzzy numbers are presented
Keywords:
traveling salesman problem, simulated annealing method, algorithm, fuzzy numbers, level set, formalization of time intervals