A Variable Neighborhood Search for the Vehicle Routing Problem with Occasional Drivers and Time Windows.
Giusy MacrinaLuigi Di Puglia PuglieseFrancesca GuerrieroPublished in: ICORES (2020)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- tabu search
- routing problem
- benchmark instances
- vehicle routing
- traveling salesman problem
- hybrid metaheuristic
- neighborhood search
- benchmark problems
- travel time
- np hard
- test instances
- memetic algorithm
- particle swarm optimization
- combinatorial optimization
- combinatorial optimization problems
- simulated annealing
- genetic algorithm
- scheduling problem
- job shop scheduling problem
- scatter search
- optimization problems
- test problems
- knapsack problem
- special case
- path relinking
- evolutionary algorithm