Applying Metaheuristic Algorithm to the Admission Problem as a Combinatorial Optimisation Problem

被引:0
|
作者
Okewu, Emmanuel [1 ]
Misra, Sanjay [2 ]
机构
[1] Univ Lagos, Ctr Informat Technol & Syst, Lagos, Nigeria
[2] Covenant Univ, Dept Comp & Informat Sci, Ota, Nigeria
来源
ADVANCES IN DIGITAL TECHNOLOGIES | 2016年 / 282卷
关键词
Admission process; algorithm; combinatorial optimization problem; Metaheuristics; quality education;
D O I
10.3233/978-1-61499-637-8-53
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Prominent among the factors militating against quality education is poor student intake standards. This in the long run has multiplier effect on the quality of a nation's human capital. The role of human capital in national transformation cannot be overemphasized. However, the process of developing human resource for socio-economic transformation, particularly in an optimal sense, means conscious and concerted efforts must be geared towards meritocracy. Secondary education is reputed for bridging the gap between primary education and tertiary education. It particularly provides the gateway for career development as subjects taken at the senior level are tailored towards future career choices. To ensure that resources invested in education are well utilized, students' admission process has to be streamlined to secure best candidates specifically in gifted schools where competition is high. This paper formulated a computational strategy to upgrade admission process by reducing cost and time associated with it. Using a Nigerian University Secondary School as case study, the researchers applied a Metaheuristics search algorithm to the admission problem of securing the best candidates from a pool of applicants. The results supported the claims that Metaheuristics algorithms are capable of optimizing an admission process in terms of cost and speed.
引用
收藏
页码:53 / 64
页数:12
相关论文
共 50 条
  • [41] A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
    Huang, Baobin
    Tang, Lixin
    Baldacci, Roberto
    Wang, Gongshu
    Sun, Defeng
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (01) : 385 - 399
  • [42] A Quality and Distance Guided Metaheuristic Algorithm for Vertex Separation Problem
    Ding, Junwen
    Zhou, Taoqing
    Lu, Zhipeng
    Yuan, Yujin
    IEEE ACCESS, 2017, 5 : 19248 - 19258
  • [43] A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
    Gutierrez, Andres
    Dieulle, Laurence
    Labadie, Nacima
    Velasco, Nubia
    COMPUTERS & OPERATIONS RESEARCH, 2018, 99 : 135 - 147
  • [44] Solving the Container Relocation Problem by Using a Metaheuristic Genetic Algorithm
    Gulic, Marko
    Maglic, Livia
    Krljan, Tomislav
    Maglic, Lovro
    APPLIED SCIENCES-BASEL, 2022, 12 (15):
  • [45] Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
    Davendra, Donald
    Zelinka, Ivan
    Senkerik, Roman
    Pluhacek, Michal
    PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS (IBICA 2014), 2014, 303 : 141 - 150
  • [46] Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
    Davendra, Donald
    Zelinka, Ivan
    Senkerik, Roman
    Pluhacek, Michal
    Advances in Intelligent Systems and Computing, 2014, 303 : 141 - 150
  • [47] A COMBINATORIAL PROBLEM
    GOBEL, F
    SIAM REVIEW, 1970, 12 (01) : 151 - &
  • [48] A COMBINATORIAL PROBLEM
    LAFER, P
    LONG, CT
    AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (09): : 876 - &
  • [49] A COMBINATORIAL PROBLEM
    GREENWOO.RE
    AMERICAN MATHEMATICAL MONTHLY, 1963, 70 (02): : 177 - &
  • [50] A Combinatorial Problem
    K.L.Chung
    数学研究与评论, 1985, (01) : 108 - 108