Evaluating Optimization Algorithms for Dynamic Workforce Management: A Comparative Approach
Effective workforce management is critical for optimizing operational efficiency in dynamic environments, particularly in healthcare settings. This paper presents a comparative analysis of five prominent optimization algorithms—Genetic Algorithms (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and Tabu Search (TS)—specifically applied to the problem of dynamic staffing needs in hospitals. Each algorithm is evaluated based on key performance metrics, including execution time, solution quality, scalability, and robustness. The study reveals that while GA and SA deliver high-quality solutions, ACO and TS are better suited for dynamic environments where conditions frequently change. PSO is recognized for its speed but may compromise on solution quality in more complex scenarios. The findings suggest that healthcare practitioners should consider hybrid approaches that combine the strengths of these algorithms to enhance workforce optimization. Recommendations for future research include the exploration of adaptive algorithms and the integration of machine learning techniques to further improve staffing efficiency in healthcare and other industries.
Authors
- Misha Kakkar (ORCID: https://orcid.org/0000-0002-2061-0477)
- Anand M. Goel (ORCID: https://orcid.org/0000-0002-9683-1911)
- Ashwani Jha (ORCID: https://orcid.org/0000-0003-2835-6837)
- Kushagr Kakkar
- Rishita Chaubey
Institutions
- Amazon (United States) (US)
- Amity University (IN)
Publication Details
- Published
- 2025-02-06
- DOI
- https://doi.org/10.1109/cictn64563.2025.10932376
- Citations
- 1
- Primary Topic
- Scheduling and Timetabling Solutions
- Type
- article
- Field-Weighted Citation Impact
- 2.11