Skip navigation

putin IS MURDERER

Please use this identifier to cite or link to this item: https://oldena.lpnu.ua/handle/ntb/51706
Title: Solving the dynamic travelling salesman problem with the use of evolutionary computation
Authors: Mulyarevich, Oleksandr
Turchynskyi, Stanislav
Affiliation: Lviv Polytechnic National Universit
Bibliographic description (Ukraine): Mulyarevich O. Solving the dynamic travelling salesman problem with the use of evolutionary computation / Oleksandr Mulyarevich, Stanislav Turchynskyi // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 66–69. — (10th International academic conference “Computer science & engineering 2018”).
Bibliographic description (International): Mulyarevich O. Solving the dynamic travelling salesman problem with the use of evolutionary computation / Oleksandr Mulyarevich, Stanislav Turchynskyi // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 66–69. — (10th International academic conference “Computer science & engineering 2018”).
Is part of: Litteris et Artibus : proceedings, 2018
Conference/Event: 8th International youth science forum «Litteris et Artibus»
Journal/Collection: Litteris et Artibus : proceedings
Issue Date: 22-Nov-2018
Publisher: Видавництво Львівської політехніки
Lviv Politechnic Publishing House
Place of the edition/event: Львів
Lviv
Temporal Coverage: 23–25 November 2018, Lviv
Keywords: travelling salesman problem
genetic algorithm
evolutionary computation
REST technologies
Number of pages: 4
Page range: 66-69
Start page: 66
End page: 69
Abstract: The subject of travelling salesman problem is always a hot topic. Analyzed ways to solve travelling salesman problem for a acceptable time. It was implemented system with the base on general algorithm of evolutionary computing.
URI: https://ena.lpnu.ua/handle/ntb/51706
ISBN: 978-966-941-294-2
Copyright owner: © Національний університет “Львівська політехніка”, 2018
References (Ukraine): [1] N. L. Biggs, “ Graph Theory” / E. K. LLoyd, and R. J. Wilson, Oxford, 1976.
[2] F.Herrera, “ Hybrid Crossover Operators for Real-Coded Genetic Algorithms: An Experimental Study” / M.Losano, A.M.Sanches, Berlin, 2004.
[3] Federico Greco, “ Travelling Salesman Problem” Croatia, 2008.
[4] Holland J.H., “ Adaptation in Natural and Artificial Systems” The University of Michigan Press, 1975.
References (International): [1] N. L. Biggs, " Graph Theory", E. K. LLoyd, and R. J. Wilson, Oxford, 1976.
[2] F.Herrera, " Hybrid Crossover Operators for Real-Coded Genetic Algorithms: An Experimental Study", M.Losano, A.M.Sanches, Berlin, 2004.
[3] Federico Greco, " Travelling Salesman Problem" Croatia, 2008.
[4] Holland J.H., " Adaptation in Natural and Artificial Systems" The University of Michigan Press, 1975.
Content type: Conference Abstract
Appears in Collections:Litteris et Artibus. – 2018 р.

Files in This Item:
File Description SizeFormat 
2018_Mulyarevich_O-Solving_the_dynamic_travelling_66-69.pdf87.45 kBAdobe PDFView/Open
2018_Mulyarevich_O-Solving_the_dynamic_travelling_66-69__COVER.png434.59 kBimage/pngView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.