Design of College Scheduling Algorithm Based on Improved Genetic Ant Colony Hybrid Optimization

With the gradual expansion of college scale, the professional categories in colleges and universities are becoming more and more complete, and the volume of courses is becoming more and more huge. In the meantime, the number of students is growing by leaps and bounds, and the teaching resources are...

Full description

Saved in:
Bibliographic Details
Published in:Security and communication networks Vol. 2022; pp. 1 - 13
Main Authors: Li, Ting, Xie, Qiang, Zhang, Hua
Format: Journal Article
Language:English
Published: London Hindawi 14.06.2022
John Wiley & Sons, Inc
Subjects:
ISSN:1939-0114, 1939-0122
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract With the gradual expansion of college scale, the professional categories in colleges and universities are becoming more and more complete, and the volume of courses is becoming more and more huge. In the meantime, the number of students is growing by leaps and bounds, and the teaching resources are subject to more and more complicated teaching tasks. The workload and the difficulty of scheduling in teaching management are also on the rise year by year. This paper proposes a design of a college scheduling algorithm based on an improved genetic ant colony hybrid optimization algorithm. Firstly, the fitness-enhanced elimination law is proposed to improve the selection process of traditional genetic algorithms. Subsequently, the gene infection crossover method is proposed to ensure the increase of the average fitness value in the evolutionary process. Next, the unnecessary replication operation in the traditional genetic algorithm is removed to enhance the operation speed of the algorithm. Finally, the parallel mechanism of fuzzy adaptive is introduced to improve the convergence and stability of the algorithm. For the ant colony optimization algorithm, a nonuniform pheromone distribution is used according to the position of the current raster relative to the starting point, which makes the initial pheromone concentration of the dominant raster higher and avoids blind search by ants. The ant movement rules are redefined by the directional neighborhood expansion strategy to further shorten the path. The experimental results indicate that the hybrid optimization algorithm outperforms other algorithms in terms of performance in terms of scheduling success and scheduling time, and it can be applied in practical scheduling because of the high quality of courses schedule.
AbstractList With the gradual expansion of college scale, the professional categories in colleges and universities are becoming more and more complete, and the volume of courses is becoming more and more huge. In the meantime, the number of students is growing by leaps and bounds, and the teaching resources are subject to more and more complicated teaching tasks. The workload and the difficulty of scheduling in teaching management are also on the rise year by year. This paper proposes a design of a college scheduling algorithm based on an improved genetic ant colony hybrid optimization algorithm. Firstly, the fitness-enhanced elimination law is proposed to improve the selection process of traditional genetic algorithms. Subsequently, the gene infection crossover method is proposed to ensure the increase of the average fitness value in the evolutionary process. Next, the unnecessary replication operation in the traditional genetic algorithm is removed to enhance the operation speed of the algorithm. Finally, the parallel mechanism of fuzzy adaptive is introduced to improve the convergence and stability of the algorithm. For the ant colony optimization algorithm, a nonuniform pheromone distribution is used according to the position of the current raster relative to the starting point, which makes the initial pheromone concentration of the dominant raster higher and avoids blind search by ants. The ant movement rules are redefined by the directional neighborhood expansion strategy to further shorten the path. The experimental results indicate that the hybrid optimization algorithm outperforms other algorithms in terms of performance in terms of scheduling success and scheduling time, and it can be applied in practical scheduling because of the high quality of courses schedule.
Author Li, Ting
Xie, Qiang
Zhang, Hua
Author_xml – sequence: 1
  givenname: Ting
  surname: Li
  fullname: Li, Ting
  organization: Center for Evaluation and Faculty DevelopmentHunan First Normal UniversityChangshaHunan 410205Chinahnfnu.edu.cn
– sequence: 2
  givenname: Qiang
  surname: Xie
  fullname: Xie, Qiang
  organization: Academic Affairs OfficeHunan First Normal UniversityChangshaHunan 410205Chinahnfnu.edu.cn
