[HTML][HTML] Genetic algorithm based on natural selection theory for optimization problems
The metaheuristic genetic algorithm (GA) is based on the natural selection process that falls
under the umbrella category of evolutionary algorithms (EA). Genetic algorithms are typically …
under the umbrella category of evolutionary algorithms (EA). Genetic algorithms are typically …
An assignment problem and its application in education domain: A review and potential path
S Faudzi, S Abdul-Rahman… - Advances in Operations …, 2018 - Wiley Online Library
This paper presents a review pertaining to assignment problem within the education
domain, besides looking into the applications of the present research trend, developments …
domain, besides looking into the applications of the present research trend, developments …
A systematic mapping study on solving university timetabling problems using meta-heuristic algorithms
A Bashab, AO Ibrahim, EE AbedElgabar… - Neural Computing and …, 2020 - Springer
Since university timetabling is commonly classified as a combinatorial optimisation problem,
researchers tend to use optimisation approaches to reach the optimal timetable solution …
researchers tend to use optimisation approaches to reach the optimal timetable solution …
Artificial bee colony based on adaptive search strategy and random grouping mechanism
As a popular global optimization algorithm, artificial bee colony (ABC) has strong search
ability and simple concept. However, ABC has some deficiencies. The exploitation ability of …
ability and simple concept. However, ABC has some deficiencies. The exploitation ability of …
A fast simulated annealing algorithm for the examination timetabling problem
The timetabling problem involves the scheduling of a set of entities (eg, lectures, exams,
vehicles, or people) to a set of resources in a limited number of time slots, while satisfying a …
vehicles, or people) to a set of resources in a limited number of time slots, while satisfying a …
[PDF][PDF] Neighborhood search methods with moth optimization algorithm as a wrapper method for feature selection problems.
Feature selection methods are used to select a subset of features from data, therefore only
the useful information can be mined from the samples to get better accuracy and improves …
the useful information can be mined from the samples to get better accuracy and improves …
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
Abstract We propose a Simulated Annealing approach for the Examination Timetabling
problem, in the classical uncapacitated formulation of Carter et al.(1996). Our solver is …
problem, in the classical uncapacitated formulation of Carter et al.(1996). Our solver is …
Kidney-inspired algorithm for optimization problems
NS Jaddi, J Alvankarian, S Abdullah - Communications in Nonlinear …, 2017 - Elsevier
In this paper, a population-based algorithm inspired by the kidney process in the human
body is proposed. In this algorithm the solutions are filtered in a rate that is calculated based …
body is proposed. In this algorithm the solutions are filtered in a rate that is calculated based …
Intelligent matching: Supply chain management and financial accounting technology
The main objective of this paper is to investigate the effect of accounting Fintech, Financial
Technology Matching (FTM) and Supply Chain Management (SCM) in Jordanian …
Technology Matching (FTM) and Supply Chain Management (SCM) in Jordanian …
[HTML][HTML] Hybrid intelligent water Drops algorithm for examination timetabling problem
The current study investigates the Intelligent Water Drops (IWD) metaheuristic algorithm to
construct and produce good quality solutions for the university examination timetabling …
construct and produce good quality solutions for the university examination timetabling …