Solving constrained traveling salesman problems by genetic algorithms
From MaRDI portal
Publication:2583359
Recommendations
- An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem
- A genetic algorithm for traveling salesman problems
- Genetic algorithms and traveling salesman problems
- An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments
- scientific article; zbMATH DE number 4104744
Cited in
(11)- A hybrid heuristic for restricted 4-dimensional TSP (r-4DTSP)
- Some issues of designing genetic algorithms for traveling salesman problems
- A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter
- An Efficient Genetic Algorithm for the Traveling Salesman Problem
- Rapid solution of constrained traveling salesman problems
- scientific article; zbMATH DE number 1054959 (Why is no real title available?)
- scientific article; zbMATH DE number 1738699 (Why is no real title available?)
- An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments
- scientific article; zbMATH DE number 1839653 (Why is no real title available?)
- An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
This page was built for publication: Solving constrained traveling salesman problems by genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583359)