A Holistic Metric Approach to Solving the Dynamic Location-Allocation Problem

In this paper, we introduce a dynamic variant of the Location-Allocation problem: Dynamic Location-Allocation Problem (DULAP). DULAP involves the location of facilities to service a set of customer demands over a defined horizon. To evaluate a solution to DULAP, we propose two holistic metric approaches: Static and Dynamic Approach. In the static approach, a solution is evaluated with the assumption that customer locations and demand remain constant over a defined horizon. In the dynamic approach, the assumption is made that customer demand, and demographic pattern may change over the defined horizon. We introduce a stochastic model to simulate customer population and distribution over time. We use a Genetic Algorithm and Population-Based Incremental Learning algorithm used in previous work to find robust and satisfactory solutions to DULAP. Results show the dynamic approach of evaluating a solution finds good and robust solutions.

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

[2]  Jason C. H. Chen,et al.  Location and allocation decisions for multi-echelon supply chain network - A multi-objective evolutionary approach , 2013, Expert Syst. Appl..

[3]  John A. W. McCall,et al.  Performance Analysis of GA and PBIL Variants for Real-World Location-Allocation Problems , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[4]  Franziska Abend,et al.  Facility Location Concepts Models Algorithms And Case Studies , 2016 .

[5]  Kandarp Mavani,et al.  Synthesis of Silver Nanoparticles by using Sodium Borohydride as a Reducing Agent , 2013 .

[6]  Mohammad Saadi Mesgari,et al.  Evaluation and comparison of Genetic Algorithm and Bees Algorithm for location–allocation of earthquake relief centers , 2016 .

[7]  Luiz Antonio Nogueira Lorena,et al.  Clustering Search for the Berth Allocation Problem , 2012, Expert Syst. Appl..

[8]  Seyed Taghi Akhavan Niaki,et al.  The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms , 2013, Int. J. Syst. Sci..

[9]  Richard L. Church,et al.  Applying simulated annealing to location-planning models , 1996, J. Heuristics.

[10]  Nenad Mladenović,et al.  SOLVING THE CONTINUOUS LOCATION-ALLOCATION PROBLEM WITH TABU SEARCH , 1996 .

[11]  Kenichi Ida,et al.  A genetic algorithm for the uncapacitated facility location problem , 2011 .