Results 1  10
of
362,423
On solving traveling salesman problems by genetic algorithms
 Lecture Notes in Computer Science 496
, 1991
"... We present a genetic algorithm for solving the traveling salesman problem by genetic algorithms to optimality for traveling salesman problems with up to 442 cities. Mlihlenbein et al. [MGK 88], [MK 89] have proposed a genetic algorithm f the traveling salesman problem, which generates very good but ..."
Abstract

Cited by 58 (6 self)
 Add to MetaCart
We present a genetic algorithm for solving the traveling salesman problem by genetic algorithms to optimality for traveling salesman problems with up to 442 cities. Mlihlenbein et al. [MGK 88], [MK 89] have proposed a genetic algorithm f the traveling salesman problem, which generates very good
Solving Traveling Salesman Problem using a new antbased mechanism
, 2005
"... An algorithm based on Ant Colony System for solving Traveling Salesman Problem is proposed. The new algorithm, introduces in Ant Colony System an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved to ..."
Abstract
 Add to MetaCart
An algorithm based on Ant Colony System for solving Traveling Salesman Problem is proposed. The new algorithm, introduces in Ant Colony System an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved
Solving Traveling Salesman Problems Using Molecular Programming
 in: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99
, 1999
"... Molecular programming (MP) has been proposed as an evolutionary computation algorithm at the molecular level [Zhang and Shin, 1998]. MP are different from other evolutionary algorithms in its representation of solutions using DNA molecular structures and its use of biolab techniques for recombinati ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
for recombination of partial solutions. In this paper, molecular programming is applied to traveling salesman problems (TSPs) whose solution requires encoding of realvalues in DNA strands. We propose a new encoding scheme for real values that is biologically plausible and has a fixed code length. The effectiveness
Heuristic Approaches to Solve Traveling Salesman Problem
, 2015
"... This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why differe ..."
Abstract
 Add to MetaCart
This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why
Solving Traveling Salesman Problem on Cluster Compute Nodes
"... Abstract: In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). TSP is the problem of finding the shortest path from point A to point B, given a set of points and passing through each point exactly once. Initially a sequential algorithm is fabri ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). TSP is the problem of finding the shortest path from point A to point B, given a set of points and passing through each point exactly once. Initially a sequential algorithm
A Hybrid Method for Solving Traveling Salesman Problem
"... Abstract—One of the important problems in graphs theory is TSP. Both learning automata and genetic algorithms are search tools which are used for solving many NPComplete problems. In this paper a hybrid algorithm is proposed to solve TSP. This algorithm uses both GA and LA simultaneously to search ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—One of the important problems in graphs theory is TSP. Both learning automata and genetic algorithms are search tools which are used for solving many NPComplete problems. In this paper a hybrid algorithm is proposed to solve TSP. This algorithm uses both GA and LA simultaneously to search
Hopfield Neural Network with Chaotic Pulse Wave Solving Traveling Salesman Problems
"... In this study, in order to investigate the effect of chaotic oscillations of real biological signals on information processing ability, we investigate the performance of the Hopfield neural networks solving traveling salesman problems when the sampled data of chaotic pulse waves obtained from real ..."
Abstract
 Add to MetaCart
In this study, in order to investigate the effect of chaotic oscillations of real biological signals on information processing ability, we investigate the performance of the Hopfield neural networks solving traveling salesman problems when the sampled data of chaotic pulse waves obtained from
Extended hybrid genetic algorithm for solving Travelling Salesman Problem with sorted population
, 2010
"... Abstract The performance of Genetic Algorithms (GA) is affected by various factors such as parameters, genetic operators and strategies. The traditional approach with random initial population is efficient however the whole initial population may contain many infeasible solutions. Thus it would take ..."
Abstract
 Add to MetaCart
and applies it to solving Travelling Salesman Problem (TSP). Normally, the bigger the initial the population is the more computationally expensive the calculation becomes with each generation. New approach allows reducing the size of the initial problem and thus achieve faster convergence. The proposed
Hop eld NN with Chaotic Pulse Wave Solving Traveling Salesman Problems
"... The Traveling Salesman Problems (TSP) is one of the appli ..."
Augmenting Genetic Algorithms with Memory to Solve Traveling Salesman Problems
 Proceedings of the Joint Conference on Information Sciences
, 1997
"... This paper explores the feasibility of augmenting genetic algorithms with a long term memory. During a genetic algorithm run, we periodically store individuals in a database. When confronted with a new problem, instead of starting from scratch, we inject the solutions to previously solved similar pr ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
problems (from the database) into the initial population of the genetic algorithm. We evaluate the performance of the genetic algorithm with such a long term memory on a set of benchmark traveling salesman problems. In addition, we compare the performance of these augmented genetic algorithms when trained
Results 1  10
of
362,423