The Parallel Variable Neighborhood Search for the p-Median Problem

  title={The Parallel Variable Neighborhood Search for the p-Median Problem},
  author={F. Garc{\'i}a-L{\'o}pez and B. Meli{\'a}n-Batista and J. Moreno-P{\'e}rez and J. M. Moreno-Vega},
  journal={Journal of Heuristics},
  • F. García-López, B. Melián-Batista, +1 author J. M. Moreno-Vega
  • Published 2002
  • Mathematics, Computer Science
  • Journal of Heuristics
  • The Variable Neighborhood Search (VNS) is a recent metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. When a local minimum is reached, a shake procedure performs a random search. This determines a new starting point for running an improving search. The use of interchange moves provides a simple implementation of the VNS algorithm for the p-Median Problem. Several strategies for the parallelization of the VNS are considered… CONTINUE READING
    124 Citations
    Parallel Variable Neighborhood Search
    • 24
    • Highly Influenced
    • PDF
    Cooperative Parallel Variable Neighborhood Search for the p-Median
    • 161
    • Highly Influenced
    • PDF
    Variable neighborhood search: basics and variants
    • 109
    Variable neighbourhood search: methods and applications
    • 466
    • PDF


    Variable Neighborhood Decomposition Search
    • 295
    • PDF
    An Introduction to Variable Neighborhood Search
    • 371
    • Highly Influential
    Variable neighborhood search
    • 2,935
    • PDF
    A note on solving large p-median problems
    • 163
    Tabu Search - Part I
    • 3,661
    • PDF
    Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
    • 754
    An Algorithmic Approach to Network Location Problems. II: The p-Medians
    • 1,194
    • PDF
    Tabu Search - Part II
    • F. Glover
    • Mathematics, Computer Science
    • INFORMS J. Comput.
    • 1990
    • 5,489
    • PDF