Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP.
Carlos CottaJosé Francisco Aldana MontesAntonio J. NebroJosé M. TroyaPublished in: ICANNGA (1995)
Keyphrases
- branch and bound
- genetic algorithm
- combinatorial optimization
- search space
- optimal solution
- traveling salesman problem
- metaheuristic
- simulated annealing
- branch and bound procedure
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- upper bound
- tree search
- neural network
- branch and bound method
- multi objective
- beam search
- ant colony optimization
- randomly generated problems
- branch and bound search
- lagrangian heuristic
- optimization problems
- partial solutions
- evolutionary algorithm
- crossover operator
- genetic algorithm ga
- network design problem
- tree search algorithm
- integer programming problems
- mathematical programming
- max sat
- hybrid algorithm
- np hard
- depth first search
- reduce the search space
- linear programming
- differential evolution
- constraint programming
- vehicle routing problem
- search strategy
- bayesian networks