The parallel variable neighborhood search for the p-median problem

The parallel variable neighborhood search for the p-median problem

0.00 Avg rating0 Votes
Article ID: iaor20023409
Country: Netherlands
Volume: 8
Issue: 3
Start Page Number: 375
End Page Number: 388
Publication Date: May 2002
Journal: Journal of Heuristics
Authors: , , ,
Keywords: -median problem
Abstract:

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 and coded in C using OpenMP. They are compared in a shared memory machine with large instances.

Reviews

Required fields are marked *. Your email address will not be published.