A branch-and-bound algorithm for the time-Dependent rural postman problem.
Tobia CalogiuriGianpaolo GhianiEmanuela GuerrieroRenata MansiniPublished in: Comput. Oper. Res. (2019)
Keyphrases
- branch and bound algorithm
- traveling salesman problem
- combinatorial optimization
- lower bound
- branch and bound
- routing problem
- travel time
- upper bound
- optimal solution
- np hard
- test problems
- search tree
- lower bounding
- precedence constraints
- upper bounding
- vehicle routing problem
- variable ordering
- mixed integer linear programming
- branch and bound method
- search space
- single machine scheduling problem
- finding an optimal solution
- max sat
- lagrangian relaxation
- randomly generated problems
- integer variables
- simulated annealing
- evolutionary algorithm
- search algorithm