Abstract
A shortcut search between different objects is one of the classic optimization goals. Simulated Annealing algorithms are often used for optimization purposes. The Simulated Annealing method is applied in combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. The application of Simulated Annealing method and Travelling Salesman Problem is demonstrated in this paper and an experiment aimed to find the shortest route between Belarusian processing enterprises is performed. The paper also provides mapping of these objects using GPS location. The main goal of the paper is to show the possibilities of applying mathematical models in solving practical tasks - to determine the shortest route between the different objects.
Sign-in/Register to access full text options 
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.
