An Efficient Genetic Algorithm for the Traveling Salesman Problem
From MaRDI portal
Recommendations
- A genetic algorithm for traveling salesman problems
- Genetic algorithms for the traveling salesman problem
- scientific article; zbMATH DE number 4104744
- A new genetic algorithm applied to the traveling salesman problem
- An improved genetic algorithm for solving travel salesman problem
- Solving traveling salesman problems by genetic algorithms
- scientific article; zbMATH DE number 1738699
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Solving constrained traveling salesman problems by genetic algorithms
Cites work
Cited in
(33)- Genetic algorithms and traveling salesman problems
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
- Some issues of designing genetic algorithms for traveling salesman problems
- Case injected genetic algorithms for traveling salesman problems
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- Solving the traveling salesman problem using a genetic algorithm based on Latin hypercube sampling
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- A Multilevel Genetic Algorithm for the Traveling Salesman Problem
- Solution to traveling salesman problems with simulated annealing partheno genetic algorithm in MATLAB
- A genetic algorithm for traveling salesman problems
- A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem
- A new genetic algorithm applied to the traveling salesman problem
- Solving TSP with improved multi-Agent genetic algorithm
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
- Searching the components of the solution: The factor-based random search algorithm for ETSP
- scientific article; zbMATH DE number 1174488 (Why is no real title available?)
- A gene-pool based genetic algorithm for TSP
- scientific article; zbMATH DE number 1738699 (Why is no real title available?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Application of improved genetic simulated annealing algorithm in TSP optimization
- scientific article; zbMATH DE number 1839653 (Why is no real title available?)
- HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
- Seeker genetic algorithm solving traveling salesman problem
- Firefly algorithm for min-max colored traveling salesman problem
- An improved genetic algorithm for solving travel salesman problem
- An efficient evolvable LK algorithm to TSP
- A new hybrid algorithm for solving large scale TSP
- An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem
- A reinforced hybrid genetic algorithm for the traveling salesman problem
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- A memetic algorithm for the generalized traveling salesman problem
This page was built for publication: An Efficient Genetic Algorithm for the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058949)