Solving the p-Center problem with Tabu Search and Variable Neighborhood Search.
Nenad MladenovicMartine LabbéPierre HansenPublished in: Networks (2003)
Keyphrases
- tabu search
- variable neighborhood search
- metaheuristic
- path relinking
- simulated annealing
- neighborhood search
- heuristic methods
- memetic algorithm
- feasible solution
- benchmark instances
- combinatorial optimization
- vehicle routing problem
- scheduling problem
- test problems
- hybrid algorithm
- search procedure
- job shop scheduling problem
- traveling salesman problem
- scatter search
- search algorithm
- genetic algorithm
- hill climbing
- search space
- hybrid metaheuristic
- routing problem
- hybrid method
- single machine scheduling problem
- flowshop
- combinatorial problems
- minimum spanning tree
- ant colony optimization
- particle swarm optimization
- optimization problems