A Benders Decomposition Approach for an Integrated Bin Allocation and Vehicle Routing Problem in Municipal Waste Management.
Arthur MahéoDiego Gabriel RossitPhilip KilbyPublished in: ICPR-Americas (2) (2020)
Keyphrases
- vehicle routing problem
- waste management
- waste collection
- benders decomposition
- vehicle routing problem with time windows
- exact algorithms
- network design problem
- mixed integer
- combinatorial optimization
- knapsack problem
- metaheuristic
- tabu search
- np hard
- benchmark problems
- routing problem
- combinatorial optimization problems
- traveling salesman problem
- branch and bound
- optimal solution
- travel time
- memetic algorithm
- approximation algorithms
- particle swarm optimization
- combinatorial problems
- lp relaxation
- search strategies
- branch and bound algorithm
- linear program
- network design
- feasible solution
- simulated annealing
- scheduling problem
- neural network
- optimization problems
- special case