Less is more: Basic variable neighborhood search for minimum differential dispersion problem.
Nenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Inf. Sci. (2016)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- minimum spanning tree
- vehicle routing problem
- routing problem
- hybrid method
- search procedure
- benchmark instances
- single machine scheduling problem
- spanning tree
- path relinking
- ant colony optimization
- optimization problems
- complex networks
- feasible solution
- search strategies
- lower bound
- minimum cost
- shortest path
- np hard
- search space