Variable neighborhood search variants for Min-power symmetric connectivity problem.
Adil I. ErzinNenad MladenovicRoman V. PlotnikovPublished in: Comput. Oper. Res. (2017)
Keyphrases
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- tabu search
- heuristic methods
- minimum spanning tree
- vehicle routing problem
- hybrid method
- routing problem
- optimization problems
- path relinking
- search procedure
- single machine scheduling problem
- cost function
- simulated annealing
- evolutionary algorithm
- benchmark instances
- scatter search
- search space
- special case
- objective function
- ant colony optimization
- multi objective