A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem.
Youcef AmaroucheRym Nesrine GuibadjAziz MoukrimPublished in: ATMOS (2018)
Keyphrases
- neighborhood search
- set cover
- vehicle routing problem
- np hard
- approximation algorithms
- greedy algorithm
- variable neighborhood search
- metaheuristic
- solution space
- tabu search
- network flow
- simulated annealing
- traveling salesman problem
- test instances
- scheduling problem
- benchmark problems
- routing problem
- benchmark instances
- travel time
- lower bound
- special case
- combinatorial optimization
- memetic algorithm
- minimum cost
- worst case
- branch and bound algorithm
- optimal solution
- linear program
- linear programming
- convex hull
- computational complexity
- knapsack problem
- constraint satisfaction problems
- particle swarm optimization
- optimization problems
- evolutionary algorithm
- integer programming
- path relinking