Publication detail

Extended Algorithm for Travelling Salesman Problem with Conditions in Nodes

BARTONĚK, D.

Original Title

Extended Algorithm for Travelling Salesman Problem with Conditions in Nodes

Type

book chapter

Language

English

Original Abstract

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).

Keywords

Hamiltonian path – Travelling salesman problem – Combinatorical algorithm

Authors

BARTONĚK, D.

Released

30. 5. 2017

Publisher

Springer Nature Singapore Pte Ltd.

Location

Singapore

ISBN

978-9-8110-4189-1

Book

Social Interactions and Networking in Cyber Society

Edition

Social Sciences

Edition number

1

Pages from

199

Pages to

207

Pages count

9

URL

https://link.springer.com/chapter/10.1007/978-981-10-4190-7_16

BibTex

@inbook{BUT136332,
  author="Dalibor {Bartoněk}",
  title="Extended Algorithm for Travelling Salesman Problem with Conditions in Nodes",
  booktitle="Social Interactions and Networking in Cyber Society",
  year="2017",
  publisher="Springer Nature Singapore Pte Ltd.",
  address="Singapore",
  series="Social Sciences",
  edition="1",
  pages="199--207",
  doi="10.1007/978-981-10-4190-7\{_}16",
  isbn="978-9-8110-4189-1",
  url="https://link.springer.com/chapter/10.1007/978-981-10-4190-7_16"
}