
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Traveling Salesman Problem (TSP) is one of the most common studied probl...
read it

ACO Implementation for Sequence Alignment with Genetic Algorithms
In this paper, we implement Ant Colony Optimization (ACO) for sequence a...
read it

A PolynomialTime Deterministic Approach to the Traveling Salesperson Problem
We propose a new polynomialtime deterministic algorithm that produces a...
read it

Cryptanalysis of MerkleHellman cipher using parallel genetic algorithm
In 1976, Whitfield Diffie and Martin Hellman introduced the public key c...
read it

Genetic algorithm for optimal distribution in cities
The problem to deal with in this project is the problem of routing elect...
read it

5/4 approximation for Symmetric TSP
Travelling Salesman Problem (TSP) is one of the unsolved problems in com...
read it

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades
Was investigated in this paper the use of a search strategy in the probl...
read it
Solving Traveling Salesman Problem for Large Spaces using Modified Meta Optimization Genetic Algorithm
Traveling salesman problem also called TSP is defined to find the best shortest way between n cities such as nodes, customers, and branches etc. with known distances for traveling between each city on GPS, where the salesman leaves a location in the city, visits each of the cities just once and returns back to the origin of city where he started. The traveling salesman problem is one of the NPhard problems (nondeterministic polynomial time) in optimization. It has a wide range of applications including distribution, planning, logistics, and it has been studied by researchers and academicians for so many years. In this paper, applied Metaoptimization genetic algorithm with neural networks is used to solve the TSP for finding all the best paths between all n cities. The metaoptimization genetic algorithm is good to find the way between all cities with low progress, less time, and compared with the TSP just using a genetic algorithm with the same parameters using the same map for the cities or nodes.
READ FULL TEXT
Comments
There are no comments yet.