A Computer Based Mathematical Formulation of Location Problem In Distributed Service Network

Author(s)

Suchita Gupta , Arun Pratap Singh ,

Download Full PDF Pages: 22-26 | Views: 1306 | Downloads: 358 | DOI: 10.5281/zenodo.3472268

Volume 6 - July 2017 (07)

Abstract

Distributed Service Network is a wide term related to distribution and travelling i.e. distribution of resource among facilities located at various locations and travelling of resource along a distributed network. Policy making problems in distributed service networks can be clearly classified into a number of hierarchical levels. The levels are distinguished by time horizon of the problem, by amount of cost involved in the implementation of a solution, and by the political implications of the solution. In the public sector, it includes ambulance, fire, police and other services. In the private sector courier, taxi, repair, maintenance and the like are considered to be distributed service network.This paper considers a location problem in Distributed Service Network. The location problem aims to determining the number, the position and the mission of required distribution centers with in the populated region. The main objective to minimizes the total transportation duration from the distribution centers to demand points. The result obtained in our experimental study show that the computing time required by the proposed method may be large for some instances.

Keywords

Emergency response, location problems, p – median.

References

Shermin Sultana , Asma Enayet and Ishrat Jahan Mouri(2015), “Location Based Time and Attendance Tracking system using Android Application”, International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 5,No.1, February 2015 DOI : 10.5121/ijcseit.2015.5101

Kumbhar, A. A., Wanjara, K. S., Trivedi, D. H., Khairatkar, A. U., & Sharma, D. (2014). “Automated Attendance Monitoring System using Android Platform.”, International Journal of Current Engineering and Technology, Vol. 4, No. 2, pp1096-1099.

Shoewu, O. and O.A. Idowu (2012), “Development of Attendance Management System using Biometrics”, Pacific Journal of Science and Technology, 13(1):300-307.

Kadry, S., & Smaili, M. (2013). ”Wireless attendance management system based on iris recognition”, Scientific Research and essays, 5(12), 1428-1435.

Andersson, T., and V¨arbrand, P. 2007. Decision support tools for ambulance dispatch and relocation. Journal of the Operational Research Society 58:195–201.

Rajagopalan, H. K.; Saydam, C.; and Xiao, J. 2008. A multiperiod set covering location model for dynamic redeployment of ambulances. Comput. Oper. Res. 35(3):814–826.

Brotcorne, L.; Laporte, G. & Semet, F. (2003). Ambulance location and relocation models. European Journal of Operational Research, 147, 451-463.

 Boffey, B.; Yates, D. & Galvão, R.D. (2003). An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro. Journal of the Operational Research Society, 54,21-31.

Bornstein, C.T.; Pereira, A.B.; Galvão, R.D. & Campêlo Neto, M.B. (2004). An algorithm for the simple plant location problem based on reduction tests and add/drop heuristics. Submitted to the Journal of Heuristics.

Brotcorne, L.; Laporte, G. & Semet, F. (2003). Ambulance location and relocation models. European Journal of Operational Research, 147, 451-463.

Chiyoshi, F.Y. & Galvão, R.D. (2000). A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research, 96, 61-74.

Chiyoshi, F.Y.; Galvão, R.D. & Morabito, R. (2003). A note on solutions to the maximal expected covering location problem. Computers & Operations Research, 30,87-96.

Espejo, L.G.A. & Galvão, R.D. (2002). O uso das relaxações Lagrangeana e surrogate em problemas de programação inteira (The use of Lagrangean and surrogate relaxations in integer programming problems). Pesquisa Operacional, 22, 387-402.

Espejo, L.G.A.; Galvão, R.D. & Boffey, B. (2003). Dual-based heuristics for a hierarchical covering location problem. Computers & Operations Research, 30,165-180.

Galvão, R.D.; Espejo, L.G.A. & Boffey, B. (2002). A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro. European Journal of Operational Research, 138, 495-517.

Galvão, R.D.; Espejo, L.G.A.; Boffey, B. & Yates, D. (2004). Load balancing and capacity constraints in a hierarchical location model. Submitted to the European Journal of Operational Research.

Galvão, R.D.; Chiyoshi, F.Y. & Morabito, R. (2003). Towards unified formulations and extensions of two classical probabilistic location models. To appear in Computers & Operations Research.

Galvão, R.D.; Chiyoshi, F.Y.; Espejo, L.G.A. & Rivas M.P.A. (2003). Solução do problema de localização de máxima disponibilidade utilizando o modelo hipercubo (Solution of the maximum availability location problem using the hypercube model). Pesquisa Operacional, 23, 61-78

Cite this Article: