Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem.
Michael Yu. KhachayStanislav UkolovAlexander PetuninPublished in: OPTIMA (2021)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- branch and bound algorithm
- combinatorial problems
- branch and bound
- combinatorial optimization problems
- optimization problems
- lower bound
- metaheuristic
- vehicle routing problem
- ant colony optimization
- randomly generated
- search tree
- ant colony optimization algorithm
- optimal solution
- test problems
- boolean satisfiability
- hamiltonian cycle
- upper bound
- neural network
- constraint programming
- haplotype inference
- traveling salesman
- nature inspired
- set covering problem
- satisfy the triangle inequality
- subtour elimination
- genetic local search
- quadratic assignment problem
- max sat
- orders of magnitude
- evolutionary algorithm
- genetic algorithm