Parallelization of the scatter search for the p-median problem

This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration. The procedures have been coded in C using OpenMP and compared in a shared memory machine with large instances. The obtained algorithms are tested on the p-median problem.

[1]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/Surrogate Heuristics for p-Median Problems , 2000 .

[6]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[7]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[8]  Alan P. Sprague,et al.  Performance of parallel branch-and-bound algorithms , 1985, IEEE Transactions on Computers.

[9]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[10]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

[11]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[12]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[13]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[15]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[16]  Mauricio G. C. Resende,et al.  On the implementation of a swap-based local search procedure for the p -median problem ∗ , 2002 .

[17]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[18]  Robert E. Markland,et al.  Theory and Application of an Optimizing Procedure for Lock Box Location Analysis , 1981 .

[19]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[20]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[21]  Maria Zrikem,et al.  Variable neighborhood decomposition search for the optimization of power plant cable layout , 2002, J. Intell. Manuf..

[22]  M. J. Hodgson.  Toward More Realistic Allocation in Location—Allocation Models: An Interaction Approach , 1978 .

[23]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[24]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[25]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

[26]  Kenneth E. Rosing,et al.  An Empirical Investigation of the Effectiveness of a Vertex Substitution Heuristic , 1997 .

[27]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[28]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[29]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[30]  K. E. Rosing,et al.  The p-Median and its Linear Programming Relaxation: An Approach to Large Problems , 1979 .

[31]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[32]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[33]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[34]  José Luis González Velarde,et al.  Computing Tools for Modeling, Optimization and Simulation , 2000 .

[35]  J. Beasley.  A note on solving large p-median problems , 1985 .

[36]  J. M. Moreno-Vega,et al.  THE CHAIN-INTERCHANGE HEURISTIC METHOD1 , 1996 .

[37]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

[38]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[39]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[40]  Francesco E. Maranzana,et al.  On the Location of Supply Points to Minimize Transportation Costs , 1963, IBM Syst. J..

[41]  L. A. Lorena,et al.  Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems , 2003 .

[42]  Mats Brorsson,et al.  OdinMP/CCp—a portable implementation of OpenMP for C , 2000 .

[43]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[44]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .