A shared-memory ACO+GA hybrid for combinatorial optimization.
Adnan AcanAhmet ÜnverenPublished in: IEEE Congress on Evolutionary Computation (2007)
Keyphrases
- combinatorial optimization
- shared memory
- metaheuristic
- ant colony optimization
- genetic algorithm ga
- simulated annealing
- traveling salesman problem
- combinatorial optimization problems
- genetic algorithm
- parallel tree search
- optimization problems
- tabu search
- aco algorithm
- message passing
- parallel algorithm
- branch and bound
- combinatorial problems
- distributed memory
- multi processor
- parallel computing
- branch and bound algorithm
- search space
- vehicle routing problem
- hard combinatorial optimization problems
- combinatorial search
- parallel architectures
- quadratic assignment problem
- fitness function
- ant colony
- parallel programming
- memetic algorithm
- evolutionary algorithm
- particle swarm optimization
- optimal solution
- address space
- parallel execution
- ant colony optimisation
- parallel machines
- shared memory multiprocessors
- ant colony algorithm
- objective function
- parallel architecture
- lower bound
- parallel processing
- evolutionary computation