Extended Algorithm for Travelling Salesman Problem with Conditions in Nodes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26110%2F17%3APU123737" target="_blank" >RIV/00216305:26110/17:PU123737 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-981-10-4190-7_16" target="_blank" >https://link.springer.com/chapter/10.1007/978-981-10-4190-7_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-981-10-4190-7_16" target="_blank" >10.1007/978-981-10-4190-7_16</a>
Alternative languages
Result language
angličtina
Original language name
Extended Algorithm for Travelling Salesman Problem with Conditions in Nodes
Original language description
The paper describes a new algorithm for finding the shortest path in the graph among all nodes. The algorithm is based on the sequential removing of nodes from the graph. After removing a node, it is necessary to generate new edges that represent all paths through the node. This procedure maintains the configuration of the graph. The newly created edges are referred to as composed edges. The newly generated edges can be connected together only with simple (original) edges, because this could lead to overlaping the edges of the original graph and thus may occur incorrect paths in the graph. During the algorithm proceeds the continuous optimization of the edges so that it removes loops around the nodes. This leads to a significant reduction of the number of combinations of edges, and it simplifies the process. The algorithm was tested though procedure in Python and its complexity is polynomial time. The job is known as a problem of a Salesman or a Hamiltonian path or Hamiltonian circle in the graph. Results of proposed method can be used in logistics (distribution of goods among locations), in transport planning (selection of the optimal route between given points) in crisis management (optimal route for intervention in case of fire or accidents) in tourism and related services (planning the shortest route trip) or spatial analyses in geographic information systems (GIS).
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Social Interactions and Networking in Cyber Society
ISBN
978-9-8110-4189-1
Number of pages of the result
9
Pages from-to
199-207
Number of pages of the book
247
Publisher name
Springer Nature Singapore Pte Ltd.
Place of publication
Singapore
UT code for WoS chapter
—