Branch and Bound Algorithm for a Single Vehicle Routing Problem with Toll-by-Weight Scheme.
Zizhen ZhangHu QinAndrew LimSongshan GuoPublished in: IEA/AIE (3) (2010)
Keyphrases
- branch and bound algorithm
- vehicle routing problem
- combinatorial optimization
- np hard
- lower bound
- branch and bound
- metaheuristic
- optimal solution
- tabu search
- routing problem
- lower bounding
- upper bound
- test problems
- precedence constraints
- upper bounding
- hybrid metaheuristic
- vehicle routing problem with time windows
- test instances
- single machine scheduling problem
- vehicle routing
- traveling salesman problem
- multi depot
- benchmark problems
- scheduling problem
- lagrangian relaxation
- integer variables
- mathematical programming
- worst case
- exact algorithms
- approximation algorithms
- neural network
- computational complexity
- search strategies
- special case
- np complete
- particle swarm optimization
- linear programming
- finding an optimal solution
- optimization problems