A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations.
Maurizio BruglieriSimona ManciniOrnella PisacanePublished in: Optim. Lett. (2021)
Keyphrases
- vehicle routing problem
- routing problem
- cutting plane
- metaheuristic
- tabu search
- vehicle routing problem with time windows
- knapsack problem
- benchmark problems
- vehicle routing
- traveling salesman problem
- integer programming problems
- travel time
- hybrid metaheuristic
- particle swarm optimization
- cutting plane algorithm
- optimization problems
- computationally expensive
- vehicle routing problem with simultaneous
- combinatorial optimization
- scheduling problem
- integer programming
- valid inequalities
- search strategies
- linear programming
- genetic algorithm
- pick up and delivery
- neural network