A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem.
Thomas WeiseYan JiangQi QiWeichen LiuPublished in: Int. J. Cogn. Informatics Nat. Intell. (2019)
Keyphrases
- crossover operator
- branch and bound
- traveling salesman problem
- combinatorial optimization
- branch and bound algorithm
- combinatorial optimization problems
- column generation
- lower bound
- search algorithm
- metaheuristic
- optimization problems
- tree search
- simulated annealing
- branch and bound method
- optimal solution
- vehicle routing problem
- traveling salesman
- upper bound
- beam search
- valid inequalities
- search space
- max sat
- transportation networks
- ant colony optimization
- evolutionary algorithm
- probabilistic model
- genetic programming