Staff View: Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty

Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty

The rapid advancement of information and communication technology significantly impacts various sectors, including education, by enhancing administrative and academic processes through sophisticated algorithms and systems. At Raden Fatah State Islamic University Palembang, specifically within the...

Full description

Saved in:

Bibliographic Details
Main Authors:	Mustakim, ., Tri Basuki, Kurniawan, Misinem, ., Edi Surya, Negara, Izman, Herdiansyah
Format:	Article
Language:	English English
Published:	INTI International University 2024
Subjects:	Q Science (General) QA Mathematics QA75 Electronic computers. Computer science QA76 Computer software
Online Access:	http://eprints.intimal.edu.my/2064/1/jods2024_57.pdf http://eprints.intimal.edu.my/2064/2/605 http://eprints.intimal.edu.my/2064/ http://ipublishing.intimal.edu.my/jods.html
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-inti-eprints.2064
record_format	eprints
spelling	my-inti-eprints.20642024-11-28T04:28:39Z http://eprints.intimal.edu.my/2064/ Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty Mustakim, . Tri Basuki, Kurniawan Misinem, . Edi Surya, Negara Izman, Herdiansyah Q Science (General) QA Mathematics QA75 Electronic computers. Computer science QA76 Computer software The rapid advancement of information and communication technology significantly impacts various sectors, including education, by enhancing administrative and academic processes through sophisticated algorithms and systems. At Raden Fatah State Islamic University Palembang, specifically within the Faculty of Sharia and Law, technology is pivotal in managing complex course scheduling challenges due to increasing student numbers and curriculum intricacies. This study examines the effectiveness of optimization algorithms in improving the efficiency and quality of academic scheduling. We focus on two prominent optimization techniques, Genetic Algorithms (GA) and Ant Colony Optimization (ACO), chosen for their capability to address the complex optimization problems typical in academic settings. The research encompasses a systematic approach, beginning with a clear definition of constraints and objectives, followed by designing and implementing both algorithms to address the scheduling issues at the Faculty of Sharia and Law. Our experimental evaluation compares the performance of GA and ACO across multiple metrics, including execution time, memory usage, fitness, and adaptability to dynamic conditions. Results indicate that while GA generally offers faster solutions, it requires more memory and shows variability in achieving optimal fitness levels. Conversely, ACO, though occasionally slower, consistently produces higher quality solutions with greater memory efficiency, making it more suitable for resource-constrained environments. The best results from the experiments highlight that ACO outperformed GA in terms of overall solution quality and resource efficiency, with an execution time of 19.27 seconds and 14,218.14 KB. Specifically, ACO consistently achieved near-optimal fitness scores with significantly lower memory usage compared to GA. This demonstrates ACO's robustness and suitability for handling complex scheduling problems where resource conservation is crucial. The choice between GA and ACO should be influenced by specific situational requirements—GA is recommended where speed is critical, while ACO is preferable in settings requiring high-quality, resource-efficient solutions. Future research should explore refining these algorithms, possibly through hybrid approaches that leverage the strengths of both to enhance their effectiveness and adaptability in complex scheduling scenarios. This study not only informs the academic community about effective scheduling practices but also sets a benchmark for future technological implementations in educational institutions. INTI International University 2024-11 Article PeerReviewed text en cc_by_4 http://eprints.intimal.edu.my/2064/1/jods2024_57.pdf text en cc_by_4 http://eprints.intimal.edu.my/2064/2/605 Mustakim, . and Tri Basuki, Kurniawan and Misinem, . and Edi Surya, Negara and Izman, Herdiansyah (2024) Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty. Journal of Data Science, 2024 (57). pp. 1-19. ISSN 2805-5160 http://ipublishing.intimal.edu.my/jods.html
institution	INTI International University
building	INTI Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	INTI International University
content_source	INTI Institutional Repository
url_provider	http://eprints.intimal.edu.my
language	English English
topic	Q Science (General) QA Mathematics QA75 Electronic computers. Computer science QA76 Computer software
spellingShingle	Q Science (General) QA Mathematics QA75 Electronic computers. Computer science QA76 Computer software Mustakim, . Tri Basuki, Kurniawan Misinem, . Edi Surya, Negara Izman, Herdiansyah Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
description	The rapid advancement of information and communication technology significantly impacts various sectors, including education, by enhancing administrative and academic processes through sophisticated algorithms and systems. At Raden Fatah State Islamic University Palembang, specifically within the Faculty of Sharia and Law, technology is pivotal in managing complex course scheduling challenges due to increasing student numbers and curriculum intricacies. This study examines the effectiveness of optimization algorithms in improving the efficiency and quality of academic scheduling. We focus on two prominent optimization techniques, Genetic Algorithms (GA) and Ant Colony Optimization (ACO), chosen for their capability to address the complex optimization problems typical in academic settings. The research encompasses a systematic approach, beginning with a clear definition of constraints and objectives, followed by designing and implementing both algorithms to address the scheduling issues at the Faculty of Sharia and Law. Our experimental evaluation compares the performance of GA and ACO across multiple metrics, including execution time, memory usage, fitness, and adaptability to dynamic conditions. Results indicate that while GA generally offers faster solutions, it requires more memory and shows variability in achieving optimal fitness levels. Conversely, ACO, though occasionally slower, consistently produces higher quality solutions with greater memory efficiency, making it more suitable for resource-constrained environments. The best results from the experiments highlight that ACO outperformed GA in terms of overall solution quality and resource efficiency, with an execution time of 19.27 seconds and 14,218.14 KB. Specifically, ACO consistently achieved near-optimal fitness scores with significantly lower memory usage compared to GA. This demonstrates ACO's robustness and suitability for handling complex scheduling problems where resource conservation is crucial. The choice between GA and ACO should be influenced by specific situational requirements—GA is recommended where speed is critical, while ACO is preferable in settings requiring high-quality, resource-efficient solutions. Future research should explore refining these algorithms, possibly through hybrid approaches that leverage the strengths of both to enhance their effectiveness and adaptability in complex scheduling scenarios. This study not only informs the academic community about effective scheduling practices but also sets a benchmark for future technological implementations in educational institutions.
format	Article
author	Mustakim, . Tri Basuki, Kurniawan Misinem, . Edi Surya, Negara Izman, Herdiansyah
author_facet	Mustakim, . Tri Basuki, Kurniawan Misinem, . Edi Surya, Negara Izman, Herdiansyah
author_sort	Mustakim, .
title	Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
title_short	Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
title_full	Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
title_fullStr	Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
title_full_unstemmed	Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty
title_sort	optimization algorithms: a comparison study for scheduling problem at uin raden fatah's sharia and law faculty
publisher	INTI International University
publishDate	2024
url	http://eprints.intimal.edu.my/2064/1/jods2024_57.pdf http://eprints.intimal.edu.my/2064/2/605 http://eprints.intimal.edu.my/2064/ http://ipublishing.intimal.edu.my/jods.html
_version_	1817849528550686720
score	13.222552

Optimization Algorithms: A Comparison Study for Scheduling Problem at UIN Raden Fatah's Sharia and Law Faculty

Similar Items