2022 Third International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)

NATIONAL TRAVELLING SALESMAN

PROBLEM FOR INDIAN CITIES: A CASE
2022 Third International Conference on Intelligent Computing Instrumentation and Control Technologies (ICICICT) | 978-1-6654-1005-2/22/$31.00 ©2022 IEEE | DOI: 10.1109/ICICICT54557.2022.9917908

STUDY
Amit Ramesh Khaparde Sofia K Pillai Aradhna Saini
Assistant Professor Assistant Professor Assistant Professor
Delhi Skill and Entrepreneurship Department of Artificial Intelligence Department of Data Science
University Noida Institute of Engineering and Noida Institute of Engineering &
Okhla Campus 1, New Technology Technology,
Delhi,110020,India Greater Noida Greater Noida, India
amitkhaparde@gbpec.edu.in pillaisofia@gmail.com aradhnasaini13@gmail.com

Urvashi Agrawal Gaurav Dhuriya

Assistant Professor B. Balamurugan Assistant Professor
Department of Electronics and Associate Dean-Student Engagement Department of Computer Science
Telecommunication Engineering Department of Computer Science Noida Institute of Engineering &
Jhulelal Institute of Technology Shiv Nadar University Technology,
Nagpur, India Greater Noida, India Greater Noida, India
urvashi.agrawal2000@gmail.com kadavulai@gmail.com gauravdhuriya10047@gmail.com
Abstract— National traveling salesman problem (NTSP) is the Indian cities traveling salesman problem is the computation
subset of the World traveling salesman problem. NTSP has of optimal path to travel the Indian cities at most once
solved for twenty-six countries not of the country India. In the without revisiting the visited city and back to origin. The
national traveling salesman problem, the user has to travel all application of this problem in all logistic and other
the cities without revisiting the visited city of the given country. commercial sectors involves visiting the cities with optimal
In this paper, the NTSP is solved for the Indian cities using the paths. The national traveling salesman problem has been
genetic algorithm, artificial neural network self-organizing solved for the twenty-six county [5].
map (SOM), and Simulated Annealing (SA). The early results Evolutionary algorithms are the best choice to solve any
show that the self-organizing map is an efficient method than optimization problem. All the evolutionary algorithms are
the genetic algorithm and simulated annealing. But if the input the cycle of generation, evolution, and selection in their type.
is noisy then the genetic algorithm and simulated annealing To date, hybridized LKH algorithm [3] is successfully solved
perform better than the self-organizing map.
the high dimension TSP problem.
The Genetic algorithm is the cycle of four stages; generation,
crossover, mutation, and selection. These operators can be
Keywords— Travelling Salesman problem, Self-organizing tuned to solve any type of problem. The hybridized GA
Map, Genetic Algorithm, Simulated Annealing. called GAKH is solved the software clustering problem.
Software clustering is the NP-Hard problem. The
performance of GA to solve TSP using different selection
I. INTRODUCTION methods has shown that tournament selection is the best
method to solve the TSP [7]. The GA is used to solve other
The Travelling salesman problem (TSP) is an NP-hard problems.
The Simulated Annealing (SA) is the meta-heuristic
optimization problem. It becomes complex as the number of
technique to approximate the global optima of the
objects increases. The solution to the traveling Salesman
optimization problem. SA is the probabilistic technique. SA
Problem is computing the shortest sub-optimal path from a
set of cities by vising each city without revisiting and emulates the physical process of minimal energy
returning to its origin. TSP is belonging to the NP-complete configuration of cooling of solid material [8]. A logistic case
study [9] formulated into the TSP is solved using Simulated
class of problems.
Annealing and the results are satisfactory.
There is the total of 1,904,711 world’s populated locations
A Self-organizing Map (SOM) [10] artificial neural
are computed using a geographical feature from the National
imagery and mapping agency database. The location of these network type dimensionality reduction method. SOM is
cities in form of attitude and longitude is furnished [1]. At trained to produce a low-dimensional (typically 2D),
present, the best-reported tour for world TSP is discretized representation of the input space of the training
7,515,772,107 [2-3]. World TSP [4] is a large-scale samples called a map. It is used to solve the TSP [11].
optimization problem.
There are 25 instances from world TSP that are solved. The
TSP cost is computed in Euclidian distance up to the nearest II. EXTRICATION OF NTSP
whole number. The TSP cities are ranges from 29 to 71000.
The detail of the cities is available in [5]. The traveling salesman problem is belonging to the NP-
complete problem. The exact methods known to solve the

