Using global search heuristics for the capacity vehicle routing problem.
Patricio RodríguezMiguel NussbaumRodrigo BaezaGerardo LeónMarcos SepúlvedaAgustín CobiánPublished in: Comput. Oper. Res. (1998)
Keyphrases
- vehicle routing problem
- global search
- particle swarm optimization
- search algorithm
- simulated annealing
- tabu search
- metaheuristic
- benchmark problems
- convergence speed
- global optimization
- routing problem
- search strategies
- particle swarm optimization algorithm
- genetic algorithm
- test instances
- combinatorial optimization
- vehicle routing problem with time windows
- vehicle routing
- hyper heuristics
- hybrid metaheuristic
- search space
- heuristic methods
- search methods
- memetic algorithm
- travel time
- traveling salesman problem
- heuristic search
- pso algorithm
- multi depot
- hybrid algorithm
- multi objective
- evolution strategy
- feasible solution
- exhaustive search
- evolutionary algorithm
- ant colony optimization
- particle swarm optimization pso
- branch and bound
- search strategy
- np hard
- search procedure
- exact algorithms
- scatter search
- swarm intelligence
- vehicle routing problem with simultaneous