Optimization of the travelling salesman problem by hybrid genetic algorithm

Rahul Jain; M L Meena

Optimization of the travelling salesman problem by hybrid genetic algorithm

EuroSciCon Conference & Expo on Robotics, Automation & Data Analytics
April 08-09, 2019 | Paris, France

Rahul Jain and M L Meena

Rajasthan Technical University Kota, India Malaviya National Institute of Technology, India

Posters & Accepted Abstracts: Am J Compt Sci Inform Technol

Abstract

In the present, travelling salesman problem (TSP) has given more priority due to its analogy real applications like transportation of goods, distribution of the supplies, power cable distribution, tourism, routing of public transport, laser printing, drilling operation. Genetic algorithm (GA) class is used to find the optimal solution but as problem increases, robustness decreases due to very slow convergence rate. Similar trend is found in the micro genetic algorithm (MGA), as they demand more sample size to reach a suitable solution. In this study, a hybrid GA is proposed in order to optimize the TSP efficiently.