| DC Field | Value | Language |
|---|
| dc.contributor.author | Bazylevych, R. | - |
| dc.contributor.author | Dupas, R. | - |
| dc.contributor.author | Kutelmakh, R. | - |
| dc.date.accessioned | 2014-11-10T14:46:33Z | - |
| dc.date.available | 2014-11-10T14:46:33Z | - |
| dc.date.issued | 2006 | - |
| dc.identifier.citation | Bazylevych R. Scanning-area algorithms for clustered TSP / R. Bazylevych, R.Dupas, R. Kutelmakh // Computer science and information technologies: Proceedings of the International Conference (September 28th-30th, Lviv, Ukraine) / Lviv Polytechnic National University, Institute of Computer Science and Information Technologies. – Lviv, 2006. – P. 148–152.– Bibliography: 3 titles. | uk_UA |
| dc.identifier.other | UDC 51.001.57 | - |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/25058 | - |
| dc.description.abstract | One of the base problems of combinatorial optimization, that has wide applications, is the Traveling Salesman Problem (TSP). Rapid growth of its size (thousands of points) is the main feature now, and many extensions of this problem with specific properties are studied: dynamic vehicle routing problems; systems with call (the first-aid, the courier's, the taxi), systems with time windows, and systems of delivery. They need development of the special algorithms, which provide high-quality solutions in reasonable time. That is why subsequent perfection of existing algorithms and development of new ones is relevant. In this paper, a set of strategies were proposed and evaluated, in order to solve specific TSP problems in which the points are under the form of clusters. | uk_UA |
| dc.language.iso | en | uk_UA |
| dc.publisher | Українські технології | uk_UA |
| dc.title | Scanning-area algorithms for clustered TSP | uk_UA |
| dc.type | Article | uk_UA |
| Appears in Collections: | Computer science and information technologies = Комп'ютерні науки та інформаційні технології (CSIT’2006) – 2006 р.
|
