Applying the attribute based hill climber heuristic to the vehicle routing problem.
Ulrich DerigsR. KaiserPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- multi depot
- tree search algorithm
- test instances
- combinatorial optimization
- iterated local search
- metaheuristic
- routing problem
- vehicle routing problem with time windows
- variable neighborhood search
- simulated annealing
- vehicle routing
- neighborhood search
- benchmark problems
- traveling salesman problem
- search strategies
- np hard
- hybrid metaheuristic
- travel time
- hill climbing
- greedy randomized adaptive search procedure
- memetic algorithm
- pick up and delivery
- search algorithm
- feasible solution
- scheduling problem
- optimal solution
- multi start
- logistics distribution
- vehicle routing problem with simultaneous
- heuristic methods
- branch and bound
- particle swarm optimization
- search space
- genetic algorithm
- timetabling problem
- knapsack problem
- hyper heuristics
- path relinking
- job shop scheduling problem
- optimization algorithm
- worst case
- dynamic programming
- special case
- information retrieval