scholarly journals Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

2016 ◽  
Vol 04 (15) ◽  
pp. 98-106 ◽  
Author(s):  
Bao Lin ◽  
Xiaoyan Sun ◽  
Sana Salous
Keyword(s):  
Genetic Algorithm ◽  
Travelling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Travelling Salesman

scholarly journals Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Maha Ata Al-Furhud ◽  
Zakir Hussain Ahmed
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Travelling Salesman ◽  
Complex Optimization ◽  
Problem Instances ◽  
Search Approach ◽  
Multiple Travelling Salesman Problem

The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman problem (TSP), is studied here. In MTSP, starting from a depot, multiple salesmen require to visit all cities so that each city is required to be visited only once by one salesman only. It is NP-hard and is more complex than the usual TSP. So, exact optimal solutions can be obtained for smaller sized problem instances only. For large-sized problem instances, it is essential to apply heuristic algorithms, and amongst them, genetic algorithm is identified to be successfully deal with such complex optimization problems. So, we propose a hybrid genetic algorithm (HGA) that uses sequential constructive crossover, a local search approach along with an immigration technique to find high-quality solution to the MTSP. Then our proposed HGA is compared against some state-of-the-art algorithms by solving some TSPLIB symmetric instances of several sizes with various number of salesmen. Our experimental investigation demonstrates that the HGA is one of the best algorithms.

scholarly journals The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Zakir Hussain Ahmed
Keyword(s):  
Genetic Algorithm ◽  
Travelling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Computational Time ◽  
Computational Results ◽  
Travelling Salesman ◽  
Solution Quality ◽  
Heuristic Solution ◽  
Present Solution ◽  
Sequencing Problems

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The problem is NP-hard, and it arises in practical transportation and sequencing problems. This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem. The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes. The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time. Finally, we present solution to some more symmetric TSPLIB instances.

Sign in / Sign up

Export Citation Format

Share Document