APPLICATION OF CHATGPT AND GOOGLE COLAB TO CREATE AN ALGORITHM FOR GROUPING AND ROUTING OPTIMIZATION FOR DRUGSTORE INSPECTION: A CASE STUDY OF THE PATHUM THANI PROVINCIAL PUBLIC HEALTH OFFICE

Authors

  • Nuttakan Teeratanun Consumer Protection and Public Health Pharmacy Division, Provincial Public Health Office, Pathum Thani, Pathum Thani
  • Perayot Pamonsinlapatham Department of Biomedical and Health Informatics, Faculty of Pharmacy, Silpakorn University, Sanam Chandra Palace Campus, Nakhonpathom

DOI:

https://doi.org/10.69598/tbps.20.1.55-65

Keywords:

Google Colab, ChatGPT, Route Planning, Algorithm, Locations

Abstract

Evaluation of drugstore inspections is a task under the supervision of the Provincial Health Office to ensure the quality and standards of pharmaceutical services. The current route planning initially relies on experienced personnel familiar with the area. Therefore, improving or enhancing the efficiency of this process is a significant challenge. This study aimed to develop a method by creating an algorithm using ChatGPT and calculating it through Google Colab to perform clustering and route optimization. The performance of the current expert route planning method was compared with 3 computer-based algorithms. Once the routes were optimized, they were calculated through Google Maps to study the distance and travel time required to visit all locations. This research is a developmental evaluation, using geographic coordinates of the current drugstores and computing them with 3 algorithms, comparing them to expert route planning. The study found that the expert method, which clustered 145 drugstores into 41 groups, resulted in a total distance of 2,755.01 km and a total time of 4,962 minutes. When comparing this with the three algorithms, they produced 21 clusters with distances of 1,313 km, 1,340 km, and 1,359 km, respectively, with reduced travel times. This led to a reduction of 50% in both distance and time. For the case of route sequencing with experts in 41 groups, using the three algorithms yielded different results within each cluster, but the total distance and time remained relatively consistent. The development and testing of the three algorithms can be used for clustering or finding travel sequences, offering a potential future tool to enhance the efficiency of route planning for the inspection of drugstore locations or other similar evaluations. It may be applied for planning in many regional, district, or country-level areas, making work more efficient.

 

References

World Health Organization. Good pharmacy practice - joint FIP/WHO guidelines on good pharmacy practice: Standards for quality of pharmacy services. 2011. [cited 2024 Nov 15]. Available from: https://www.fip.org/files/fip/WHO/GPP%20guidelines%20FIP%20publication_final.pdf

The office of community pharmacy accreditation (Thailand). Announcement of the food and drug administration on the criteria, methods, and conditions for passing the assessment according to the community pharmacy practice guidelines. 2016. [cited 2024 Nov 15]. Available from: https://papc.pharmacycouncil.org/download_file.php?file=678004486C119599ED7D199F47DA043A&itemid=2000&h=3973

Phannikul T. A heuristic algorithm for solving the vehicle routing problem with simultaneous pick-up and delivery [Dissertation]. Ubon Ratchathani: Ratchathani University; 2008. (in Thai)

Laporte G. A concise guide to the traveling salesman problem. J Oper Res Soc. 2010;61(1):35-40.

Google. Google colaboratory [Internet]. 2024 [cited 2024 Nov 8]. Available from: https://colab.research.google.com

Google. OR-Tools: Google's operations research tools [Internet]. 2024 [cited 2024 Nov 8]. Available from: https://developers.google.com/optimization

Sueni K. The routes transportation by comparison between using the saving algorithm and the nearest neighbor algorithm. Econ Bus Adm J Thaksin Univ. 2020;12(2);1-14. (in Thai)

Muriyatmoko D, Djunaidy A, Muklason A. Heuristics and metaheuristics for solving capacitated vehicle routing problem: An algorithm comparison, Procedia Comput Sci. 2024;234:494-501.

Genova K, Williamson DP. An experimental evaluation of the best-of-many Christofides’ algorithm for the traveling salesman problem. Algorithmica. 2017;78(4):1109-30.

Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. Oper Res Forum. 2022;3(1):20.

Google. Google map platform [Internet]. 2024 [cited 2024 Aug 10]. Available from: https://developers.google.com/maps/

Totrakool P. A heuristic search method for a vehicle routing problem in a medical supplies distribution system. [Dissertation]. Bangkok: Chulalongkorn University; 2003. (in Thai)

Grasas A, Ramalhinho H, Pessoa LS, Resende MGC, Caballé I, Barba N. On the improvement of blood sample collection at clinical laboratories. BMC Health Serv Res. 2014;14(1):12.

Yu R, Yun L, Chen C, Tang Y, Fan H, Qin Y. Vehicle routing optimization for vaccine distribution considering reducing energy consumption. Sustainability. 2023; 15(2):1252.

Issabakhsh M, Hosseini-Motlagh S, Pishvaee M, Saghafi Nia M. A vehicle routing problem for modeling home healthcare: A case study. Int J Transp Eng. 2018;5(3): 211-28.

Downloads

Published

05-03-2025

How to Cite

Teeratanun, N. ., & Pamonsinlapatham, P. (2025). APPLICATION OF CHATGPT AND GOOGLE COLAB TO CREATE AN ALGORITHM FOR GROUPING AND ROUTING OPTIMIZATION FOR DRUGSTORE INSPECTION: A CASE STUDY OF THE PATHUM THANI PROVINCIAL PUBLIC HEALTH OFFICE. Thai Bulletin of Pharmaceutical Sciences, 20(1), 55–65. https://doi.org/10.69598/tbps.20.1.55-65

Issue

Section

Original Research Articles