Ant Colony Optimization for a Plan Guide Course Registration Sequence
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 3
Abstract
Students in universities do not follow the prescribed course plan guide, which affects the registration process. In this research, we present an approach to tackle the problem of guide for plan of course sequence (GPCS) since that sequence may not be suitable for all students due to various conditions. The Ant Colony Optimization (ACO) algorithm is anticipated to be a suitable approach to solving such problems. Data on sequence of the courses registered by students of the Computer Science Department at Al Al-Bayt University over four years were collected for this study. The fundamental task was to find the suitable pheromone evaporation rate in ACO that generates the optimal GPCS by conducting an Adaptive Ant Colony Optimization (AACO) on the model that used the collected data. We found that 17 courses out of 31 were placed in semesters differing from the semesters preset in the course plan.
Authors and Affiliations
Wael Waheed Al-Qassas, Mohammad Said El-Bashir, Rabah Al-Shboul, Anwar Ali Yahya
Keywords
Related Articles
- EP ID EP278252
- DOI 10.14569/IJACSA.2018.090329
- Views 83
- Downloads 0
A Controlled Environment Model for Dealing with Smart Phone Addiction
Smart phones are commonly used in most parts of the world and it is difficult to find a society that is not affected by the smart phone culture. But the usage of smart phone is crossing the limit of being used as a facil...
Deep Gated Recurrent and Convolutional Network Hybrid Model for Univariate Time Series Classification
Hybrid LSTM-fully convolutional networks (LSTM-FCN) for time series classification have produced state-of-the-art classification results on univariate time series. We empirically show that replacing the LSTM with a gated...
A Novel Architecture for 5G Ultra Dense Heterogeneous Cellular Network
The mounting use of wireless devices and wide range applications in an ultra-dense heterogeneous wireless network has directed to the challenging circumstances that could not be handled till 4G. In order to deal with the...
Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is an optimization problem owing to find minimal travel distances to serve customers with homogeneous fleet of vehicles. Clustering customers and then assign individual vehi...
Modeling and Analyzing Anycast and Geocast Routing in Wireless Mesh Networks
Wireless technology has become an essential part of this era’s human life and has the capability of connecting virtually to any place within the universe. A mesh network is a self healing wireless network, built through...