The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach.
Zizhen ZhangHu QinWenbin ZhuAndrew LimPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- branch and bound
- vehicle routing problem
- combinatorial optimization
- tree search algorithm
- metaheuristic
- branch and bound algorithm
- search algorithm
- lower bound
- column generation
- mini bucket
- optimal solution
- search space
- vehicle routing
- search strategies
- tabu search
- vehicle routing problem with time windows
- tree search
- upper bound
- combinatorial optimization problems
- routing problem
- beam search
- benchmark problems
- travel time
- traveling salesman problem
- hybrid metaheuristic
- branch and bound procedure
- simulated annealing
- np hard
- parallel tree search
- network design problem
- branch and bound method
- search tree
- special case
- particle swarm optimization
- np complete
- max sat
- branch and bound search
- optimization problems
- search strategy