A self-adaptive local search algorithm for the classical vehicle routing problem.
Cigdem Alabas-UsluBerna DengizPublished in: Expert Syst. Appl. (2011)
Keyphrases
- vehicle routing problem
- search algorithm
- tabu search
- metaheuristic
- vehicle routing
- benchmark instances
- routing problem
- test instances
- search space
- vehicle routing problem with time windows
- benchmark problems
- hybrid metaheuristic
- np hard
- travel time
- traveling salesman problem
- multi depot
- combinatorial optimization
- search strategies
- memetic algorithm
- branch and bound
- particle swarm optimization
- search methods
- vehicle routing problem with simultaneous
- logistics distribution
- iterated local search
- heuristic search
- search procedure
- neighborhood search
- heuristic methods
- neural network
- max sat
- graph search
- scatter search
- variable neighborhood search
- information retrieval systems
- scheduling problem
- special case
- computational complexity
- greedy randomized adaptive search procedure