A branch-and-bound algorithm for the time-dependent travelling salesman problem.
Anna AriglianoTobia CalogiuriGianpaolo GhianiEmanuela GuerrieroPublished in: Networks (2018)
Keyphrases
- branch and bound algorithm
- lower bound
- quadratic assignment problem
- branch and bound
- np hard
- combinatorial optimization
- lower bounding
- precedence constraints
- upper bound
- optimal solution
- upper bounding
- test problems
- randomly generated problems
- lagrangian relaxation
- mixed integer linear programming
- max sat
- travel time
- single machine scheduling problem
- variable ordering
- genetic algorithm
- branch and bound method
- finding an optimal solution
- special case