Tabu search based global optimization algorithms for problems in computational chemistry.
Christoph GrebnerJohannes BeckerDaniel WeberBernd EngelsPublished in: J. Cheminformatics (2012)
Keyphrases
- global optimization
- tabu search
- test problems
- heuristic methods
- simulated annealing
- metaheuristic
- optimization problems
- hybrid algorithm
- graph colouring
- multi start
- benchmark problems
- search heuristics
- inverse problems
- tabu search algorithm
- particle swarm optimization
- combinatorial optimization
- benchmark instances
- search methods
- vehicle routing problem
- imperialist competitive algorithm
- genetic algorithm
- combinatorial optimization problems
- path relinking
- search algorithm
- global optimality
- search procedure
- feasible solution
- ant colony algorithm
- multi objective
- test instances
- exact algorithms
- solution quality
- scatter search
- bin packing
- combinatorial problems
- multidimensional knapsack problem
- scheduling problem
- quadratic assignment problem
- pso algorithm
- memetic algorithm
- job shop scheduling problem
- np complete
- max sat
- iterated local search
- evolutionary algorithm
- simulated annealing and tabu search
- constrained global optimization
- computational chemistry
- computational complexity