A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network.
Junko HosodaStephen J. MaherYuji ShinanoJonas Christoffer VillumsenPublished in: Comput. Oper. Res. (2024)
Keyphrases
- vehicle routing problem
- transportation networks
- branch and bound
- combinatorial optimization
- traveling salesman problem
- travel time
- tree search algorithm
- depth first search
- metaheuristic
- branch and bound algorithm
- tabu search
- branch and bound procedure
- network design problem
- routing problem
- optimal solution
- multi depot
- combinatorial optimization problems
- tree search
- search algorithm
- branch and bound method
- beam search
- search strategies
- simulated annealing
- variable neighborhood search
- column generation
- vehicle routing problem with time windows
- branch and bound search
- lagrangian heuristic
- hybrid metaheuristic
- optimization problems
- search space
- exact algorithms
- lower bound
- np hard
- benchmark problems
- upper bound
- ant colony optimization
- greedy randomized adaptive search procedure
- neural network
- valid inequalities
- road network
- max sat
- cost function
- pick up and delivery
- particle swarm optimization
- special case