A Hybrid Metaheuristic for the Longest Common Subsequence Problem.
Manuel LozanoChristian BlumPublished in: Hybrid Metaheuristics (2010)
Keyphrases
- hybrid metaheuristic
- beam search
- metaheuristic
- scatter search
- vehicle routing problem
- search methods
- multi objective
- search algorithm
- heuristic search
- branch and bound
- initial population
- tabu search
- search problems
- genetic algorithm
- simulated annealing
- hill climbing
- path relinking
- ranking functions
- variable neighborhood search
- optimal solution
- search strategies
- combinatorial optimization
- optimization problems
- ant colony optimization
- evolutionary algorithm
- objective function
- hybrid algorithm
- branch and bound algorithm
- constraint satisfaction
- upper bound
- computational complexity