Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping.
Luigi Di Puglia PuglieseDaniele FeronePaola FestaFrancesca GuerrieroGiusy MacrinaPublished in: Optim. Lett. (2023)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- tabu search
- metaheuristic
- hybrid metaheuristic
- benchmark instances
- routing problem
- traveling salesman problem
- neighborhood search
- benchmark problems
- test instances
- hybrid method
- memetic algorithm
- np hard
- combinatorial optimization problems
- travel time
- heuristic methods
- combinatorial optimization
- particle swarm optimization
- path relinking
- single machine scheduling problem
- search procedure
- optimal solution
- genetic algorithm
- lower bound
- knapsack problem
- feasible solution
- evolutionary algorithm
- multi objective
- optimization problems