– sequence: 3
  givenname: Hua
  orcidid: 0000-0001-5730-8231
  surname: Zhang
  fullname: Zhang, Hua
  organization: School of Computer Science and EngineeringHunan University of Information TechnologyChangshaHunan 410151China
BookMark eNp9kEFPAjEUhBujiYDe_AFNPOpK-9rtbo-ICiQkHNTzZtl9CyVLi92iwV_vIsSDiZ7eHL6ZN5kuObXOIiFXnN1xHsd9YAB9iFWshD4hHa6FjhgHOP3RXJ6TbtOsGFNcJrJDsgdszMJSV9Ghq2tcIH0ullhua2MXdFAvnDdhuab3eYMldZZO1hvv3ls9QovBFHRgw97q7I6Od3NvSjrbBLM2n3kwzl6QsyqvG7w83h55fXp8GY6j6Ww0GQ6mUSFEEiKUqQZZpDHHBGXMRFwAApeVQBZrAFC8wlJDKipIFUhMilLJPFH5HNMqFaJHrg-5bbu3LTYhW7mtt-3LDFTKNOdK65aCA1V41zQeq6ww4btn8LmpM86y_ZDZfsjsOGRruv1l2nizzv3uL_zmgC-NLfMP8z_9BXJSgTY
CitedBy_id crossref_primary_10_1007_s11277_023_10240_7
crossref_primary_10_18070_erciyesiibd_1486042
crossref_primary_10_1155_2022_6839165
crossref_primary_10_1155_2023_9865853
Cites_doi 10.1111/josh.12865
10.33480/jitk.v7i2.2262
10.21061/jcte.v34i1.a1
10.18421/TEM91-53
10.1080/09540091.2019.1700912
10.54216/ijns.010104
10.3991/ijet.v16i01.18225
10.1177/2167696820916639
10.1080/00207543.2020.1717008
10.1111/bjet.12893
10.1016/j.asej.2020.07.011
10.3139/120.111478
10.1007/s11162-018-9521-3
ContentType Journal Article
Copyright Copyright © 2022 Ting Li et al.
Copyright © 2022 Ting Li et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0
Copyright_xml – notice: Copyright © 2022 Ting Li et al.
– notice: Copyright © 2022 Ting Li et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0
DBID RHU
RHW
RHX
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1155/2022/2565639
DatabaseName Hindawi Publishing Complete
Hindawi Publishing Subscription Journals
Hindawi Publishing Open Access
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList CrossRef
Technology Research Database

Database_xml – sequence: 1
  dbid: RHX
  name: Hindawi Publishing Open Access
  url: http://www.hindawi.com/journals/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1939-0122
Editor Chen, Chin-Ling
Editor_xml – sequence: 1
  givenname: Chin-Ling
  surname: Chen
  fullname: Chen, Chin-Ling
