Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony.
Stefano BenedettiniLuca Di GasperoAndrea RoliPublished in: HIS (2008)
Keyphrases
- highly scalable
- hybrid metaheuristic
- haplotype inference
- vehicle routing problem
- scatter search
- entropy minimization
- metaheuristic
- multi objective
- branch and bound algorithm
- answer set programming
- variable neighborhood search
- path relinking
- multi population
- np hard problems
- initial population
- genetic algorithm
- tabu search
- combinatorial optimization
- greedy heuristic
- search space
- optimization problems
- ant colony optimization
- optimal solution
- evolutionary algorithm
- combinatorial problems
- np hard
- branch and bound
- traveling salesman problem
- upper bound
- combinatorial optimization problems
- exact algorithms
- routing problem
- phase transition
- heuristic search
- lower bound
- search algorithm
- simulated annealing