| DC Field | Value | Language |
|---|
| dc.contributor.author | Mulyarevich, Oleksandr | |
| dc.contributor.author | Turchynskyi, Stanislav | |
| dc.coverage.temporal | 23–25 November 2018, Lviv | |
| dc.date.accessioned | 2020-06-09T07:06:35Z | - |
| dc.date.available | 2020-06-09T07:06:35Z | - |
| dc.date.created | 2018-11-22 | |
| dc.date.issued | 2018-11-22 | |
| dc.identifier.citation | 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”). | |
| dc.identifier.isbn | 978-966-941-294-2 | |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/51706 | - |
| dc.description.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. | |
| dc.format.extent | 66-69 | |
| dc.language.iso | en | |
| dc.publisher | Видавництво Львівської політехніки | |
| dc.publisher | Lviv Politechnic Publishing House | |
| dc.relation.ispartof | Litteris et Artibus : proceedings, 2018 | |
| dc.subject | travelling salesman problem | |
| dc.subject | genetic algorithm | |
| dc.subject | evolutionary computation | |
| dc.subject | REST technologies | |
| dc.title | Solving the dynamic travelling salesman problem with the use of evolutionary computation | |
| dc.type | Conference Abstract | |
| dc.rights.holder | © Національний університет “Львівська політехніка”, 2018 | |
| dc.contributor.affiliation | Lviv Polytechnic National Universit | |
| dc.format.pages | 4 | |
| dc.identifier.citationen | 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”). | |
| 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.conference | 8th International youth science forum «Litteris et Artibus» | |
| dc.citation.journalTitle | Litteris et Artibus : proceedings | |
| dc.citation.spage | 66 | |
| dc.citation.epage | 69 | |
| dc.coverage.placename | Львів | |
| dc.coverage.placename | Lviv | |
| Appears in Collections: | Litteris et Artibus. – 2018 р.
|