EndPage 13
ExternalDocumentID 10_1155_2022_2565639
GeographicLocations China
GeographicLocations_xml – name: China
GrantInformation_xml – fundername: Hunan Normal University
– fundername: Hunan University
GroupedDBID .4S
.DC
05W
0R~
123
1OC
3SF
4.4
52U
5DZ
66C
8-1
8UM
AAESR
AAFWJ
AAJEY
AAONW
ACGFO
ADBBV
ADIZJ
AENEX
AFBPY
AFKRA
AJXKR
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ARCSS
ATUGU
AZVAB
BCNDV
BENPR
BGLVJ
BHBCM
BNHUX
BOGZA
BRXPI
CCPQU
CS3
DR2
DU5
EBS
EIS
F1Z
G-S
GROUPED_DOAJ
HCIFZ
HZ~
IAO
ICD
ITC
IX1
K7-
LITHE
MY.
MY~
NNB
O9-
OIG
OK1
P2P
PIMPY
RHU
RHW
RHX
TH9
TUS
W99
WBKPD
XV2
24P
AAMMB
AAYXX
ACCMX
ADMLS
AEFGJ
AGXDD
AIDQK
AIDYY
ALUQN
CITATION
H13
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c337t-e48924c851e7e45035c2e214f3e05922261fed9283f28624e7cd64a76abe8f833
IEDL.DBID RHX
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000817610400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1939-0114
IngestDate Fri Jul 25 20:53:25 EDT 2025
Sat Nov 29 02:59:39 EST 2025
Tue Nov 18 21:11:01 EST 2025
Sun Jun 02 18:53:02 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c337t-e48924c851e7e45035c2e214f3e05922261fed9283f28624e7cd64a76abe8f833
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-5730-8231
OpenAccessLink https://dx.doi.org/10.1155/2022/2565639
PQID 2680911699
PQPubID 1046363
PageCount 13
ParticipantIDs proquest_journals_2680911699
crossref_citationtrail_10_1155_2022_2565639
crossref_primary_10_1155_2022_2565639
hindawi_primary_10_1155_2022_2565639
PublicationCentury 2000
PublicationDate 2022-06-14
PublicationDateYYYYMMDD 2022-06-14
PublicationDate_xml – month: 06
  year: 2022
  text: 2022-06-14
  day: 14
PublicationDecade 2020
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle Security and communication networks
PublicationYear 2022
Publisher Hindawi
John Wiley & Sons, Inc
Publisher_xml – name: Hindawi
– name: John Wiley & Sons, Inc
References 11
22
E. Olivares Benitez (18) 2021; 8
15
Y. V. Ermanto (6) 2022; 5
16
Z. Zaeniah (10) 2020; 16
17
W. D. Pahlawanti (1) 2020; 23
N. G. A. H. Saptarini (13) 2020; 9
M. Tomić (12)
2
3
4
5
A. K. Nugroho (7) 2022; 7
X. Wang (9) 2022
P. Wang (14)
R. Parks (8) 2021; 96
20
H. Rashidi (19) 2020; 7
21
References_xml – ident: 3
  doi: 10.1111/josh.12865
– volume: 7
  start-page: 91
  issue: 2
  year: 2022
  ident: 7
  article-title: Optimizing course scheduling faculty of engineering unsoed using genetic algorithms
  publication-title: JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer)
  doi: 10.33480/jitk.v7i2.2262
– volume: 23
  start-page: 324
  issue: 1
  year: 2020
  ident: 1
  article-title: The influence of school principal supervision and school committee participation on the quality of junior high school education
  publication-title: International Journal of Progressive Sciences and Technologies
– ident: 2
  doi: 10.21061/jcte.v34i1.a1
– volume: 16
  start-page: 241
  issue: 2
  year: 2020
  ident: 10
  article-title: Designing class schedule information system by using taboo-search method
  publication-title: Pilar Nusa Mandiri: Journal of Computing and Information System
– volume: 9
  start-page: 386
  issue: 1
  year: 2020
  ident: 13
  article-title: A custom-based crossover technique in genetic algorithm for course scheduling problem
  publication-title: TEM Journal
  doi: 10.18421/TEM91-53
– ident: 22
  doi: 10.1080/09540091.2019.1700912
– ident: 16
  doi: 10.54216/ijns.010104
– ident: 15
  doi: 10.3991/ijet.v16i01.18225
– ident: 5
  doi: 10.1177/2167696820916639
– start-page: 69
  issue: 6
  year: 2022
  ident: 9
  article-title: Design and application of experiment teaching arrangement system
  publication-title: Technology Wind
– ident: 20
  doi: 10.1080/00207543.2020.1717008
– volume: 96
  start-page: 39
  issue: 2
  year: 2021
  ident: 8
  article-title: Room scheduling: a dependent variable to reduce the spread of COVID-19
  publication-title: College & University
