Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29414


Select areas to restrict search in scientific publication database:
13245
Framework of TAZ_OPT Model for Ambulance Location and Allocation Problem
Abstract:
Our study is concerned with the development of an Emergency Medical Services (EMS) ambulance location and allocation model called the Time-based Ambulance Zoning Optimization Model (TAZ_OPT). This paper presents the framework of the study. The model is formulated using the goal programming (GP), where the goals are to determine the satellite locations of ambulances and the number of ambulances to be allocated at these locations. The model aims at maximizing the expected demand coverage based on probability of reaching the emergency location within targetted time, and minimizing the ambulance busyness likelihood value. Among the benefits of the model is the increased accessibility and availability of ambulances, thus, enhanced quality of the EMS ambulance services.
Digital Object Identifier (DOI):

References:

[1] Z.A. Zaharudin, A. Shuib, A.M. Shahidin and N.A. Mohd Nordin, "A goal programming model for ambulance location problem - a preliminary study," Proceeding Seminar Kebangsaan Sains Matematik 17, 2009, pp 463-469.
[2] C.R. Toregas, R. Swain, C.S. ReVelle and L. Bergman, "The location of emergency service facilities," Operations Research 19, 1971, pp. 1363-1373.
[3] R.L. Church and C.S. ReVelle, "The maximal covering location problem," Papers of the Regional Science Association, Vol. 32, 1974, pp. 101-118.
[4] C. ReVelle and K. Hogan, "A reliability-constrained siting model with local estimates of busy fractions," Environment and Planning B: Planning and Design, Vol. 15, 1988, pp. 143-152.
[5] M.O. Ball and L.F. Lin, "A reliability model applied to emergency service vehicle location," Operations Research, Vol. 41, 1993, pp. 18-36.
[6] D.M. Shiah and S.W. Chen, "Ambulance allocation capacity model," The 9th International Conference on e-Health Networking, Application and Services, pp. 40-45 , 19 - 22 June 2007.
[7] V. Marianov and C.S. ReVelle, "The queuing probabilistic location set covering problem and some extensions," Socio- Economic Planning Sciences, Vol. 28, 1994, pp. 167-178.
[8] M.S. Daskin, "A maximum expected covering location model: formulation, properties and heuristic solution," Transportation Science, Vol. 17, 1983, pp. 48-68.
[9] C.S. ReVelle and K. Hogan, "The maximum availability location problem," Transportation Science, Vol. 23, 1989, pp. 192-200.
[10] O.I. Alsalloum and G.K. Rand, "Extension to emergency vehicle location model," Computers and Operation Research, Vol.33, 2006, pp. 2725 - 2743.
[11] P. Sorensen and R. Church, "Integrating expected coverage and local reliability for emergency medical services location problem," Socio-Economic Planning Sciences, Vol. 44, Issue 1, March 2010, pp. 8 - 18.
[12] D.F. Jones and M. Tamiz, "Goal programming in the period 1900- 2000," In Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, M. Ehrgott and X. Gandibleux, Eds. Kluwer Academic Publishers, Boston, MA, 2002, pp. 129 - 170.
[13] J.K. Sharma and M.M. Sharma, "On mixed integer solution to goal programming problem," Indian Journal Pure Application Math., Vol. 11(3), 1979, pp.312 - 320.
[14] C. Romero, Handbook of critical issues in goal programming. Oxford, UK: Pergamon Press, 1991.
[15] M.A. Badri, A.K. Mortagy and C.A. Alsayed, "A multi-objective model for locating fire stations," European Journal of Operational Research, Vol. 110, 1998, pp. 243 - 260 .
[16] N. A. Mohd Nordin, A. Shuib, and R. Ismail, "An application of the Dijkstra-s algorithm in the ambulance dispatching and routing," Proceeding Seminar Kebangsaan Matematik & Masyarakat 2008, (2008a). pp. 222-231.
[17] N. A. Mohd Nordin, A. Shuib, and R. Ismail, "Finding the quickest time route using the Dijkstra-s algorithm," Prosiding Seminar Kebangsaan Sains Matematik ke-16, 2008, Kota Bharu, Kelantan, (2008b).
[18] N. A. Mohd Nordin, A. Shuib, and R. Ismail, "Determining the quickest time route for the developed road network using Dijkstra-s algorithm: the HTAR case study," Proceedings in The Second International Conference on Mathematics and Natural Sciences 2008, Institut Teknologi Bandung, Indonesia, (2008c).
[19] N. A. Mohd Nordin, A. Shuib, and R. Ismail, "Modelling the clustered travel times for the road network of the emergency medical services ambulances," Proceedings in the International Conference on Science & Technology: Applications in Industry and Education, Universiti Teknologi MARA, Penang, 12 - 13 December 2008, (2008d).
[20] A. Shuib, N.A. Mohd. Nordin, R. Ismail, A.I. Mohamad, S.A. Ishak, "Simulation of Response Time of the Emergency Medical Services Ambulances using Clustered Travel Times Model". The 2nd International Conference on Mathematical Modelling and Computation & The 5th East Asia SIAM Conference, Universiti Brunei Darussalam, Brunei, 8 - 11 June 2009.
Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007