An asynchronous parallel implementation of a cellular genetic algorithm for combinatorial optimization.
Gabriel LuqueEnrique AlbaBernabé DorronsoroPublished in: GECCO (2009)
Keyphrases
- combinatorial optimization
- parallel implementation
- genetic algorithm
- metaheuristic
- simulated annealing
- combinatorial optimization problems
- job shop scheduling problem
- traveling salesman problem
- parallel computation
- branch and bound
- tabu search
- branch and bound algorithm
- combinatorial problems
- parallel implementations
- fitness function
- optimization problems
- mathematical programming
- quadratic assignment problem
- estimation of distribution algorithms
- ant colony optimization
- parallel computers
- vehicle routing problem
- neural network
- memetic algorithm
- genetic algorithm ga
- evolutionary algorithm
- cellular automata
- search space
- multi objective
- evolutionary computation
- optimal solution
- exact algorithms
- distributed memory
- single machine scheduling problem
- ant colony
- particle swarm optimization
- lower bound
- multi objective optimization