Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).
Jörg LässigDirk SudholtPublished in: ISAAC (2011)
Keyphrases
- extended abstract
- combinatorial optimization
- evolutionary algorithm
- simulated annealing
- optimization problems
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- orders of magnitude
- branch and bound
- parallel processing
- multi objective
- search space
- energy minimization
- branch and bound algorithm
- scheduling problem
- combinatorial problems
- combinatorial search