Variation operators for grouping genetic algorithms: A review
O Ramos-Figueroa, M Quiroz-Castellanos… - Swarm and Evolutionary …, 2021 - Elsevier
Grouping problems are combinatorial optimization problems, most of them NP-hard, related
to the partition of a set of items into different groups or clusters. Given their numerous real …
to the partition of a set of items into different groups or clusters. Given their numerous real …
A survey of search methodologies and automated system development for examination timetabling
Examination timetabling is one of the most important administrative activities that takes place
in all academic institutions. In this paper, we present a critical discussion of the research on …
in all academic institutions. In this paper, we present a critical discussion of the research on …
A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
Research in the domain of examination timetabling is moving towards developing methods
that generalise well over a range of problems. This is achieved by implementing hyper …
that generalise well over a range of problems. This is achieved by implementing hyper …
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems
S Abdullah, H Turabieh - information sciences, 2012 - Elsevier
Finding a good university timetabling system is not a simple task for a higher educational
organisation. As a result, many approaches to generating sufficiently good solutions have …
organisation. As a result, many approaches to generating sufficiently good solutions have …
[HTML][HTML] Grouping evolution strategies: An effective approach for grouping problems
Many combinatorial optimization problems include a grouping (or assignment) phase
wherein a set of items are partitioned into disjoint groups or sets. Introduced in 1994, the …
wherein a set of items are partitioned into disjoint groups or sets. Introduced in 1994, the …
Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework
(GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as …
(GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as …
A particle swarm optimizer for grouping problems
AH Kashan, MH Kashan, S Karimiyan - Information Sciences, 2013 - Elsevier
Many combinatorial optimization problems comprise a grouping phase (the grouping
problem) in which the task is to partition a set of items into disjoint sets. Introduced in 1994 …
problem) in which the task is to partition a set of items into disjoint sets. Introduced in 1994 …
Solving software module clustering problem by evolutionary algorithms
K Praditwong - 2011 Eighth International Joint Conference on …, 2011 - ieeexplore.ieee.org
Well organized software is easy to maintain but software modularization is complicated
because of the number of modules. Automated software module clustering is transformed to …
because of the number of modules. Automated software module clustering is transformed to …
An adaptive flex-deluge approach to university exam timetabling
This paper presents a new methodology for university exam timetabling problems, which
draws upon earlier work on the Great Deluge metaheuristic. The new method introduces a …
draws upon earlier work on the Great Deluge metaheuristic. The new method introduces a …
A constructive approach to examination timetabling based on adaptive decomposition and ordering
In this study, we investigate an adaptive decomposition and ordering strategy that
automatically divides examinations into difficult and easy sets for constructing an …
automatically divides examinations into difficult and easy sets for constructing an …