An Improved Benders Decomposition Algorithm for an Arc Interdiction Vehicle Routing Problem.
Amir Saman KheirkhahHamidreza NavidiMasume Messi BidgoliPublished in: IEEE Trans. Engineering Management (2016)
Keyphrases
- decomposition algorithm
- vehicle routing problem
- metaheuristic
- decomposition method
- routing problem
- tabu search
- benchmark problems
- traveling salesman problem
- vehicle routing
- np hard
- travel time
- vehicle routing problem with time windows
- hybrid metaheuristic
- working set
- multi depot
- combinatorial optimization
- combinatorial optimization problems
- particle swarm optimization
- max min
- pick up and delivery
- vehicle routing problem with simultaneous
- variable neighborhood search
- working set selection
- knapsack problem
- recognition algorithm
- search strategies
- special case
- search space
- greedy randomized adaptive search procedure
- optimal solution