A general framework for nested variable neighborhood search.
Jack BrimbergNenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- neighborhood search
- traveling salesman problem
- heuristic methods
- routing problem
- hybrid method
- minimum spanning tree
- single machine scheduling problem
- vehicle routing problem
- benchmark instances
- path relinking
- simulated annealing
- search procedure
- neural network
- optimization problems
- combinatorial optimization
- processing times
- memetic algorithm
- feasible solution
- optimal solution
- genetic algorithm