Please use this identifier to cite or link to this item: http://ena.lp.edu.ua:8080/handle/ntb/51706
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMulyarevich, Oleksandr
dc.contributor.authorTurchynskyi, Stanislav
dc.coverage.temporal23–25 November 2018, Lviv
dc.date.accessioned2020-06-09T07:06:35Z-
dc.date.available2020-06-09T07:06:35Z-
dc.date.created2018-11-22
dc.date.issued2018-11-22
dc.identifier.citationMulyarevich 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”).
dc.identifier.isbn978-966-941-294-2
dc.identifier.urihttp://ena.lp.edu.ua:8080/handle/ntb/51706-
dc.description.abstractThe 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.
dc.format.extent66-69
dc.language.isoen
dc.publisherВидавництво Львівської політехніки
dc.publisherLviv Politechnic Publishing House
dc.relation.ispartofLitteris et Artibus : proceedings, 2018
dc.subjecttravelling salesman problem
dc.subjectgenetic algorithm
dc.subjectevolutionary computation
dc.subjectREST technologies
dc.titleSolving the dynamic travelling salesman problem with the use of evolutionary computation
dc.typeConference Abstract
dc.rights.holder© Національний університет “Львівська політехніка”, 2018
dc.contributor.affiliationLviv Polytechnic National Universit
dc.format.pages4
dc.identifier.citationenMulyarevich 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”).
dc.relation.references[1] N. L. Biggs, “ Graph Theory” / E. K. LLoyd, and R. J. Wilson, Oxford, 1976.
dc.relation.references[2] F.Herrera, “ Hybrid Crossover Operators for Real-Coded Genetic Algorithms: An Experimental Study” / M.Losano, A.M.Sanches, Berlin, 2004.
dc.relation.references[3] Federico Greco, “ Travelling Salesman Problem” Croatia, 2008.
dc.relation.references[4] Holland J.H., “ Adaptation in Natural and Artificial Systems” The University of Michigan Press, 1975.
dc.relation.referencesen[1] N. L. Biggs, " Graph Theory", E. K. LLoyd, and R. J. Wilson, Oxford, 1976.
dc.relation.referencesen[2] F.Herrera, " Hybrid Crossover Operators for Real-Coded Genetic Algorithms: An Experimental Study", M.Losano, A.M.Sanches, Berlin, 2004.
dc.relation.referencesen[3] Federico Greco, " Travelling Salesman Problem" Croatia, 2008.
dc.relation.referencesen[4] Holland J.H., " Adaptation in Natural and Artificial Systems" The University of Michigan Press, 1975.
dc.citation.conference8th International youth science forum «Litteris et Artibus»
dc.citation.journalTitleLitteris et Artibus : proceedings
dc.citation.spage66
dc.citation.epage69
dc.coverage.placenameЛьвів
dc.coverage.placenameLviv
Appears in Collections:Litteris et Artibus. – 2018 р.



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