Variable neighborhood search for solving bandwidth coloring problem.
Dragan MaticJozef KraticaVladimir FilipovicPublished in: Comput. Sci. Inf. Syst. (2017)
Keyphrases
- variable neighborhood search
- metaheuristic
- heuristic methods
- tabu search
- traveling salesman problem
- hybrid method
- combinatorial optimization
- vehicle routing problem
- minimum spanning tree
- benchmark instances
- single machine scheduling problem
- neural network
- routing problem
- path relinking
- dynamic programming
- combinatorial optimization problems
- optimization problems