A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs.
Franziska TheurichAndreas FischerGuntram ScheithauerPublished in: EURO J. Comput. Optim. (2021)
Keyphrases
- vehicle routing problem
- branch and bound
- combinatorial optimization
- tree search algorithm
- metaheuristic
- branch and bound algorithm
- search strategies
- optimal solution
- search algorithm
- traveling salesman problem
- lower bound
- column generation
- search space
- tabu search
- vehicle routing problem with time windows
- vehicle routing
- routing problem
- np hard
- combinatorial optimization problems
- travel time
- hybrid metaheuristic
- branch and bound procedure
- benchmark problems
- upper bound
- beam search
- network design problem
- optimization problems
- simulated annealing
- tree search
- branch and bound search
- branch and bound method
- vehicle routing problem with simultaneous
- knapsack problem
- heuristic search
- particle swarm optimization
- objective function
- neural network
- search tree
- linear programming
- scheduling problem
- special case
- data structure
- reinforcement learning
- genetic algorithm
- pick up and delivery