An Adjustable Robust Formulation and a Decomposition Approach for the Green Vehicle Routing Problem with Uncertain Waiting Time at Recharge Stations.
Luigi Di Puglia PuglieseFrancesca GuerrieroGiusy MacrinaPublished in: ICORES (2021)
Keyphrases
- vehicle routing problem
- metaheuristic
- routing problem
- tabu search
- hybrid metaheuristic
- vehicle routing
- vehicle routing problem with time windows
- traveling salesman problem
- benchmark problems
- combinatorial optimization
- particle swarm optimization
- memetic algorithm
- test instances
- travel time
- robust optimization
- neighborhood search
- np hard
- benchmark instances
- genetic algorithm
- variable neighborhood search
- simulated annealing
- pick up and delivery
- multi depot