Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.
Antonio MucherinoLeo LibertiCarlile LavorNelson MaculanPublished in: GECCO (2009)
Keyphrases
- metaheuristic
- simulated annealing
- combinatorial optimization
- optimal solution
- search space
- scatter search
- tabu search
- ant colony optimization
- cost function
- particle swarm optimization
- hybrid algorithm
- solution space
- dynamic programming
- optimization algorithm
- optimization method
- genetic algorithm
- objective function
- optimization problems
- convex hull
- np hard
- job shop scheduling problem
- neural network
- path relinking
- harmony search
- threshold accepting
- greedy randomized adaptive search procedure