978-1-6654-1005-2/22/$31.00 ©2022 IEEE 717

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY KANPUR. Downloaded on October 29,2022 at 05:14:01 UTC from IEEE Xplore. Restrictions apply.
 2022 Third International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)

TSP increases the computational complexity exponentially as
the number of cities increases in the TSP. Hence, practically
they can only use for a few hundred cities in TSP. Hence,
soft computing techniques are used to solve TSP for a large
set of cities.
A. NTSP using SOM
The traveling salesman problem is belonging to the
NP-complete problem. The exact methods known to solve
the TSP increases the computational complexity
exponentially as the number of cities increases in the TSP.
Hence, practically they can only use for a few hundred cities
in TSP. Hence, soft computing techniques are used to solve
TSP for a large set of cities.
Whereas, x is the data to be scaled, i.e. WDC. Xin
and Xmax are minimum and maximum values of the raw
data, respectively. The results of NTSP using SOM are
shown in figure 1. In experimentation, the iteration is
considered to be 30000.
Fig. 1. NTPS using SOM
B. NTSP by Genetic Algorithm (GA)
The objective function is the traveling salesman
problem with the Indian cities' coordinate system. The
Genetic algorithm starts with the initial population followed
by mutation and crossover operation then selection. In
NTSP, the traveler needs to be visited each exactly one and
terminated at the origin. A city (represented as (x, y)
coordinates). The individual is the single route satisfying the
condition. The population is a collection of possible routes
(i.e., a collection of individuals). Crossover combines two
parents to form children for the next generation. Fitness is a
function that computes the shortest route. Mutation
introduces diversity to the population. Last is the selection of
the fittest individual for the next generation. Output Images
showing Nodes (Indian Cities) [Green Colored Dots]. The
experimentation with an initial population of size 200,
crossover probability 0.2, and mutation probability 05
is shown in figure 3.
C. NTSP by Simulated Annealing (SA)
In SA the state represents by the temperature. When
the search reached to frozen state then only the temperature
changes. The temperature is changes by the cooling factor.
This process is continued till the termination condition does
not satisfied. The results are shown in figure 2.

Iteration 1000 Iteration 5000

Iteration 10000 Iteration 20000

Iteration 30000

978-1-6654-1005-2/22/$31.00 ©2022 IEEE 718

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY KANPUR. Downloaded on October 29,2022 at 05:14:01 UTC from IEEE Xplore. Restrictions apply.
 2022 Third International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)

observations is 43053.48 km and the standard deviation is

150.17.

Total Route Length (in km)

Fig. 2. NTPS using SA

Instance
Fig. 5. SA Output Graph

From figure 5. it is observed that the Genetic algorithm

gives the total length of the sub-optimal path ranges from
1,72,474 km to 1,88,974 km. It shows the mean total route
length for 25 observations is 1,81,766.36 km and the
standard deviation is 4783.32.
After 250 generation
Initial population
Total Route Length (in km)

After 500 Generation

Fig. 3. NTPS using GA

Instance
SOM, SA, and GA algorithms are tested 25 times for finding Fig. 6. GA Output Graph
NTSP sub-optimal solutions. Graphs shown below define
different total route lengths calculated for different instances.
Total Route Length (in km)

From Figure 6, it is observed that the Genetic algorithm

gives the total length of the sub-optimal path ranges from
40,128 km to 49,651 km. It shows the mean total route
length for 25 observations is 43,575.68 km and the standard
deviation is 2402.01.

TABLE I. COMPARISON OF SOFT COMPUTING TECHNIQUES FOR

SOLVING NTSP

Self- Simulated Genetic

