Comparying a tabu search process - using and not using and intensification strategy to solve the vehicle routing problem.
Etiene Pozzobom Lazzeris SimasArthur Tórgo GómezPublished in: ICINCO-ICSO (2007)
Keyphrases
- tabu search
- vehicle routing problem
- metaheuristic
- simulated annealing
- feasible solution
- path relinking
- test problems
- scheduling problem
- memetic algorithm
- benchmark instances
- search algorithm
- iterated local search
- hybrid algorithm
- combinatorial optimization
- routing problem
- combinatorial optimization problems
- test instances
- search procedure
- variable neighborhood search
- heuristic methods
- vehicle routing
- job shop scheduling problem
- genetic algorithm
- hybrid metaheuristic
- search heuristics
- max sat
- vehicle routing problem with time windows
- tabu search algorithm
- mathematical programming
- scatter search
- neighborhood search
- linear programming
- benchmark problems
- traveling salesman problem
- shortest path
- multi start
- optimal solution