Sequential search and its application to vehicle-routing problems.
Stefan IrnichBirger FunkeTore GrünertPublished in: Comput. Oper. Res. (2006)
Keyphrases
- sequential search
- vehicle routing problem
- vehicle routing problem with time windows
- nearest neighbor search
- routing problem
- metaheuristic
- tabu search
- benchmark problems
- traveling salesman problem
- fractal image compression
- np hard
- particle swarm optimization
- combinatorial optimization
- guided local search
- search strategies
- knapsack problem
- nearest neighbor
- branch and bound algorithm
- optimization problems
- simulated annealing
- scheduling problem
- special case
- high dimensional
- parallel version
- lower bound
- database systems