Abstract
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.
Supported by British Telecommunications plc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ankrah, R., Regnier-Coudert, O., McCall, J., Conway, A., Hardwick, A.: Performance analysis of GA and PBIL variants for real-world location-allocation problems (2018)
Brimberg, J., Mladenovic, N.: Solving the continuous location-allocation problem with tabu search. Stud. Locat. Anal. 8(23–32), 41 (1996)
Brimberg, J., Hansen, P., Mladenović, N., Taillard, E.D.: Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper. Res. 48(3), 444–460 (2000)
Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-7908-2151-2
Mavani, K., Shah, M.: Synthesis of silver nanoparticles by using sodium borohydride as a reducing agent. Int. J. Eng. Res. Technol. 2(3) (2013)
Mousavi, S.M., Niaki, S.T.A., Mehdizadeh, E., Tavarroth, M.R.: The capacitated multi-facility location-allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms. Int. J. Syst. Sci. 44(10), 1897–1912 (2013)
Murray, A.T., Church, R.L.: Applying simulated annealing to location-planning models. J. Heuristics 2(1), 31–53 (1996)
de Oliveira, R.M., Mauri, G.R., Lorena, L.A.N.: Clustering search for the berth allocation problem. Expert Syst. Appl. 39(5), 5499–5505 (2012)
Saeidian, B., Mesgari, M.S., Ghodousi, M.: Evaluation and comparison of genetic algorithm and bees algorithm for location-allocation of earthquake relief centers. Int. J. Disaster Risk Reduct. 15, 94–107 (2016)
Shankar, B.L., Basavarajappa, S., Chen, J.C., Kadadevaramath, R.S.: Location and allocation decisions for multi-echelon supply chain network-a multi-objective evolutionary approach. Expert Syst. Appl. 40(2), 551–562 (2013)
Tohyama, H., Ida, K., Matsueda, J.: A genetic algorithm for the uncapacitated facility location problem. Electron. Commun. Jpn. 94(5), 47–54 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ankrah, R., Lacroix, B., McCall, J., Hardwick, A., Conway, A. (2018). A Holistic Metric Approach to Solving the Dynamic Location-Allocation Problem. In: Bramer, M., Petridis, M. (eds) Artificial Intelligence XXXV. SGAI 2018. Lecture Notes in Computer Science(), vol 11311. Springer, Cham. https://doi.org/10.1007/978-3-030-04191-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-04191-5_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04190-8
Online ISBN: 978-3-030-04191-5
eBook Packages: Computer ScienceComputer Science (R0)