Application of a genetic algorithm to solve the traveler's problem
Abstract
The article describes an application developed by the author in Visual Basic, which implements one of the methods of artificial intelligence – a genetic algorithm for solving the traveling salesman problem (TSP problem) and provides an example of solving a specific problem.
About the Author
Andrej Dmitrievich Alpidovskij
Volga State University of Water Transport
Russian Federation
Russian Federation
Candidate of Engineering Sciences, Associate Professor of the Department of Transport Management
References
1. Al'pidovskii, AD Intellektual'nye sistemy: uchebnoe posobie: [po napravleniyu podgotovki 23.04.01 «Tekhnologiya transportnykh protsessoV»] / A. D. Al'pidovskii – N. Novgorod: VGUVT, 2023. – 80 p. (In Russ.);
2. Gvozdeva VV, Volodin AB. Intellektual'nye tekhnologii i sistemy na vodnom transporte: uchebnoe posobie / Moskva: Al'tair : MGAVT, 2016. – 294 p. (In Russ.);
3. Zhankaziev SV. Intellektual'nye transportnye sistemy: ucheb. posobie / S.V. Zhankaziev. – M.: MADI, 2016. – 120 p. (In Russ.);
4. Spiridonov EH. S., Polyanskii A. V. Intellektual'nye tekhnologii v reshenii zadach transportnogo stroitel'stva: Uchebnoe posobie. – M.: MIIT, 2011 . – 110 p. (In Russ.)
Review
For citations:
Alpidovskij A.D. Application of a genetic algorithm to solve the traveler's problem. Kaspijskij nauchnyj zhurnal. 2024;4(3):53-58. (In Russ.)
Views:
92
Email this article 