Cooperative parallel variable neighborhood search for the p-median

Cooperative parallel variable neighborhood search for the p-median

0.00 Avg rating0 Votes
Article ID: iaor20043462
Country: Netherlands
Volume: 10
Issue: 3
Start Page Number: 293
End Page Number: 314
Publication Date: May 2004
Journal: Journal of Heuristics
Authors: , , ,
Keywords: heuristics
Abstract:

We propose a cooperative multi-search method for the Variable Neighborhood Search (VNS) meta-heuristic based on the central-memory mechanism that has been successfully applied to a number of difficult combinatorial problems. In this approach, several independent VNS meta-heuristics cooperate by asynchronously exchanging information about the best solutions identified so far, thus conserving the simplicity of the original, sequential VNS ideas. The p-median problem (PM) serves as a test case. Extensive experimentations have been conducted on the classical TSPLIB benchmark problem instances with up to 11948 customers and 1000 medians, without any particular calibration of the parallel method. The results indicate that, compared to sequential VNS, the cooperative strategy yields significant gains in terms of computation time without a loss in solution quality.

Reviews

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