Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30184
Mobile Medical Operation Route Planning

Authors: K. Somprasonk, R. Boondiskulchok

Abstract:

Medical services are usually provided in hospitals; however, in developing country, some rural residences have fewer opportunities to access in healthcare services due to the limitation of transportation communication. Therefore, in Thailand, there are charitable organizations operating to provide medical treatments to these people by shifting the medical services to operation sites; this is commonly known as mobile medical service. Operation routing is important for the organization to reduce its transportation cost in order to focus more on other important activities; for instance, the development of medical apparatus. VRP is applied to solve the problem of high transportation cost of the studied organization with the searching techniques of saving algorithm to find the minimum total distance of operation route and satisfy available time constraints of voluntary medical staffs.

Keywords: Decision Support System, Mobile Medical Service Planning, Saving Algorithm, Vehicle Routing Problem

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1078406

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1224

References:


[1] Intapayung. Nakon, Discrete Optimization in Transport and Logistics. Bangkok, Thailand: Se-education Publishing, 2005, pp. 174-183
[2] Laporte, G. "The Vehicle Routing Problem: An Overview of exact and approximate algorithms" European Journal of Operation Research, vol. 59, pp. 345-358, 1992.
[3] Sussams J, Logistics Modeling. London, UK: Pitman Publishing.
[4] Thangiah. S. R, Potvin. J, and Sun.T, "Heuristics Appraoch to vehicle routing with backhauls and time windows" Computer Ops Res, vol. 23, pp. 1043-1057, 1996.
[5] Bookbinder. A.V, and Reece. K, "Vehicle Routing considerations in distribution system design" European Journal of Operation Research, vol. 37, pp. 204-213, 1988.
[6] Laporte. G, "The Traveling Salesman Problem : An Overview of exact and approximate algorithms" European Journal of Operation Research, vol. 59, pp. 231-248,1992.
[7] Lenstra. J.K, and Rinnooy Kan, A.H.G. "Some simple applications of the travelling salesman problem" Operation Research Quarterly 26, pp. 717-734, 1975.
[8] Larson.A, "The Dynamic Vehicle Routing Problem" Ph.D. dissertation, Dept. of Mathematical Modeling, Technical University of Denmark, 2000.
[9] Laporte.G, Mercure.H, and Nobert.Y, "An exact algorithm for asymmetrical vehicle routing problem" Networks 16, pp. 33-46, 1986.
[10] Christofides. N, Mingozzi.A, and Toth.P, "Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations" Mathematical Programming, Cambridge, unpublished.
[11] Elion. S, Watson-Gandy. C.D.T., and Christofides.N, Distribution Management: Mathematical Modeling and Practical Analysis. ,London: Griffin.
[12] Tunsirijareankun. O, "A heuristic approach for solving the vehicle routing problem in solid waste collection in Bang Khen area" Engineering Master Degree Thesis, Dept. of Industrial Engineering, Chulalongkorn University, 1991.
[13] Clark. G, and Wright.J.W, "Scheduling of vehicles from central depot to a numbers of delivery points " Operation Research, vol. 12, pp. 568- 581, 1964.
[14] Sawat. K, "Dynamic Scheduling for vehicle routing problems " Engineering Master Degree Thesis, Dept. of Industrial Engineering, Chulalongkorn University, 2006.
[15] Totrakool. P, "A heuristic search method for vehicle routing problem in medical supplies distribution system " Engineering Master Degree Thesis, Dept. of Industrial Engineering, Chulalongkorn University, 2003.
[16] Christofides. N, Mingozzi.A, and Toth.P, "State space relaxation procedures for the computational of bounds to routing problems" Networks 11, pp. 145-164, 1981.
[17] Gendreau.M, Laporte. G, and Semet.F, "A tabu search heuristic for the undirected selective traveling salesman problem " European Journal of Operation Research, vol. 106, pp. 539-545, 1998.
[18] Tan.K, Lee.L.H, and Ou.K,. "Artificial intelligence heuristics in solving vehicle routing problems with time windows" Engineering Applications of Artificial Intelligence, vol. 14, pp. 825-837, 2001.
[19] Chaovalitwongse.W, Kim.D, and Pardalos.P.M, "GRASP with new local search scheme for vehicle routing problem with time windows" Journal of Combinatorial Optimization, vol. 7, pp. 179-207, 2003.
[20] Tan.K, Lee.L.H, Zhu.Q, and Ou.K,. "Heuristics Method for vehicle routing problem with time windows" Artificial Intelligence in engineering, vol. 15, pp. 281-295, 2001.
[21] Cooper.J.C,, "The use of straight line distances in solutions to vehicle scheduling problem " Journal of Operation Research Society, vol. 34, pp. 419-424, 1983.
[22] Breedam.A.V, "An Analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer-related and time-related constraints" Faculty of Applied Economics, University of Antwep, unpublished.
[23] Shen.Y, Potvin.J,Rousseau.J, and Roy.S, "A computer assistant for vehicle dispatching with learning capability " Annals of Operations Research, vol. 61, pp. 189-211, 1995.
[24] Supavitra. V, Kritkanchai. D, "A Prototype of Operation Research Management" Thailand Annals of Operations Research,pp. 286-295, 2006.
[25] Pallottino.S, Scutella. S.P, Technical Report: TR 97 06 Shortest path algorithm in Transportation Model: Classical and innovative aspect.s Dept. of Informatica, ,Pisa, Italy: Universita Di Pisa,1997.