Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering.
Leandro Rincon CostaDaniel AloiseNenad MladenovicPublished in: Inf. Sci. (2017)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- heuristic methods
- neighborhood search
- traveling salesman problem
- benchmark instances
- routing problem
- minimum spanning tree
- hybrid method
- search procedure
- single machine scheduling problem
- vehicle routing problem
- simulated annealing
- path relinking
- search space
- optimal solution
- exact algorithms
- ant colony optimization
- scheduling problem
- lower bound
- neural network
- limited discrepancy search
- combinatorial problems
- memetic algorithm
- combinatorial optimization
- evolutionary computation
- shortest path
- particle swarm optimization
- search algorithm
- genetic algorithm