Variable Neighborhood Decomposition Search

@article{Hansen2001VariableND,
  title={Variable Neighborhood Decomposition Search},
  author={P. Hansen and N. Mladenovic and D. P{\'e}rez-Brito},
  journal={Journal of Heuristics},
  year={2001},
  volume={7},
  pages={335-350}
}
  • P. Hansen, N. Mladenovic, D. Pérez-Brito
  • Published 2001
  • Mathematics, Computer Science
  • Journal of Heuristics
  • The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on the p-median problem. Results on 1400, 3038 and 5934 node instances from the TSP library show VNDS… CONTINUE READING
    295 Citations

    Figures, Tables, and Topics from this paper

    A Tutorial on Variable Neighborhood Search
    • 85
    • PDF
    Chapter 8 VARIABLE NEIGHBORHOOD SEARCH
    • PDF
    Parallel Variable Neighborhood Search
    • 24
    • PDF
    Parallel Variable Neighborhood Searches
    • 2
    • PDF
    Variable neighborhood search: Principles and applications
    • 1,690
    Variable neighbourhood search: methods and applications
    • 466
    • PDF
    Variable Neighborhood Descent applied to Multi-way Number Partitioning Problem
    • 2
    Variable neighborhood search: basics and variants
    • 109

    References

    SHOWING 1-10 OF 46 REFERENCES
    Variable neighborhood search
    • 2,935
    • PDF
    Heuristic concentration and Tabu search: A head to head comparison
    • 66
    A new adaptive multi-start technique for combinatorial global optimizations
    • 390
    • PDF
    An efficient tabu search procedure for the p-Median Problem
    • 241
    A more efficient heuristic for solving largep-median problems
    • 115
    An Introduction to Variable Neighborhood Search
    • 371
    Fast primal and dual heuristics for the p-median location problem
    • 36
    Tabu Search - Part I
    • 3,661
    • PDF