Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia.
Rafael CaballeroMercedes GonzálezFlor M. GuerreroJulián Molina LuqueConcepción ParaleraPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- tabu search
- metaheuristic
- vehicle routing problem
- multi objective
- simulated annealing
- combinatorial optimization
- path relinking
- iterated local search
- ant colony optimization
- optimization problems
- scatter search
- genetic algorithm
- search space
- particle swarm optimization
- combinatorial optimization problems
- memetic algorithm
- feasible solution
- evolutionary algorithm
- benchmark instances
- optimal solution
- hybrid algorithm
- search heuristics
- scheduling problem
- search procedure
- hybrid metaheuristic
- heuristic methods
- multi start
- search algorithm
- mip solver
- combinatorial problems
- benchmark problems
- solution space
- variable neighborhood search
- job shop scheduling problem
- timetabling problem
- quadratic assignment problem
- routing problem
- nsga ii
- test problems
- optimization algorithm