SHORTEST PATH DETERMINATION BETWEEN EDUCATIONAL INSTITUTIONS OF RĒZEKNE MUNICIPALITY

Authors :: Jurijs Musatovs
Pēteris Grabusts
Source :: SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference; Vol 3 (2017): SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference May 26th-27th, 2017, Volume III; 451-462
Publication Year :: 2017
Publisher :: Rezekne Academy of Technologies, 2017.
Abstract: This study describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used in various 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. In this study the application of the Simulated Annealing method to a well - known task of combinatorial analysis, Travelling Salesman Problem, is demonstrated and an experiment aimed to find the shortest tour distances between educational institutions of Rēzekne Municipality is performed. It gives possibilities to analyze and search optimal schools' network in Rēzekne Municipality.

Subjects :: Transport engineering
Geography
Operations research
Shortest path problem
Educational institutions
Optimization
Rēzekne Municipality
Simulated Annealing'
Travelling Salesman Problem

Language :: English
ISSN :: 16915887 and 22560629
Database :: OpenAIRE
Journal :: SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference
Accession number :: edsair.doi.dedup.....eaac4a2b374b740b89e6e49712764796

Tools