Pages that link to "Item:Q3058949"
From MaRDI portal
The following pages link to An Efficient Genetic Algorithm for the Traveling Salesman Problem (Q3058949):
Displaying 17 items.
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. (Q1597083) (← links)
- Some issues of designing genetic algorithms for traveling salesman problems (Q1764595) (← links)
- Case injected genetic algorithms for traveling salesman problems (Q1854036) (← links)
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem (Q3297452) (← links)
- A gene-pool based genetic algorithm for TSP (Q4454481) (← links)
- (Q4530050) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666428) (← links)
- Application of improved genetic simulated annealing algorithm in TSP optimization (Q4687946) (← links)
- (Q4782946) (← links)
- A reinforced hybrid genetic algorithm for the traveling salesman problem (Q6106563) (← links)
