Link lub cytat. http://ena.lp.edu.ua:8080/handle/ntb/51706
Tytuł: Solving the dynamic travelling salesman problem with the use of evolutionary computation
Authors: Mulyarevich, Oleksandr
Turchynskyi, Stanislav
Akcesoria: Lviv Polytechnic National Universit
Cytat: 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: 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”).
Część publikacji: Litteris et Artibus : proceedings, 2018
Konferencja/wydarzenie: 8th International youth science forum «Litteris et Artibus»
Journal/kolekcja: Litteris et Artibus : proceedings
Data wydania: 22-lis-2018
Wydawca: Видавництво Львівської політехніки
Lviv Politechnic Publishing House
Place edycja: Львів
Lviv
Zakresu czasowego: 23–25 November 2018, Lviv
Słowa kluczowe: travelling salesman problem
genetic algorithm
evolutionary computation
REST technologies
Strony: 4
Zakres stron: 66-69
Główna strona: 66
Strona końcowa: 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: http://ena.lp.edu.ua:8080/handle/ntb/51706
ISBN: 978-966-941-294-2
Właściciel praw autorskich: © Національний університет “Львівська політехніка”, 2018
Wykaz piśmiennictwa: [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: [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.
Typ zawartości: Conference Abstract
Występuje w kolekcjach:Litteris et Artibus. – 2018 р.



Pozycje DSpace są chronione prawami autorskimi