A Comparative Study of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem.
María Beatríz Bernábe LorancaJosé E. Espinosa RosalesMaría Auxilio Osorio LamaJavier Ramírez RodríguezRicardo García AcevesPublished in: DMIN (2009)
Keyphrases
- variable neighborhood search
- simulated annealing
- tabu search
- metaheuristic
- neighborhood search
- search procedure
- benchmark instances
- clustering method
- path relinking
- hybrid algorithm
- genetic algorithm
- heuristic methods
- combinatorial optimization
- traveling salesman problem
- feasible solution
- ant colony optimization
- benchmark problems
- combinatorial optimization problems
- hybrid method
- vehicle routing problem
- job shop scheduling problem
- optimization problems
- minimum spanning tree
- scheduling problem
- hill climbing
- evolutionary algorithm
- neural network
- genetic algorithm ga
- knapsack problem
- evolutionary computation
- combinatorial problems
- optimal solution