LOCATION OF ADDITIONAL LIBRARY FACILITY IN BEREKUM MUNICIPALITY USING BERMAN AND DREZNER ALGORITHM
DOI:
https://doi.org/10.47604/jsar.1332Keywords:
Algorithm, p-centre, location problem, library facility, Berman and DreznerAbstract
Purpose: To model location of an additional library facility in the Berekum Municipality as a conditional p-center problem which will serve as a reference centre for Schools and Colleges within the municipality
Methodology: The data for this study was the road distance between the suburbs of Berekum Municipality. The suburbs of the municipality were coded and Floyd’s algorithm was used to find the distance matrix, d (i, j) for all pairs shortest path. Subsequently, the Researchers used Berman and Drezner’s algorithm on 18-nodes network which had two existing library facilities in Berekum and Jininjini to locate additional Library facility for Library users in Berekum Municipality.
Matlab program software was used for the coding of the Floyd-Warshall algorithm. The codes for Floyd-Warshall algorithm was developed and ran on DellAMD Athlon (tm) II P360 Dual-Core Processor 2.30GHz of RAM 3.00GB, 64-bit Operating System with Windows Ultimate Laptop Computer
Results: The analysis of the study revealed that, an additional library facility using Berman and Drezner (2008) should be located at Akrofro with an objective function value of 8. The results obtained from the study is useful to locate a public library facility that will benefit all the people in Berekum municipality. Specifically, the results revealed the new public library facility to be built in Berekum Municipality should be sited at Akrofro.
Unique contribution to theory, practice and policy: The implication of the results is that the minimum distance travelled by the farthest library user to the new library facility at Akrofro is 8 kilometres. Stakeholders should adopt the use of Berman and Drezner’s algorithms in establishing facilities such as markets, hospitals, recreational centres and so on
Downloads
References
Abbas, K. D. (2012). The Need for Effective Information Resources Provision and Utilization in Nigerian University Libraries: A Case Study of Two Nigerian Premier Universities,. IPCSIT, 45, 239-245.
Anyabilla, S. A. (2014, 10 15). A conditional p-centre problem of three warehouses for unilever ghana limited. Retrieved from http://ir.knust.edu.gh/xmlui/handle/123456789/6597
Berman, O., & Drezner, Z. (2008). A New Formulation of the Conditional p-median and p-centre Problems. Operation Research Letters, 36, 481-483.
Berman, O., & Simchi-Levi, D. (2011). Conditional Location Problems on Networks. Transportation Science, 24(1), 77-78.
Captivo, M., Climaco, J., & Fernandes, S. (2008). A Bicriteria DSS dedicated to Location Problems, Encyclopedia of decision making and decision support technologies,(Eds), Information Science Reference. New York: I.F Adam & P.Humphreys.
Chen, D., & Chen, R. (2009). New relaxation-based algorithms for the optimal solution of the continuous and discrete p-cetre problems. Computers and Operations Research, 36(5), 1646-1655.
Chung- Kung, Y. W., & Chein-Tsai, C. (2006). The p-centre Problem with Connectivity Constraint. Applied Mathematical Sciences, 1( 27),1311 – 1324.
Elloumi, S., Martine, L., & Yves, P. ( 2004). A New Formulation and Resolution Method for the p-Centre Problem. Informs Journal of Computing, 16(1), 84 – 94.
Garey, M., & Johnson, S. (1979). Computers and Intractability : A guide to the Theory of NP-Completeness. New York, NY: W.H. Freman & Co.
Halperin, E., Kortsarz, G., & Krauthgamer, R. (2003). Tight lower bounds for the asymmetric k-centre problems. Philadelphia, PA, USA: Electronic Colloquium on Computational Complexity.
Hassin, R., Monnot, J., & Segev, D. (2007). Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization, 14(40), 437-453.
Krumke, S. O. (1995). On a Generalization of the p-centreproblem. Information Processing Letters, 56 (2, 7),67-71(5).
Kwarteng, S. (2012). Optimal location of a hospital facility. Retrieved from https:///C:/Users/ACADEMICS%202/Downloads/KWARTENG%20SARAH%20THESIS%202011(5).pdf
Minieka, E. (2006). Conditional centres and mediands on a graph. Networks 10, 265-272.
Obinyan, G. A., Obinyan, O. O., & Aidenojie, E. ( Use of Information Resources in Four Branches of a State Public Library in Nigeria, Chinese Librarianship: ). 2011. An International Electronic Journal, 31, 1-16.
Obinyan, G. A., Obinyan, O. O., & Aidenojie, E. (2011). Use of Information Resources in Four Branches of a State Public Library in Nigeria. Chinese Librarianship: An International Electronic Journal, 31, 1-16.
Ogbah, E. L. (2014). Assessment of Information Provision Services of Libraries in the 21st Century in Some Selected Academic Libraries in Delta State. International Journal of Information and Communication Technology Education, 10 (1), 97-101.
Panigrahy, R., & Vishwanathan, S. (1998). An O (log*n) Approximation Algorithm for the Asymmetric p-centre Problem. Journal of Algorithms, 27(2), 259-268.
Parvathamma, N., & Reddy, S. (2009). Use of information resources and services in public libraries: A case of Bidar District, Karnataka State, India. Annals of library and information studies, 56, 249-254.
Tamir, A., Puerto, J., Mesa, J. A., & Rodriguez-Chia, A. M. (2005). Conditional Location of Path and Tree Shaped Facilities on Trees. Tel-Aviv: Tel-Aviv Univerity Press.
UNESCO. (1994, January 25). Retrieved from Public Library Manifesto: http://www.ifla.org/documents/libraries/policies/unesco.htm.
Wouter, J., Koster, H., & Hall, P. (2011). The Location and Global Network Structure of Maritime Advanced Producer Services. Urban Studies Journal Limited, 48(13), 2749-2769.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Emmanuel Teku, Prince Kusi, Eric Appiah-Twumasi, Professor K. F. Darkwah
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution (CC-BY) 4.0 License that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal.
