Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows.
Slim BelhaizaRym M'HallahGhassen Ben BrahimGilbert LaportePublished in: J. Heuristics (2019)
Keyphrases
- vehicle routing problem
- multi start
- vehicle routing problem with time windows
- tabu search
- metaheuristic
- iterated local search
- vehicle routing
- path relinking
- routing problem
- genetic algorithm
- heuristic methods
- simulated annealing
- search strategies
- memetic algorithm
- combinatorial optimization
- benchmark problems
- traveling salesman problem
- search algorithm
- scatter search
- hyper heuristics
- evolutionary computation
- optimal solution
- combinatorial optimization problems
- np hard
- travel time
- test problems
- search methods
- ant colony optimization
- search procedure
- search heuristics
- search space
- neural network
- knapsack problem
- branch and bound
- particle swarm optimization
- scheduling problem
- worst case
- feasible solution
- np complete