Solution Search for the Capacitated P-Median Problem using Tabu Search.
Mauricio Romero MontoyaRogelio González VelázquezMartín Estrada AnalcoJosé Luis Martínez FloresMaría Beatríz Bernábe LorancaPublished in: Int. J. Comb. Optim. Probl. Informatics (2019)
Keyphrases
- tabu search
- search procedure
- vehicle routing problem
- variable neighborhood search
- search algorithm
- metaheuristic
- simulated annealing
- solution space
- initial solution
- search strategy
- candidate list
- feasible solution
- quadratic assignment problem
- path relinking
- tabu list
- iterated local search
- tabu search algorithm
- neighborhood search
- hybrid algorithm
- search space
- routing problem
- scheduling problem
- memetic algorithm
- hill climbing
- genetic algorithm
- test problems
- search heuristics
- job shop scheduling problem
- heuristic methods
- search methods
- multi start
- search procedures
- multidimensional knapsack problem
- optimization problems
- benchmark instances
- optimal solution
- np hard
- vehicle routing problem with time windows
- scatter search
- max sat
- benchmark problems
- branch and bound
- flowshop
- ant colony optimization
- particle swarm optimization
- lagrangian relaxation
- integer programming
- sat solvers
- evolutionary algorithm
- combinatorial optimization problems