– start-page: 121
  ident: 14
  article-title: An improved adaptive genetic algorithm and its application in intelligent course scheduling system
– ident: 4
  doi: 10.1111/bjet.12893
– volume: 7
  start-page: 221
  issue: 3
  year: 2020
  ident: 19
  article-title: A deep-belief network approach for course scheduling
  publication-title: Journal of Applied Research on Industrial Engineering
– ident: 21
  doi: 10.1016/j.asej.2020.07.011
– ident: 17
  doi: 10.3139/120.111478
– volume: 5
  start-page: 05
  issue: 1
  year: 2022
  ident: 6
  article-title: Comparison of welch-powell and recursive largest first algorithm implementation in course scheduling
  publication-title: Journal of Management Science (JMAS)
– volume: 8
  start-page: 176
  issue: 2
  year: 2021
  ident: 18
  article-title: Multi-objective design of balanced sales territories with taboo search: a practical case
  publication-title: International Journal of Supply and Operations Management
– ident: 11
  doi: 10.1007/s11162-018-9521-3
– start-page: 271
  ident: 12
  article-title: A heuristic approach in solving the optimal seating chart problem
SSID ssj0061474
Score 2.2719111
Snippet With the gradual expansion of college scale, the professional categories in colleges and universities are becoming more and more complete, and the volume of...
SourceID proquest
crossref
hindawi
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Ant colony optimization
Classrooms
Colleges & universities
Curricula
Deep learning
Fitness
Genetic algorithms
Higher education
Linear programming
Optimization algorithms
Raster
Schedules
Scheduling
Students
Task scheduling
Teachers
Teaching
Title Design of College Scheduling Algorithm Based on Improved Genetic Ant Colony Hybrid Optimization
URI https://dx.doi.org/10.1155/2022/2565639
https://www.proquest.com/docview/2680911699
Volume 2022
WOSCitedRecordID wos000817610400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 1939-0122
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0061474
  issn: 1939-0114
  databaseCode: 24P
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDI7YBBIcEE8xGFMO44QqyKNNehyPaacx8ZB2q5o03SZtLdoKiH9P3KUImBDcWsnxwU5sf4kfCLWlUJLEgntKJcLjCTFeqOLUI4JBd_GQU6HKYROi35fDYThwTZIWq0_41tsBPKcXFAIPFtZQTfqwee97w8rgWgcj3OMxpP4QXuW3_1j7zfNsjAHyvk1WTHDpV7o7aNsFhLiz1OAuWjPZHtr60iZwH0U3ZZoFzlPscD5-sLJOIIl8hDvTUW4R_niGr6xHSnCe4eVNgf2GptKWL-5kBSy1SB_33qFGC99ZUzFzNZgH6Kl7-3jd89xgBE8zJgrPcGlhk7bBkhGG-5fM19RQwlNmbLRkPX5AUpOENnJIKRSAGKGTgMciiJWRqWTsENWzPDNHCOs4Nia1fDRcLTKlhOSGKF-FGjSlGui8ElqkXddwGF4xjUr04PsRiDhyIm6gs0_q52W3jF_o2k7-f5A1K-VE7mgtIhpIG-OQIAyP_8flBG3CL-R3Ed5E9WL-Yk7Run4tJot5C9UoH7TKDfUBMmXAyg
linkProvider Hindawi Publishing
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Design+of+College+Scheduling+Algorithm+Based+on+Improved+Genetic+Ant+Colony+Hybrid+Optimization&rft.jtitle=Security+and+communication+networks&rft.au=Li%2C+Ting&rft.au=Xie%2C+Qiang&rft.au=Zhang%2C+Hua&rft.date=2022-06-14&rft.issn=1939-0114&rft.eissn=1939-0122&rft.volume=2022&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1155%2F2022%2F2565639&rft.externalDBID=n%2Fa&rft.externalDocID=10_1155_2022_2565639
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1939-0114&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1939-0114&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1939-0114&client=summon