Variable Neighborhood Search for Google Machine Reassignment problem.
Haris GavranovicMirsad BuljubasicEmir DemirovicPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- minimum spanning tree
- heuristic methods
- hybrid method
- routing problem
- benchmark instances
- vehicle routing problem
- single machine scheduling problem
- path relinking
- simulated annealing
- flowshop
- search space
- ant colony optimization
- optimization problems
- scheduling problem
- query processing
- evolutionary algorithm