Swarm intelligence to solve the curriculum sequencing problem

2018 ◽  
Vol 26 (5) ◽  
pp. 1393-1404 ◽  
Author(s):  
Mohamed E. B. Menai ◽  
Hamad Alhunitah ◽  
Hussein Al-Salman

2019 ◽  
Vol 17 (4) ◽  
pp. 71-93 ◽  
Author(s):  
Marcelo de Oliveira Costa Machado ◽  
Eduardo Barrére ◽  
Jairo Souza

Adaptive curriculum sequencing (ACS) is still a challenge in the adaptive learning field. ACS is a NP-hard problem especially considering the several constraints of the student and the learning material when selecting a sequence from repositories where several sequences could be chosen. Therefore, this has stimulated several researchers to use evolutionary approaches in the search for satisfactory solutions. This work explores the use of an adaptation of the prey-predator algorithm for the ACS problem. Pedagogical experiments with a real student dataset and convergence experiments with a synthetic dataset have shown that the proposed solution is suitable for the problem, although it is a solution not yet explored in the adaptive learning literature.



2011 ◽  
Vol 10 (2) ◽  
pp. 891-920 ◽  
Author(s):  
Sarab Al-Muhaideb ◽  
Mohamed El Bachir Menai


2014 ◽  
Vol 12 (4) ◽  
pp. 1-18 ◽  
Author(s):  
Amina Debbah ◽  
Yamina Mohamed Ben Ali

In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem.



Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.











Sign in / Sign up

Export Citation Format

Share Document