Cyber-physical system for solving travelling salesman problem

Simple item page
dc.citation.epage28
dc.citation.issue1
dc.citation.spage22
dc.citation.volume2
dc.contributor.affiliationLviv Polytechnic National University
dc.contributor.authorMuliarevych, Oleksandr
dc.coverage.placenameLviv
dc.date.accessioned2018-06-18T14:00:28Z
dc.date.available2018-06-18T14:00:28Z
dc.date.created2017-02-01
dc.date.issued2017-02-01
dc.description.abstractIn this paper new approaches for solving dynamic Travelling Salesman Problem (TSP) in conditions of partly unknown input data are given.
dc.format.extent22-28
dc.format.pages7
dc.identifier.citationMuliarevych O. Cyber-physical system for solving travelling salesman problem / Oleksandr Muliarevych // Advances in Cyber-Physical Systems. — Lviv : Lviv Politechnic Publishing House, 2017. — Vol 2. — No 1. — P. 22–28.
dc.identifier.citationenMuliarevych O. Cyber-physical system for solving travelling salesman problem / Oleksandr Muliarevych // Advances in Cyber-Physical Systems. — Lviv : Lviv Politechnic Publishing House, 2017. — Vol 2. — No 1. — P. 22–28.
dc.identifier.issn2524-0382
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/42034
dc.language.isoen
dc.publisherLviv Politechnic Publishing House
dc.relation.ispartofAdvances in Cyber-Physical Systems, 1 (2), 2017
dc.relation.references[1] Cormen, T., Leiserson, C., Rivest, R., Stein, C. Introduction to Algorithms, third edition. MIT Press, 2009, p. 1292.
dc.relation.references[2] Bonabeau, E., Dorigo, M., Theraulaz, G.. Swarm intelligence: From Natural to Artificial Systems. Oxford University Press., 1999,p. 307.
dc.relation.references[3] Muliarevych O., Golembo V. New approaches for solving travelling salesman problems using agents swarm intelligence behavior model, // European Cooperation: Scientific Approaches and Applied Technologies. – CLM Consulting Publ., Warsaw 2015, Vol 5(5), pp. 131–143.
dc.relation.references[4] Lentin Joseph, Mastering ROS for Robotics Programming. Packt Publishing Ltd, UK, Dec 21, 2015, p. 480.
dc.relation.references[5] Golembo, V., Muliarevych, O.. Modification of ant colony method for TSP solving by collective of autonomous agents. Computer systems and networks, Lviv Polytechnic National University Press, no. 717, 2011, pp. 24–30.
dc.relation.references[6] E. N. Barron, Game Theory: An Introduction. John Wiley & Sons Publ., Canada, Apr 22, 2013, p. 555.
dc.relation.references[7] Helsgaun, K., General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, Springer Verlag Publ., 2009, pp. 119–163.
dc.relation.references[8] Heidelberg University (from 1995). Discrete and Combinatorial Optimization. Retrieved from http://comopt.ifi.uniheidelberg.de/software/TSPLIB95/
dc.relation.referencesen[1] Cormen, T., Leiserson, C., Rivest, R., Stein, C. Introduction to Algorithms, third edition. MIT Press, 2009, p. 1292.
dc.relation.referencesen[2] Bonabeau, E., Dorigo, M., Theraulaz, G.. Swarm intelligence: From Natural to Artificial Systems. Oxford University Press., 1999,p. 307.
dc.relation.referencesen[3] Muliarevych O., Golembo V. New approaches for solving travelling salesman problems using agents swarm intelligence behavior model,, European Cooperation: Scientific Approaches and Applied Technologies, CLM Consulting Publ., Warsaw 2015, Vol 5(5), pp. 131–143.
dc.relation.referencesen[4] Lentin Joseph, Mastering ROS for Robotics Programming. Packt Publishing Ltd, UK, Dec 21, 2015, p. 480.
dc.relation.referencesen[5] Golembo, V., Muliarevych, O.. Modification of ant colony method for TSP solving by collective of autonomous agents. Computer systems and networks, Lviv Polytechnic National University Press, no. 717, 2011, pp. 24–30.
dc.relation.referencesen[6] E. N. Barron, Game Theory: An Introduction. John Wiley & Sons Publ., Canada, Apr 22, 2013, p. 555.
dc.relation.referencesen[7] Helsgaun, K., General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, Springer Verlag Publ., 2009, pp. 119–163.
dc.relation.referencesen[8] Heidelberg University (from 1995). Discrete and Combinatorial Optimization. Retrieved from http://comopt.ifi.uniheidelberg.de/software/TSPLIB95/
dc.relation.urihttp://comopt.ifi.uniheidelberg.de/software/TSPLIB95/
dc.rights.holder© Національний університет „Львівська політехніка“, 2017
dc.rights.holder© Muliarevych O., 2017
dc.subjectagents
dc.subjectTSP
dc.subjectant colony algorithm
dc.subjectswarm behavior
dc.subjectdistributed TSP
dc.subjectnetwork routing
dc.subjectcyber-physical systems
dc.subjectrobotics
dc.titleCyber-physical system for solving travelling salesman problem
dc.typeArticle

Files

Original bundle

Now showing 1 - 2 of 2
Thumbnail Image
Name:
2017v2n1_Muliarevych_O-Cyber_physical_system_22-28.pdf
Size:
3.56 MB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
2017v2n1_Muliarevych_O-Cyber_physical_system_22-28__COVER.png
Size:
532.15 KB
Format:
Portable Network Graphics
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.95 KB
Format:
Plain Text
Description:
Download

Collections

Advances In Cyber-Physical Systems. – 2017. – Vol. 2, No. 1