Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA)
نویسندگان
چکیده
منابع مشابه
Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
We present an improved hybrid genetic algorithm to solve the two-dimensional Euclidean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local searc...
متن کاملSolving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...
متن کاملThe Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm
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 p...
متن کاملParallel Hybrid Genetic Algorithm for Solving Traveling Salesman Problem
This paper deals with the basics of genetic algorithm, a universal method of optimization and the need for parallel genetic algorithm. This also discusses briefly on the traveling salesman problem. A methodology is proposed to solve this problem using the different
متن کاملSolving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster
The paper investigates the efficiency of the parallel computation of the travelling salesman problem using the genetic approach on a slack multicomputer cluster. For the parallel algorithm design functional decomposition of the parallel application has been made and the manager/workers paradigm is applied. Performance estimation and parallelism profiling have been made on the basis of MPI-based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0110649