JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Location Analysis for Emergency Medical Service Vehicle in Sub District Area
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Location Analysis for Emergency Medical Service Vehicle in Sub District Area
Nanthasamroeng, Natthapong;
  PDF(new window)
 Abstract
This research aims to formulate a mathematical model and develop an algorithm for solving a location problem in emergency medical service vehicle parking. To find an optimal parking location which has the least risk score or risk priority number calculated from severity, occurrence, detection, and distance from parking location for emergency patients, data were collected from Pratoom sub-district Disaster Prevention and Mitigation Center from October 2010 to April 2011. The criteria of risk evaluation were modified from Automotive Industry Action Group's criteria. An adaptive simulated annealing algorithm with multiple cooling schedules called multi-agent simulated quenching (MASQ) is proposed for solving the problem in two schemes of algorithms including dual agent and triple agent quenching. The result showed that the solution obtained from both scheme of MASQ was better than the traditional solution. The best locations obtained from MASQ-dual agent quenching scheme was nodes #5 and #133. The risk score was reduced 61% from 6,022 to 2,371 points.
 Keywords
Emergency Medical Service;Location Problem;Multi-Agent Simulated Quenching;
 Language
English
 Cited by
 References
1.
Automotive Industry Action Group (2008), Potential Failure Mode and Effects Analysis: Reference Manual (4th ed.), Automotive Industry Action Group, Southfield, MI.

2.
Antunes, A. and Peeters, D. (2001), On solving complex multi-period location models using simulated annealing, European Journal of Operational Research, 130(1), 190-201. crossref(new window)

3.
Arostegui Jr., M. A., Kadipasaoglu, S. N., and Khumawala, B. M. (2006), An empirical comparison of Tabu search, simulated annealing, and genetic algorithms for facilities location problems, International Journal of Production Economics, 103(2), 742-754. crossref(new window)

4.
Callister, W. D. and Rethwisch, D. G. (2010), Materials Science and Engineering: An Introduction (8th ed.), John Wiley and Sons, Hoboken, NJ.

5.
Cerny, V. (1985), Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, Journal of Optimization Thoery, 45(1), 41-51. crossref(new window)

6.
Gendreau, M., Laporte, G., and Semet, F. (1997), Solving an ambulance location model by Tabu search, Location Science, 5(2), 75-88. crossref(new window)

7.
Ingber, L. (1993), Simulated annealing: practice versus theory, Mathematical and Computer Modelling, 18 (11), 29-57.

8.
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220 (4598), 671-680. crossref(new window)

9.
Levanova, T. V. and Loresh, M. A. (2004), Algorithms of ant system and simulated annealing for the pmedian problem, Automation and Remote Control, 65(3), 431-438. crossref(new window)

10.
Marianov, V. and ReVelle, C. (1996), The queueing maximal availability location problem: a model for the siting of emergency vehicles, European Journal of Operational Research, 93(1), 110-120. crossref(new window)

11.
Nanthasamroeng, N. and Pitakaso, R. (2010), Iterated local search for multi-criteria and multi-stage location allocation problem, Proceedings of the 1st International Conference on Logistics and Maritime Systems, Busan, Korea.

12.
Paik, C. H. and Soni, S. (2007), A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks, European Journal of Operational Research, 178(2), 579-594. crossref(new window)

13.
Park, M. W. and Kim, Y. D. (1998), A systematic procedure for setting parameters in simulated annealing algorithms, Computers and Operations Research, 25(3), 207-217. crossref(new window)

14.
Righini, G. (1995), A double annealing algorithm for discrete location/allocation problems, European Journal of Operational Research, 86(3), 452-468. crossref(new window)

15.
Schmid, V. and Doerner, K. F. (2010), Ambulance location and relocation problems with time-dependent travel times, European Journal of Operational Research, 207(3), 1293-1303. crossref(new window)

16.
Taheri, J. and Zomaya, A. Y. (2007), A simulated annealing approach for mobile location management, Computer Communications, 30(4), 714-730. crossref(new window)

17.
Tavares, R. S., Martins, T. C., and Tsuzuki, M. S. G. (2011), Simulated annealing with adaptive neighborhood: a case study in off-line robot path planning, Expert Systems with Applications, 38(4), 2951- 2965. crossref(new window)

18.
Thailand Health Insurance Research Office (2009), Development of Emergency Medical Service System in Thailand, Thailand Health Insurance Research Office, Bangkok, Thailand.

19.
Vasan, A. and Raju, K. S. (2009), Comparative analysis of simulated annealing, simulated quenching and genetic algorithms for optimal reservoir operation, Applied Soft Computing, 9(1), 274-281. crossref(new window)

20.
World Health Organization (2011), World Health Statistics, World Health Organization, Geneva, Switzerland.

21.
Xiao, N., Huang, H. Z., Li, Y., He, L., and Jin, T. (2011), Multiple failure modes analysis and weighted risk priority number evaluation in FMEA, Engineering Failure Analysis, 18(4), 1162-1170. crossref(new window)

22.
Yu, V. F., Lin, S. W., Lee, W., and Ting, C. J. (2010), A simulated annealing heuristic for the capacitated location routing problem, Computers and Industrial Engineering, 58(2), 288-299. crossref(new window)