Enhanced Ant Colony Optimization for Cloud Scheduling with Local Search and Elitist
DOI:
https://doi.org/10.14421/jiska.6105Keywords:
Ant Colony Optimization, Cloud Computing, Elitist Strategy, Job Scheduling, Local SearchAbstract
Cloud computing allows the execution of various types of jobs with diverse resource requirements, so an efficient scheduling mechanism is needed to minimize processing time and improve resource utilization. The Ant Colony Optimization (ACO) algorithm is one of the metaheuristic methods widely used for job scheduling optimization. However, the ACO algorithm still has limitations in slow convergence and a tendency to get stuck in local solutions. This study proposes Enhanced Ant Colony Optimization with the Swap-Based Local Search and Elitist Strategy approaches to improve the quality of scheduling decisions. Evaluations were conducted in a heterogeneous emulated cloud environment with a focus on scheduling performance, convergence behaviour, and resource utilization metrics. The experimental results show that the proposed method outperforms FCFS, ACO, and ACO with Local Search for both normal and heavy scenarios. The study also demonstrates that the integration of local search and elitist strategy effectively improves the convergence process toward the global optimal solution while promoting a fairer utilization of resources. This paper may serve as a basis for further development on larger job scales and the addition of other optimization techniques.
References
Abd Alhussain, Z. A., & Hassan, L. S. (2024). A Review on Elitist Ant System Algorithm and Applications in Flexible Job Scheduling Problem. Al-Bahir, 4(2), Article ID: 5. https://doi.org/10.55810/2313-0083.1059
Abdulghani, A. M. (2024). Hybrid Task Scheduling Algorithm for Makespan Optimisation in Cloud Computing: A Performance Evaluation. Journal on Artificial Intelligence, 6(1), 241–259. https://doi.org/10.32604/jai.2024.056259
Bashaireh, R. A. L. (2023). Task Scheduling in Cloud Computing: Priority-Based Algorithms and Future Directions in Data Science. Journal of Theoretical and Applied Information Technology, 15(15). https://www.jatit.org/volumes/Vol101No15/3Vol101No15.pdf
Bei, L., Wenlin, L., Xin, S., & Xibin, X. (2024). An Improved ACO Based Service Composition Algorithm in Multi-Cloud Networks. Journal of Cloud Computing, 13(1), Article ID: 17. https://doi.org/10.1186/s13677-024-00588-x
Bestari, H. M. H., Suryadhini, P. P., & Nopendri, N. (2024). Flow Shop Scheduling Using a Combination of Ant Colony Optimization Algorithm and Tabu Search Algorithm to Minimize Total Tardiness. Jurnal Teknik Industri: Jurnal Hasil Penelitian dan Karya Ilmiah dalam Bidang Teknik Industri, 10(2), 383–391. https://doi.org/10.24014/jti.v10i2.32320
Buulolo, K., & Wau, K. (2024). Performance Comparison of Metaheuristic Optimization Algorithms in Solving Production Scheduling Problems. Jurnal ICT: Information and Communication Technologies, 15(2), 122–132. https://doi.org/10.35335/jict.v15i2.197
Djebbar, E. I., & Belalem, G. (2025). Improvement of the ACO Algorithm for Intelligent Task Scheduling in Cloud Systems. Scalable Computing: Practice and Experience, 26(2), 531–539. https://doi.org/10.12694/scpe.v26i2.3946
Gabhane, J. P., Pathak, S., & Thakare, N. M. (2023). A Novel Hybrid Multi-Resource Load Balancing Approach Using Ant Colony Optimization with Tabu Search for Cloud Computing. Innovations in Systems and Software Engineering, 19(1), 81–90. https://doi.org/10.1007/s11334-022-00508-9
Guo, N., Qian, B., Na, J., Hu, R., & Mao, J.-L. (2022). An Enhanced Ant Colony Algorithm with Variable Neighborhood Descent for Multi-compartment Vehicle Routing Problem with Time Limits. 2022 41st Chinese Control Conference (CCC), 1961–1966. https://doi.org/10.23919/CCC55666.2022.9901913
Hussain, S. F., Butt, I. A., Hanif, M., & Anwar, S. (2022). Clustering Uncertain Graphs Using Ant Colony Optimization (ACO). Neural Computing and Applications, 34(14), 11721–11738. https://doi.org/10.1007/s00521-022-07063-1
Jeyaraj, R., & Paul, A. (2022). Optimizing MapReduce Task Scheduling on Virtualized Heterogeneous Environments Using Ant Colony Optimization. IEEE Access, 10, 55842–55855. https://doi.org/10.1109/ACCESS.2022.3176729
Kansara, A. S., Gohil, B. N., & Verma, N. (2023). Task Scheduling in Cloud Computing Using Mean Ant Colony Optimization. 2023 6th International Conference on Information Systems and Computer Networks (ISCON), 1–8. https://doi.org/10.1109/ISCON57294.2023.10112102
Kumar, B. S., & Shankar, R. (2026). A Constrained Multi-Objective Metaheuristic Reinforcement Learning Framework for Adaptive Load Balancing in Heterogeneous Edge Cloud Environments. Sustainable Computing: Informatics and Systems, 51, Article ID: 101419. https://doi.org/10.1016/j.suscom.2026.101419
Kushwah, V. S., Goyal, S. K., & Sharma, A. (2020). Maximize Resource Utilization Using ACO in Cloud Computing Environment for Load Balancing. In S. Computing (Ed.), T. K. and V. O. P. and S. R. and S. A. Pant Millie and Sharma (pp. 583–590). Springer. https://doi.org/10.1007/978-981-15-0751-9_54
Lilhore, U. K., Simaiya, S., Rao, K. B. V. B., Rao, V. V. R. M., Sharma, Y. K., Alroobaea, R., Alsufyani, H., Alsafyani, M., & Khan, M. D. M. (2025). Hybrid DRL-Enhanced ACO-WWO for Efficient Resource Allocation and Load-Balancing in Cloud Computing. International Journal of Computational Intelligence Systems, 18(1), Article ID: 148. https://doi.org/10.1007/s44196-025-00882-9
Mangalampalli, S., Karri, G. R., & Elngar, A. A. (2023). An Efficient Trust-Aware Task Scheduling Algorithm in Cloud Computing Using Firefly Optimization. Sensors, 23(3), Article ID: 1384. https://doi.org/10.3390/s23031384
Muklason, A., & Agung Premananda, I. G. (2023). Hybrid Iterated Local Search Algorithm for Optimization Route of Airplane Travel Plans. International Journal of Electrical and Computer Engineering (IJECE), 13(4), 4700–4707. https://doi.org/10.11591/ijece.v13i4.pp4700-4707
Murad, S. A., Muzahid, A. J. M., Azmi, Z. R. M., Hoque, M. I., & Kowsher, M. (2022). A Review on Job Scheduling Technique in Cloud Computing and Priority Rule Based Intelligent Framework. Journal of King Saud University - Computer and Information Sciences, 34(6), 2309–2331. https://doi.org/10.1016/j.jksuci.2022.03.027
Pemasinghe, S., & Rajapaksha, S. (2022). Comparison of CPU Scheduling Algorithms: FCFS, SJF, SRTF, Round Robin, Priority Based, and Multilevel Queuing. 2022 IEEE 10th Region 10 Humanitarian Technology Conference (R10-HTC), 318–323. https://doi.org/10.1109/R10-HTC54060.2022.9929533
Pirozmand, P., Jalalinejad, H., Hosseinabadi, A. A. R., Mirkamali, S., & Li, Y. (2023). An Improved Particle Swarm Optimization Algorithm for Task Scheduling in Cloud Computing. Journal of Ambient Intelligence and Humanized Computing, 14(4), 4313–4327. https://doi.org/10.1007/s12652-023-04541-9
Samriya, J. K., Chandra Patel, S., Khurana, M., Tiwari, P. K., & Cheikhrouhou, O. (2021). Intelligent SLA-Aware VM Allocation and Energy Minimization Approach with EPO Algorithm for Cloud Computing Environment. Mathematical Problems in Engineering, 2021(1), 1–13. https://doi.org/10.1155/2021/9949995
Sanaj, M. S., Horng, M.-F., Shankar, S. S., Lo, C.-C., Sunder, R., Lilhore, U. K., Simaiya, S., Tekeste, L. G., Mohamed, H. G., & Ghith, E. S. (2026). Energy-Efficient Task Scheduling in Cloud Computing with EcoTaskOpt: A Hybrid Ant Colony and Particle Swarm Optimization Approach. International Journal of Computational Intelligence Systems, 19(1), Article ID: 64. https://doi.org/10.1007/s44196-025-01095-w
Shi, G., & Jiang, X. (2025). Improved Ant Colony Algorithm-Based Path Planning for Mobile Robots. In J. Ma, S. Kadry, & R. A. El-Nabulsi (Eds.), Ninth International Conference on Computing, Control, and Industrial Engineering (CCIE 2025) (p. 78). SPIE. https://doi.org/10.1117/12.3093516
Singhal, S. (2025). A Hybrid Approach Combining Ant Colony Optimization and Simulated Annealing for Cloud Resource Scheduling. Journal of Computational Systems and Applications, 2(2), 17–32. https://doi.org/10.63623/9rv3x042
Talaat, F. M., & Hamza, A. A. (2025). CloudSched-GA: An Adaptive Genetic Optimizer for Efficient and Balanced Task Scheduling in Cloud Ecosystems. Neural Computing and Applications, 37(33), 28269–28293. https://doi.org/10.1007/s00521-025-11668-7
Tarigan, U., Siregar, I., Sari, R. M., Syahputri, K., & Rizkya, I. (2021). Comparison of First Come First Served and Ant Colony Algorithm Method for Door Leaf Production Scheduling. IOP Conference Series: Materials Science and Engineering, 1122(1), 012057. https://doi.org/10.1088/1757-899X/1122/1/012057
Tian, Y., Zhang, J., Wang, Q., Liu, S., Guo, Z., & Zhang, H. (2024). Application of Hybrid Algorithm Based on Ant Colony Optimization and Sparrow Search in UAV Path Planning. International Journal of Computational Intelligence Systems, 17(1), Article ID: 286. https://doi.org/10.1007/s44196-024-00652-z
Vidhya, M., & Devi, R. (2023). Analysis of Optimization and Conventional Algorithms Using CloudSim in Cloud. 2023 12th International Conference on System Modeling & Advancement in Research Trends (SMART), 403–408. https://doi.org/10.1109/SMART59791.2023.10428192
Downloads
Published
Issue
Section
License
Copyright (c) 2026 I Made Alit Darma Putra
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish with this journal agree to the following terms as stated in http://creativecommons.org/licenses/by-nc/4.0
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
