Divide and conquer strategies for parallel TSP heuristics.
Giovanni CesariPublished in: Comput. Oper. Res. (1996)
Keyphrases
- search strategies
- traveling salesman problem
- parallel implementation
- selection strategies
- genetic algorithm
- combinatorial optimization
- ant colony optimization
- heuristic search
- control strategies
- massively parallel
- computer architecture
- scheduling problem
- search space
- data sets
- depth first search
- search procedures
- distributed memory machines
- load balancing
- database systems
- search engine
- information retrieval
- neural network