Balanced allocation of teaching information resources based on discrete particle swarm optimisation algorithm
by Hui Wang
International Journal of Computer Applications in Technology (IJCAT), Vol. 73, No. 4, 2023

Abstract: In order to overcome the problems of low resource utilisation, low resource coverage and long allocation time in traditional methods, a balanced allocation method of teaching information resources based on discrete particle swarm optimisation algorithm is proposed. Teaching information resources are collected and pre-processed through data cleaning, stop word removal and label processing. The objective function for balancing teaching information resources is constructed, and the discrete particle swarm optimisation algorithm solves the objective function by determining the encoding method, initialising the particle swarm, and calculating the fitness, etc. The optimal solution includes optimal resource weights, optimal resource allocation methods, optimal resource allocation proportions, etc. The obtained parameters are used to determine the optimal allocation scheme. Experimental results show that the utilisation rate of teaching information resources in this method can reach 99.8%, the coverage rate of teaching resources varies from 96.2% to 99.5%, the configuration time does not exceed 3.2 s.

Online publication date: Fri, 31-May-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com