Muslem, Imam
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Adaptive Heuristic-Based Ant Colony Optimization for Multi-Constraint University Course Timetabling with Morning Slot Preference for Energy Efficiency Muslem, Imam; Irvanizam, Irvanizam; Almuzammil, Almuzammil; Johar, Farhana
Jurnal Teknik Informatika (Jutif) Vol. 6 No. 6 (2025): JUTIF Volume 6, Number 6, Desember 2025
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2025.6.6.5588

Abstract

University course timetabling is a well-known NP-hard combinatorial optimization problem that involves multiple interacting constraints, including lecturer availability, classroom capacity, time-slot allocation, and course duration. Most existing metaheuristic-based approaches primarily focus on eliminating academic conflicts, while contextual and operational aspects, such as energy efficiency, are rarely considered explicitly. In addition, standard Ant Colony Optimization (ACO) methods often suffer from premature convergence and limited adaptability during the solution search process. This study proposes an Adaptive Heuristic-Based Ant Colony Optimization (AHB-ACO) approach for multi-constraint university course timetabling with a particular emphasis on morning slot preference as an energy efficiency proxy. The proposed method extends the conventional ACO framework by integrating an adaptive heuristic mechanism that dynamically guides the solution construction process toward compact and conflict-free schedules, while simultaneously favoring morning time slots to support reduced classroom cooling demand. Hard constraints, including lecturer and room conflicts, are strictly enforced, whereas the temporal preference is modeled as a soft constraint. The performance of AHB-ACO is evaluated through extensive scheduling simulations using academic datasets under various parameter settings. Experimental results demonstrate that the proposed approach consistently produces conflict-free timetables, achieving a conflict function value of C(S)=0 with stable convergence behavior. Furthermore, parameter sensitivity analysis indicates that AHB-ACO exhibits good robustness with respect to variations in the number of ants and iterations, showing a reasonable trade-off between solution quality and computational time. Additional analysis reveals an increased utilization of morning time slots compared to non-optimized schedules, indicating the effectiveness of the proposed energy-aware preference. Overall, the results suggest that AHB-ACO provides an effective and adaptive solution for university course timetabling that not only satisfies academic constraints but also addresses operational considerations related to energy efficiency.
Prediction of KIP Scholarship Eligibility at Universitas Almuslim Using an Explainable Artificial Intelligence–Based XGBoost Algorithm Zulkifli; Maulana, Rizky; Al Wafi, Muhammad Yasar; Muslem, Imam
Jurnal Multimedia dan Teknologi Informasi (Jatilima) Vol. 7 No. 04 (2025): Jatilima : Jurnal Multimedia Dan Teknologi Informasi
Publisher : Cattleya Darmaya Fortuna

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54209/jatilima.v7i04.1963

Abstract

The selection process for Kartu Indonesia Pintar (KIP) scholarship recipients at the higher education level continues to face several challenges, including subjective assessment, limited transparency, and the suboptimal use of data-driven decision support systems. This study aims to develop a predictive model for KIP scholarship eligibility at Universitas Almuslim using the XGBoost algorithm integrated with an Explainable Artificial Intelligence (XAI) approach. The dataset employed in this study consists of synthetic data constructed based on official KIP selection parameters, encompassing economic, academic, social, and demographic aspects, thereby ensuring the confidentiality of student data. The research stages include data preprocessing, predictive modeling, policy-based validation, and analysis of prediction results. The XGBoost algorithm is utilized to generate eligibility predictions along with associated probability scores, which are subsequently evaluated to ensure alignment with scholarship selection principles and regulations. The simulation results demonstrate a clear separation between eligible and non-eligible students, with prediction probabilities predominantly concentrated at extreme values, indicating a high level of model confidence. Further analysis reveals that economic indicators and social affirmation variables exert a more dominant influence than academic factors, which function as supporting criteria. These findings indicate that the proposed system is capable of producing stable and consistent predictions while enhancing transparency and accountability in the decision-making process. This study proposes an interpretable scholarship eligibility prediction framework that can be adapted by other higher education institutions as a fair and data-driven decision support system.