The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approaches

Abstract The continuous capacitated single-source multi-facility Weber problem with the presence of facility fixed cost is investigated. A new mathematical model which incorporates multi-level type capacity (or design) and facility fixed cost that is capacity-based and zone-dependent is introduced. As no data set exists for this new location problem, a new data set based on convex polygons using triangular shape is constructed. A generalised two stage heuristic scheme that combines the concept of aggregation, an exact method, and an enhanced Cooper's alternate location–allocation method is put forward. A framework that embeds Variable Neighbourhood Search is also proposed. Computational experiments show that these matheuristics produce encouraging results for this class of location problems. The proposed approaches are also easily adapted to cater for a recently studied variant namely the single-source capacitated multi-facility Weber problem where they outperform those recently published solution methods.

[1]  C. M. Shetty,et al.  The rectilinear distance location-allocation problem , 1977 .

[2]  Zvi Drezner,et al.  Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\ , 2015, Journal of Heuristics.

[3]  Isabel Correia,et al.  Bounds for the single source modular capacitated plant location problem , 2006, Comput. Oper. Res..

[4]  Saïd Salhi,et al.  Local improvement in planar facility location using vehicle routing , 2009, Ann. Oper. Res..

[5]  I. Kuban Altinel,et al.  Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem , 2008, J. Oper. Res. Soc..

[6]  Temel Öncan,et al.  Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem , 2014, Ann. Oper. Res..

[7]  Pierre Hansen,et al.  Heuristic solution of the multisource Weber problem as a p-median problem , 1996, Oper. Res. Lett..

[8]  Zvi Drezner,et al.  A new local search for continuous location problems , 2014, Eur. J. Oper. Res..

[9]  Sin C. Ho An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem , 2015, Appl. Soft Comput..

[10]  Maria Grazia Speranza,et al.  A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem , 2014, Eur. J. Oper. Res..

[11]  Saïd Salhi,et al.  A Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost , 2015, Comput. Ind. Eng..

[12]  Saïd Salhi,et al.  A cellular heuristic for the multisource Weber problem , 2003, Comput. Oper. Res..

[13]  M. Shirosaki Another proof of the defect relation for moving targets , 1991 .

[14]  Hanif D. Sherali,et al.  NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands , 1988, Math. Oper. Res..

[15]  I. K. Altinel,et al.  New heuristic methods for the capacitated multi‐facility Weber problem , 2007 .

[16]  Saïd Salhi,et al.  A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost , 2005, Ann. Oper. Res..

[17]  S. M. H. Manzour-al-Ajdad,et al.  Single-Source Capacitated Multi-Facility Weber Problem - An iterative two phase heuristic algorithm , 2012, Comput. Oper. Res..

[18]  Blas Pelegrín,et al.  Algorithms for the decomposition of a polygon into convex polygons , 2000, Eur. J. Oper. Res..

[19]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..

[20]  José Fernández,et al.  A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand , 2013, J. Glob. Optim..

[21]  Zvi Drezner,et al.  A multi-objective heuristic approach for the casualty collection points location problem , 2006, J. Oper. Res. Soc..

[22]  Sad Salhi,et al.  Heuristic Search: The Emerging Science of Problem Solving , 2017 .

[23]  Mir Saman Pishvaee,et al.  New heuristic methods for the single-source capacitated multi facility Weber problem , 2013 .

[24]  Said Salhi,et al.  The effect of ignoring routes when locating depots , 1989 .

[25]  Mitsuo Gen,et al.  Hybrid evolutionary method for capacitated location-allocation problem , 1997 .

[26]  Isabel Correia,et al.  A Lagrangean Heuristic for a Modular Capacitated Location Problem , 2003, Ann. Oper. Res..

[27]  Saïd Salhi,et al.  Region-rejection based heuristics for the capacitated multi-source Weber problem , 2009, Comput. Oper. Res..

[28]  Jesús Fernández-Villaverde,et al.  A Comparison of Programming Languages in Economics , 2014 .

[29]  Tatiana Romanova,et al.  WITHDRAWN: Mathematical model and efficient algorithms for object packing problem , 2009 .

[30]  Chandra Ade Irawan,et al.  Solving large $$p$$p-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search , 2015, J. Glob. Optim..

[31]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[32]  Mohammad Reza Malek,et al.  A new GA based solution for capacitated multi source Weber problem , 2010, Int. J. Comput. Intell. Syst..

[33]  S. Salhi,et al.  AGGREGATION AND NON AGGREGATION TECHNIQUES FOR LARGE FACILITY LOCATION PROBLEMS - A SURVEY , 2015 .

[34]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[35]  S. A. MirHassani,et al.  A hybrid Firefly-Genetic Algorithm for the capacitated facility location problem , 2014, Inf. Sci..

[36]  Said Salhi,et al.  A Constructive Method and a Guided Hybrid GRASP for the Capacitated Multi-Source Weber Problem in the Presence of Fixed Cost , 2015 .

[37]  Hanif D. Sherali,et al.  Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems , 2002, Oper. Res..

[38]  W. G. Lesso,et al.  Models for the Minimum Cost Development of Offshore Oil Fields , 1972 .

[39]  Reza Zanjirani Farahani,et al.  Hierarchical facility location problem: Models, classifications, techniques, and applications , 2014, Comput. Ind. Eng..

[40]  J Brimberg,et al.  The multi-source Weber problem with constant opening cost , 2004, J. Oper. Res. Soc..

[41]  Temel Öncan Heuristics for the single source capacitated multi-facility Weber problem , 2013, Comput. Ind. Eng..

[42]  Jayaram K. Sankaran,et al.  On solving large instances of the capacitated facility location problem , 2007, Eur. J. Oper. Res..

[43]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[44]  K. Rosing The Optimal Location of Steam Generators in Large Heavy Oil Fields , 1992 .

[45]  Hanif D. Sherali,et al.  A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem , 1994, Discret. Appl. Math..

[46]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..

[47]  Saïd Salhi,et al.  A guided reactive GRASP for the capacitated multi-source Weber problem , 2011, Comput. Oper. Res..

[48]  L. Cooper Location-Allocation Problems , 1963 .

[49]  Mauricio G. C. Resende,et al.  A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..

[50]  Hanif D. Sherali,et al.  A squared-euclidean distance location-allocation problem , 1992 .

[51]  P. Hansen,et al.  A Survey of Solution Methods for the Continuous Location-Allocation Problem , 2007 .

[52]  Said Salhi,et al.  An Intergrated Heuristic Approach for the Combined Location Vehicle Fleet Mix Problem , 1996 .

[53]  Saïd Salhi,et al.  A perturbation-based heuristic for the capacitated multisource Weber problem , 2007, Eur. J. Oper. Res..

[54]  I. Kuban Altinel,et al.  Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms , 2007, Metaheuristics.

[55]  Pierre Hansen,et al.  Variable Neighborhood Search : Methods and Applications , 2008 .

[56]  Chandra Ade Irawan,et al.  An adaptive multiphase approach for large unconditional and conditional p-median problems , 2014, Eur. J. Oper. Res..