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. Key words: traveling salesman problem, simulated annealing method, algorithm, fuzzy numbers, level set, formalization of time intervals.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
