The automatic course scheduling in college is a complex constraint optimization problem. A kind of self-adaptive constraint particle swarm algorithm is proposed to avoid premature convergence of particle swarm optimization algorithm. A self-adaptive criterion is applied in different phases of algorithm execution to realize dynamic and adaptive switch between attractors and repellors during the algorithm’s running process, and inertia weight will change dynamically and adaptively with the number of iterations. The algorithm performance can be further improved with a higher convergence speed and stronger robustness
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
The Curriculum Sequencing (CS) problem is a challenging task to tackle in the field of online teachi...
Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-comple...
<p>Course timetabling management information system is a system focusing on data management resource...
In a college, a scheduling is one of the most important aspects in teaching and learning activities,...
To overcome the problem of premature convergence on Particle Swarm Optimization (PSO), this paper pr...
This study focuses on the development of a scheme for self-adapting the Particle Swarm Optimization ...
This paper develops a particle swarm optimization (PSO) based framework for constrained optimization...
The timetabling problem at universities is an NP - hard problem un der multiple constraints and limi...
Traditional artificial intelligence and computer-aided course scheduling schemes can no longer meet ...
Course scheduling problem is hard and time-consuming to solve which is commonly faced by academic ad...
INDONESIA: Penjadwalan merupakan proses menempatkan data penjadwalan pada hari, ruang dan waktu y...
The timetabling problem is well known to be NP complete combinatorial problem. The problem becomes ...
Abstract- Course scheduling problem is hard and time-consuming to solve which is commonly faced by a...
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
The Curriculum Sequencing (CS) problem is a challenging task to tackle in the field of online teachi...
Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-comple...
<p>Course timetabling management information system is a system focusing on data management resource...
In a college, a scheduling is one of the most important aspects in teaching and learning activities,...
To overcome the problem of premature convergence on Particle Swarm Optimization (PSO), this paper pr...
This study focuses on the development of a scheme for self-adapting the Particle Swarm Optimization ...
This paper develops a particle swarm optimization (PSO) based framework for constrained optimization...
The timetabling problem at universities is an NP - hard problem un der multiple constraints and limi...
Traditional artificial intelligence and computer-aided course scheduling schemes can no longer meet ...
Course scheduling problem is hard and time-consuming to solve which is commonly faced by academic ad...
INDONESIA: Penjadwalan merupakan proses menempatkan data penjadwalan pada hari, ruang dan waktu y...
The timetabling problem is well known to be NP complete combinatorial problem. The problem becomes ...
Abstract- Course scheduling problem is hard and time-consuming to solve which is commonly faced by a...
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
Nowadays scheduling problems are raised in areas like industry, academic, health care, production an...
The Curriculum Sequencing (CS) problem is a challenging task to tackle in the field of online teachi...