An efficient technique to solve TSP and its extension to spatially spread vertices

Ravikumar, C. N. and Chidananda Gowda, K. and Nagabhushan, P. (1998) An efficient technique to solve TSP and its extension to spatially spread vertices. Current Science, 75 (10). pp. 1046-1052.

Text An efficient technique to solve TSP and its extension to spatially spread vertices.pdf Restricted to Registered users only Download (1MB) | Request a copy

Abstract

Many research references are available to solve the conventional Travelling Salesman Problem (TSP). A recent heuristic approach, GENI, by Michel Gendreau et al.(1) is said to provide path efficient solutions. Our present paper proposes a novel strategy called FANI (Farthest neighbour nearest insertion) which tackles the twin issues of the algorithm performance namely, path efficiency and time efficiency. It is demonstrated through extensive experimentation that our method is better than GENI(1). To solve a conventional TSP, this paper proposes a two-phase approach. In the first phase, farthest neighbour concept is adopted, and an initial tour spanning through three farthest neighbours is constructed. In the subsequent phase, the remaining vertices are inserted, one at a time, considering the nearest neighbour concept. Further, it is proposed to extend this strategy to solve a more pragmatic TSP, a problem in which the vertices are not dimensionless us often dealt in literature, but they have spatial spread, as found in several situations. The vertices may have lengthwise and/or breadthwise stretches (spread), Such points can be identified as spatially spread vertices (SSV) since such SSVs provide entry-exit options. Solving such TSPs becomes more complicated, and it is this issue which is taken up in this paper, and to the best of our knowledge such a problem has not been dealt in the TSP literature.

Item Type:	Article
Subjects:	D Physical Science > Computer Science
Divisions:	Department of > Computer Science
Depositing User:	Users 23 not found.
Date Deposited:	10 Jun 2021 04:27
Last Modified:	24 Jun 2022 10:46
URI:	http://eprints.uni-mysore.ac.in/id/eprint/16688

Actions (login required)

View Item