Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs.
Kai Kwong LauMohan J. KumarN. R. AchuthanPublished in: ISPAN (1997)
Keyphrases
- branch and bound algorithm
- vehicle routing problem
- parallel implementation
- combinatorial optimization
- metaheuristic
- branch and bound
- np hard
- traveling salesman problem
- precedence constraints
- simulated annealing
- vehicle routing problem with time windows
- test problems
- vehicle routing
- variable ordering
- finding an optimal solution
- hybrid metaheuristic
- routing problem
- optimal solution
- optimization problems
- single machine scheduling problem
- tabu search
- vehicle routing problem with simultaneous
- travel time
- lower bound
- upper bounding
- max sat
- benchmark problems
- ant colony optimization
- genetic algorithm
- integer variables
- upper bound
- exact algorithms
- lagrangian relaxation
- linear programming
- special case
- search space
- constraint satisfaction problems
- pick up and delivery
- search algorithm
- knapsack problem