Parallel Variable Neighborhood Search

Variable Neighborhood Search (VNS) is a recent and efiective metaheuristic for solving combinatorial and global optimization problems. It is capable of escaping from the local optima by systematic changes of the neighborhood structures within the search. In this paper several parallelization strategies for VNS have been proposed and compared on the large instances of the p-median problem. ⁄ The research of this author has been partially supported by the Spanish Ministry of Science and Technology through the project TIC2002-04242-C03-01; 70% of which are FEDER founds.

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

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

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

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

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

[6]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

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

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

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

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

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

[12]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

[13]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[14]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[15]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

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

[17]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

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

[20]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

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

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

[23]  Pierre Hansen,et al.  Variable Neighborhood Search: A Chapter of Handbook of Applied Optimization , 2000 .

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

[25]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

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

[27]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[28]  Michel Gendreau,et al.  Cooperative Parallel Tabu Search for Capacitated Network Design , 2002, J. Heuristics.

[29]  P. Hansen,et al.  Developments of Variable Neighborhood Search , 2002 .

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

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

[32]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[33]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

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