The Late acceptance hill climbing algorithm for solving Patient facing problems in Hospitals
The current study is to evaluate the patient facing problems by applying Late Acceptance Hill Climbing Algorithm (LAHC) in hospital settings. The recent proposed procedure of LAHC is based on metaheuristic algorithm which is linked with one-point clarification method. Patient’s satisfaction regarding the performance of the hospital is a composite mechanism. The optimization procedure is connected with NP-hard problems which is practically related to the problems faced by patients. These problems are concerned with assigning the group of patients visiting the hospital for receiving healthcare services. The common issues faced by patients include communication gap, response time to attend patients, early symptomatic relief, getting proper advice for dosage and usage of medicines, clean hospital environment. Moreover, patient education and guidance before discharge from hospital is also the missing element. The suggested algorithm of LAHC to PFP is developed and it has two phases: the first phase includes providing the initial feasible solution using communication-oriented methodology. The second phase uses three neighborhood framework which are implanted inside the segment of PFP based on LAHC to additionally upgrade the underlying feasible solution of the introductory phase.
2. W. Vancroonenburg, D. Goossens, F. Spieksma, on the complexity of the patient assignment problem, Techical report, KAHO Sint-Lieven, Gebroed- ers De Smetstraat 1, Gent, Belgium, 2011. http://allserv.kahosl.be/wimvc/ pas- complexity- techreport.pdf
3. B. Bilgin , P. Demeester , G. Vanden Berghe , A hyperheuristic approach to the patient admission scheduling problem, Techical Report, KaHo Sint- Lieven, Gent (2008) .
4. McCollum, B.: A perspective on bridging the gap between theory and practice in university timetabling. In: Burke, E.K., Rudov ́a, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 3–23. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3- 540-77345-0 1
5. ̈Ulker, ̈ O., Landa-Silva, D.: A 0/1 integer programming model for the office space allocation problem. Electron. Not. Discrete Math. 36, 575–582 (2010) Adaptation of LAHC Algorithm for Optimizing the OFA Problem 189
6. Benjamin, C.O., Ehie, I.C., Omurtag, Y.: Planning facilities at the University of Missouri-Rolla. Interfaces 22(4), 95–105 (1992)
7. Yuan, B., Zhang, C., Shao, X.: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. J. Intell. Manuf. 26(1), 159–168 (2015)
8. Abuhamdah, A.: Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. Int. J. Comput. Sci. Netw. Secur.10(1), 192–200 (2010)
9. Verstichel, J., Berghe, G.V.: A late acceptance algorithm for the lock scheduling problem. In: Voß, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457– 478. Springer, Heidelberg (2009)
10. Tierney, K.: Late acceptance hill climbing for the liner shipping fleet repositioning problem. In: Proceedings of the 14th EU/MEWorkshop, pp. 21–27 (2013) 190 A. L. Bolaji et al.
11. Goerler, A., Schulte, F., Voß, S.: An application of late acceptance hill-climbing to the traveling purchaser problem. In: Pacino, D., Voß, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 173–
183. Springer, Heidelberg (2013). https://doi.org/ 10.1007/978-3-642-41019-2 13
12. B. Bilgin , P. Demeester , G. Vanden Berghe , A hyperheuristic approach to the patient admission scheduling problem, Techical Report, KaHo Sint- Lieven, Gent (2008) .
13. Burke E. K., & Bykov, Y. (2008). A late acceptance strategy in hillclimbing for exam timetabling problems: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT2008), Montreal, Canada 13 Di Gaspero, L.,&Schaerf, A. (2001). Tabu search techniques for examination timetabling. Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science. Berlin: Springer.
14. Di Gaspero, L.,&Schaerf, A. (2001). Tabu search techniques for examination timetabling. Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science. Berlin: Springer.
15. Bykov Y., & Petrovic, S. (2013). An initial study of a novel Step Counting Hill Climbing heuristic applied to timetabling problems: Proceedings of 6th Multidisciplinary International Scheduling Conference (MISTA 2013), Gent, Belgium.
16. I. Vermeulen , S. Bohte , K. Somefun , H. La Poutré, Multi-agent Pareto appoint- ment exchanging in hospital patient scheduling, Serv. Oriented Comput.Appl. 1 (3) (2007) 185–196.
17 Abuhamdah, A. (2010). Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. International Journal of Com- puter Science and Network Security, 10, 192– 200. Alzaqebah, M. , & A
18. Vancroonenburg, W. & Wauters, T. (2013).
Extending the late acceptance meta- heuristic for multi-objective optimization. In Proceedings of the 6th multidis- ciplinary international scheduling conference: Theory & applications (MISTA2013) (pp. 652–655). August 2013.
19. Alzaqebah, M., & Abdullah, S. (2014). An adaptive artificial bee colony and late acceptance hill-climbing algorithm for examination timetabling. Journal of Scheduling, 17 (3), 249–262
20. Jackson, W., Özcan, E., & Drake, J. H. (2013). Late Acceptance-based selection hy- per-heuristics for cross-domain heuristic search. In Proceedings of 13th
annual workshop on computational intelligence (UKCI), September 2013, Guildford, UK (pp. 228– 235).
21. Burke, E. K., & Bykov, Y. (2012). The late acceptance hill-climbing heuristic, technical report CSM-192. Stirlimg: Computing Science and Maematics, University of Stirling.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
All the articles published in this issue are licensed under the terms of the Creative Commons Attribution Non-Commercial License (CC Attribution 4.0 License. (http://creativecommons.org/licenses/by-nc/4.0/)) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the work is properly cited.