A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows.
Slim BelhaizaRym M'HallahGhassen Ben BrahimPublished in: CEC (2017)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- benchmark instances
- tabu search
- metaheuristic
- neighborhood search
- routing problem
- vehicle routing
- hybrid metaheuristic
- traveling salesman problem
- test instances
- combinatorial optimization
- benchmark problems
- genetic algorithm
- memetic algorithm
- travel time
- simulated annealing
- search strategies
- combinatorial optimization problems
- np hard
- particle swarm optimization
- heuristic methods
- knapsack problem
- lower bound
- search methods
- search algorithm
- scheduling problem
- neural network
- job shop scheduling problem
- combinatorial problems
- test problems
- minimum spanning tree
- search procedure
- optimization problems
- path relinking
- optimal solution
- feasible solution