Comparison between nearest neighbor and arbitrary insertion for solving the travelling salesman problem [Elektronski vir]
Balantič, Karmen ...
In the paper, the Travelling Salesman Problem (TSP) is being discussed. TSP is a problem, where the salesman visits all the cities exactly once and then returns to the starting point, while the ...shortest path is being travelled. The problem is NP-hard, since the difficulty of solving procedure arises with the increase of the number of cities being visited. For TSP solving, there are many heuristic algorithms, which return relatively good solutions but not necessarily optimal. In the paper two algorithms, Nearest Neighbor (NN) and Arbitrary Insertion (AI) are tested taking into account a security company case. We consider the Euclidian distances between the nodes and the actual street network distances. Case study shows that both algorithms returns the same sequence if we consider Euclidian distances, while using actual distances the better result corresponds to the use of AI algorithm.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
