Results 11  20
of
362,423
Solving Traveling Salesman Problem Using Hierarchical Clustering and Genetic Algorithm
"... Abstract — The Traveling Salesman Problem(TSP) is one of the most intensively studied problem in computational mathematics. To solve this problem a number of algorithms have been developed using genetic algorithms. But these algorithms are not so suitable for solving largescale TSP. This paper prop ..."
Abstract
 Add to MetaCart
Abstract — The Traveling Salesman Problem(TSP) is one of the most intensively studied problem in computational mathematics. To solve this problem a number of algorithms have been developed using genetic algorithms. But these algorithms are not so suitable for solving largescale TSP. This paper
Modified Ant Colony Optimization for Solving Traveling Salesman Problem
"... Abstract This paper presents a new algorithm for solving the Traveling Salesman Problem (NP hard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of realworld problems can ..."
Abstract
 Add to MetaCart
Abstract This paper presents a new algorithm for solving the Traveling Salesman Problem (NP hard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of realworld problems
Solving Travelling Salesman Problem using Clustering Genetic Algorithm
"... Abstract — 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) ..."
Abstract
 Add to MetaCart
Abstract — 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
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
"... Abstract—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to overcome the abovementioned limitations. This novel type of greedy genetic algorithm is based on the base point, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, which can generate good initial population, and combine with hybrid algorithms to get the optimal solution. The proposed algorithm is tested with the Traveling Salesman Problem (TSP), and the experimental results demonstrate that the proposed algorithm is a feasible and effective algorithm in solving
Consideration of Genetic Algorithm with Virus Infection solving Traveling Salesman Problem
"... Genetic Algorithm (GA) is known as method to solve Traveling Salesman Problem (TSP). However, GA needs amount of time for finding approximate solution. Thus, this study proposes Genetic Algorithm with Virus Infection (GAVI). GAVI algorithm is using Virus Theory of Evolution (VTE) to be based on Gen ..."
Abstract
 Add to MetaCart
Genetic Algorithm (GA) is known as method to solve Traveling Salesman Problem (TSP). However, GA needs amount of time for finding approximate solution. Thus, this study proposes Genetic Algorithm with Virus Infection (GAVI). GAVI algorithm is using Virus Theory of Evolution (VTE) to be based
An Efficient Hybrid Genetic Algorithm for Performance Enhancement in solving Travelling Salesman Problem
"... Abstract — This paper, proposes a solution for Travelling Salesman Problem (TSP) [1], using Genetic Algorithm (GA). The proposed algorithm works on data sets of latitude and longitude coordinates of cities and provides optimal tours in shorter time; giving convergence that is fast and better. To imp ..."
Abstract
 Add to MetaCart
Abstract — This paper, proposes a solution for Travelling Salesman Problem (TSP) [1], using Genetic Algorithm (GA). The proposed algorithm works on data sets of latitude and longitude coordinates of cities and provides optimal tours in shorter time; giving convergence that is fast and better
APPLICATION OF GENETIC ALGORITHM TO SOLVE TRAVELING SALESMAN PROBLEM
"... This research investigated the application of Genetic Algorithm capable of solving the traveling salesman problem (TSP). Genetic Algorithm are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP grap ..."
Abstract
 Add to MetaCart
This research investigated the application of Genetic Algorithm capable of solving the traveling salesman problem (TSP). Genetic Algorithm are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP
Dynamic Local Search Algorithm for Solving Traveling Salesman Problem
"... Abstract — In this paper, developing a new local search approach based on 2Opt operator and its implementation for TSP solution in SA algorithm (as a global search algorithm) is purposed. It is shown that more favorable results are expected by meaningful correlation between local search approach an ..."
Abstract
 Add to MetaCart
and global search algorithm in annealing process. In order to compare the performance of the proposed operator with the 2Opt as a basic operator, 24 benchmarks of TSP is selected from TSPLIB and both algorithms are implemented for 20 times for solving these benchmarks. The results show the improvement
MarApr 2013 EDITION Solving Travelling Salesman Problem using Firefly Algorithm
"... Abstract: Although the rapid advances in current technology in all areas, still there are some realworld NP complex problems that still elude scientists. Some of such complex problems are Travelling Salesman Problem (TSP), Knapsack Problem, Graph Coloring, Vehicle Routing etc., which got attention ..."
Abstract
 Add to MetaCart
Abstract: Although the rapid advances in current technology in all areas, still there are some realworld NP complex problems that still elude scientists. Some of such complex problems are Travelling Salesman Problem (TSP), Knapsack Problem, Graph Coloring, Vehicle Routing etc., which got attention
Results 11  20
of
362,423