A parallel cooperative hybridization approach to the p-median problem
The p -median problem is difficult to solve and many heuristic methods have been developed. This paper discusses a new hybridization approach in which existing heuristics are used as ʻexperts’ in a problem-solving team where they cooperate by sharing their solutions with each other. This approach is demonstrated using two heuristics called the ʻvertex substitution method’ and ʻsimulated annealing’. Five cooperation strategies are designed and implemented using an application program interface for parallel programming. Computational experiments show that the strategy named ʻparallel consensus’ can significantly improve the quality of solutions found when compared with the original heuristics. The results also show significant speedups of the program in a multicore parallel computing environment. Keywords: p -median problem, cooperative hybrid heuristics, parallel computing, vertex substitution, simulated annealing, OpenMP
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:pio:envirb:v:39:y:2012:i:4:p:755-774. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.