Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem.
Sandro PirkwieserGünther R. RaidlPublished in: Hybrid Metaheuristics (2010)
Keyphrases
- variable neighborhood search
- vehicle routing problem
- routing problem
- metaheuristic
- tabu search
- benchmark instances
- traveling salesman problem
- search strategies
- heuristic methods
- hybrid method
- minimum spanning tree
- benchmark problems
- travel time
- np hard
- memetic algorithm
- test instances
- particle swarm optimization
- optimal solution
- search procedure
- routing algorithm
- single machine scheduling problem
- combinatorial optimization problems
- path relinking
- combinatorial optimization
- shortest path
- scatter search