Organizing Annealing (SA) Algorithm
Maps (SOM) (GA)
Instance Time is taken by
technique
Fig. 4. SOM Output Graph to complete: 1.67 seconds 8 seconds 1800
500 iterations 100 seconds 408 seconds seconds
From figure 4, it is observed that the SOM gives a total 30000 iterations -
length of sub-optimal path ranging from 42,797 km to Sub-optimal 43053.48 km 181766.36 km 43575.68
route Length km
43,320 km. It shows the mean total route length for 25 (Mean μ)

978-1-6654-1005-2/22/$31.00 ©2022 IEEE 719

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY KANPUR. Downloaded on October 29,2022 at 05:14:01 UTC from IEEE Xplore. Restrictions apply.
 2022 Third International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)
Standard 150.17 4783.32 2402.01
Deviation (σ)
III. CONCLUSION
The methods for solving the NTSP presented in this paper
are based on Soft Computing techniques which include a
Self-organizing map, Simulated annealing, and Genetic
algorithm. These techniques are executed on the NTSP
dataset “Indian tsp” and their sub-optimal results are
evaluated for comparative analysis. The factors for analysis
included time taken by a soft computing technique, sub-
optimal route Length, and standard deviation. Easy
implementation using Python modules instead of a program,
and fast computation of SOM algorithm provide a flexible
method to find sub-optimal routes for NTSP.
During the execution of the SOM algorithm, the neuron ring
detected every possible link between small paths which
makes the algorithm decrease sub-optimal route lengths in
each iteration. SOM algorithm estimated shorter sub-optimal
route lengths than Simulated Annealing and Genetic
Algorithm.
Based on the analysis of algorithms it can be concluded that
the concept of an Artificial Neural Network is a reliable and
quick means to find the sub-optimized route for the problem.
978-1-6654-1005-2/22/$31.00 ©2022 IEEE
Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY KANPUR. Downloaded on October 29,2022 at 05:14:01 UTC from IEEE Xplore. Restrictions apply.
REFERENCES
[1] É. D. Taillard, K. Helsgaun, “POPMUSIC for the Travelling
Salesman Problem” European Journal of Operational Research, In
Press, 2018.
[2] K. Helsgaun, “POPMUSIC for Candidate Set Generation in the Lin-
Kernighan-Helsgaun TSP Solver” TR, Computer Science, Roskilde
University, 2018.
[3] R. Tinós, K. Helsgaun, D. Whitley “Efficient Recombination in the
Lin-Kernighan-Helsgaun Traveling Salesman Heuristic” PPSN XV,
Processing, Part I, pp. 95-107, 2018.
[4] http://www.math.uwaterloo.ca/tsp/world/index.html
[5] http://www.math.uwaterloo.ca/tsp/world/countries.html
[6] M. Akbari , H. Izadkhah” Hybrid of genetic algorithm and krill herd
for software clustering problem ” 5th Conference on Knowledge
Based Engineering and Innovation (KBEI), 2019.
[7] N. Razali, J. Geraghty, “Genetic Algorithm (GA) Performance with
Different Selection Strategies in Solving TSP” Proceedings of the
World Congress on Engineering 2011 Vol II, July 6 - 8, 2011,
[8] D. Bertsimas, J. Tsitssiklis “Simulated Annealing “, Statistical
Science, Vol. 5 No. 1, 10-15,1993.
[9] X. Liu, B. Zhang, F. Du, “ Integrating Relative Coordinates with
Simulated Annealing to Solve a Traveling Salesman Problem” ,
Seventh International Joint Conference on Computational Sciences
and Optimization, 2014.
[10] Ultsch, Alfred "Emergence in Self-Organizing Feature
Maps". Proceedings of the 6th International Workshop on Self-
Organizing Maps (WSOM '07). Bielefeld, Germany:
Neuroinformatics Group. ISBN 978-3-00- 022473-7.
[11] K. Kitaori , H. Murakoshi , N. Funakubo “A new approach to solve
the traveling salesman problem by using the improved
Kohonen's self-organizing feature map,” Proceedings of IECON '95 -
21st Annual Conference on IEEE Industrial Electronics, 1995.
720