78 research outputs found
Some Experiences with Hybrid Genetic Algorithms in Solving the Uncapacitated Examination Timetabling Problem
This paper provides experimental experiences on two local search hybridized
genetic algorithms in solving the uncapacitated examination timetabling
problem. The proposed two hybrid algorithms use partition and priority based
solution representations which are inspired from successful genetic algorithms
proposed for graph coloring and project scheduling problems, respectively. The
algorithms use a parametrized saturation degree heuristic hybridized crossover
scheme. In the experiments, the algorithms firstly are calibrated with a Design
of Experiments approach and then tested on the well-known Toronto benchmark
instances. The calibration shows that the hybridization prefers an intensive
local search method. The experiments indicate the vitality of local search in
the proposed genetic algorithms, however, experiments also show that the
hybridization benefits local search as well. Interestingly, although the
structures of the two algorithms are not alike, their performances are quite
similar to each other and also to other state-of-the-art genetic-type
algorithms proposed in the literature
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
جدولة أوقات الدروس في الأقسام الكبيرة في الجامعات تعتبر مشكلة صعبة للغاية وغالبًا ما يتم حلها من قبل الموظفين على الرغم من أن النتائج مثالية بشكل جزئي. لقد حدت للغاية مشكلة جدولة الوقت من مشكلة التحسين التوافقي، يهدف هذا العمل تطبيق مبدأ الخوارزمية التطورية باستخدام النظريات الوراثية لحل مشكلة الجدولة الزمنية في محاولة الحصول على جدول زمني عشوائي ومثالي مع القدرة على إنشاء جدول زمني متعدد الاحتمالات ومثالي بشكل كامل لكل مرحلة دراسية في القسم المعني وبما يتلاءم مع القيود التي يفرضها الطلبة والكادر التدريسي وضمن ساعات عمل محددة مسبقا. تتمثل الفكرة الرئيسية في امكانية إنشاء جداول زمنية للدروس بطريقة تلقائية بعد تحديد الشروط المجدية للحصول على جدول زمني مرن ومثالي بدون تكرار من خلال تقديم جدول زمني قابل للتبديل والتدوير. تكمن المساهمة الرئيسية في هذا العمل من خلال زيادة مرونة توليد جداول زمنية مثالية بنسخ مختلفة من خلال زيادة احتمال إعطاء أفضل جدول زمني لكل مرحلة في الحرم الجامعي مع القدرة على استبدال الجدول الزمني عند الحاجة. الخوارزمية التطورية (EA) المستخدمة في هذه الورقة هي الخوارزمية الجينية (GA) التي هي عبارة عن بحث متعدد الحلول يعتمد على عدد المجتمع التطوري الذي يمكن تطبيقه لحل مشاكل معقدة مثل مشاكل الجدول الزمني. في هذا العمل، جميع المدخلات: الدروس والكادر التدريسي والوقت قد تمثلت بمجموعة واحدة لتحقيق البحث المحلي ودمج هذا التمثيل للجدول الزمني باستخدام التبادل الموجه لضمان عدم خرق الشروط الأساسية التي تم تحديدها مسبقا كدالة تطابق. قدمت النتائج نظام جدولة مرن حيث اظهرت نتائج الاختبار تنوع جميع الجداول الزمنية الممكنة التي يمكن إنشاؤها بما يتلاءم مع شروط المستخدم وحاجاته.Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating optimal timetable schedules with different copies by increasing the probability of giving the best schedule for each stage in the campus with the ability to replace the timetable when needed. The Evolutionary Algorithm (EA) utilized in this paper is the Genetic Algorithm (GA) which is a common multi-solution metaheuristic search based on the evolutionary population that can be applied to solve complex combinatorial problems like timetabling problems. In this work, all inputs: courses, teachers, and time acted by one array to achieve local search and combined this acting of the timetable by using the heuristic crossover to ensure that the essential conditions are not broken. The result of this work is a flexible scheduling system, which shows the diversity of all possible timetables that can be created depending on user conditions and needs
Performance Analyses of Graph Heuristics and Selected Trajectory Metaheuristics on Examination Timetable Problem
Examination timetabling problem is hard to solve due to its NP-hard nature, with a large number of constraints having to be accommodated. To deal with the problem effectually, frequently heuristics are used for constructing feasible examination timetable while meta-heuristics are applied for improving the solution quality. This paper presents the performances of graph heuristics and major trajectory metaheuristics or S-metaheuristics for addressing both capacitated and un-capacitated examination timetabling problem. For constructing the feasible solution, six graph heuristics are used. They are largest degree (LD), largest weighted degree (LWD), largest enrolment degree (LE), and three hybrid heuristic with saturation degree (SD) such as SD-LD, SD-LE, and SD-LWD. Five trajectory algorithms comprising of tabu search (TS), simulated annealing (SA), late acceptance hill climbing (LAHC), great deluge algorithm (GDA), and variable neighborhood search (VNS) are employed for improving the solution quality. Experiments have been tested on several instances of un-capacitated and capacitated benchmark datasets, which are Toronto and ITC2007 dataset respectively. Experimental results indicate that, in terms of construction of solution of datasets, hybridizing of SD produces the best initial solutions. The study also reveals that, during improvement, GDA, SA, and LAHC can produce better quality solutions compared to TS and VNS for solving both benchmark examination timetabling datasets
A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems
Hyper-heuristics are search methodologies that aim to provide high-quality solutions across a wide variety of problem domains, rather than developing tailor-made methodologies for each problem instance/domain. A traditional hyper-heuristic framework has two levels, namely, the high level strategy (heuristic selection mechanism and the acceptance criterion) and low level heuristics (a set of problem specific heuristics). Due to the different landscape structures of different problem instances, the high level strategy plays an important role in the design of a hyper-heuristic framework. In this paper, we propose a new high level strategy for a hyper-heuristic framework. The proposed high-level strategy utilizes a dynamic multiarmed bandit-extreme value-based reward as an online heuristic selection mechanism to select the appropriate heuristic to be applied at each iteration. In addition, we propose a gene expression programming framework to automatically generate the acceptance criterion for each problem instance, instead of using human-designed criteria. Two well-known, and very different, combinatorial optimization problems, one static (exam timetabling) and one dynamic (dynamic vehicle routing) are used to demonstrate the generality of the proposed framework. Compared with state-of-the-art hyper-heuristics and other bespoke methods, empirical results demonstrate that the proposed framework is able to generalize well across both domains. We obtain competitive, if not better results, when compared to the best known results obtained from other methods that have been presented in the scientific literature. We also compare our approach against the recently released hyper-heuristic competition test suite. We again demonstrate the generality of our approach when we compare against other methods that have utilized the same six benchmark datasets from this test suite
How to exploit fitness landscape properties of timetabling problem: A newoperator for quantum evolutionary algorithm
© 2020 Elsevier Ltd. All rights reserved. This is the accepted manuscript version of an article which has been published in final form at https://doi.org/10.1016/j.eswa.2020.114211The fitness landscape of the timetabling problems is analyzed in this paper to provide some insight into theproperties of the problem. The analyses suggest that the good solutions are clustered in the search space andthere is a correlation between the fitness of a local optimum and its distance to the best solution. Inspiredby these findings, a new operator for Quantum Evolutionary Algorithms is proposed which, during the searchprocess, collects information about the fitness landscape and tried to capture the backbone structure of thelandscape. The knowledge it has collected is used to guide the search process towards a better region in thesearch space. The proposed algorithm consists of two phases. The first phase uses a tabu mechanism to collectinformation about the fitness landscape. In the second phase, the collected data are processed to guide thealgorithm towards better regions in the search space. The algorithm clusters the good solutions it has foundin its previous search process. Then when the population is converged and trapped in a local optimum, itis divided into sub-populations and each sub-population is designated to a cluster. The information in thedatabase is then used to reinitialize the q-individuals, so they represent better regions in the search space.This way the population maintains diversity and by capturing the fitness landscape structure, the algorithmis guided towards better regions in the search space. The algorithm is compared with some state-of-the-artalgorithms from PATAT competition conferences and experimental results are presented.Peer reviewe
Educational timetabling: Problems, benchmarks, and state-of-the-art results
We propose a survey of the research contributions on the field of Educational Timetabling with a specific focus on “standard” formulations and the corresponding benchmark instances. We identify six of such formulations and we discuss their features, pointing out their relevance and usability. Other available formulations and datasets are also reviewed and briefly discussed. Subsequently, we report the main state-of-the-art results on the selected benchmarks, in terms of solution quality (upper and lower bounds), search techniques, running times, and other side settings
Towards the Design of Heuristics by Means of Self-Assembly
The current investigations on hyper-heuristics design have sprung up in two
different flavours: heuristics that choose heuristics and heuristics that
generate heuristics. In the latter, the goal is to develop a problem-domain
independent strategy to automatically generate a good performing heuristic for
the problem at hand. This can be done, for example, by automatically selecting
and combining different low-level heuristics into a problem specific and
effective strategy. Hyper-heuristics raise the level of generality on automated
problem solving by attempting to select and/or generate tailored heuristics for
the problem at hand. Some approaches like genetic programming have been
proposed for this. In this paper, we explore an elegant nature-inspired
alternative based on self-assembly construction processes, in which structures
emerge out of local interactions between autonomous components. This idea
arises from previous works in which computational models of self-assembly were
subject to evolutionary design in order to perform the automatic construction
of user-defined structures. Then, the aim of this paper is to present a novel
methodology for the automated design of heuristics by means of self-assembly
Cellular Harmony Search for Optimization Problems
Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its
neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the
genetic drift. Cellular automata concepts have been embedded to the process of EA in order to provide a decentralized method
in order to preserve the population structure. Harmony search (HS) is a recent EA that considers the whole individuals in the
breeding step. In this paper, the cellular automata concepts are embedded into the HS algorithm to come up with a new version
called cellular harmony search (cHS). In cHS, the population is arranged as a two-dimensional toroidal grid, where each individual
in the grid is a cell and only interacts with its neighbors.Thememory consideration and population update aremodified according
to cellular EA theory. The experimental results using benchmark functions show that embedding the cellular automata concepts
with HS processes directly affects the performance. Finally, a parameter sensitivity analysis of the cHS variation is analyzed and a
comparative evaluation shows the success of cHS
Structure based partial solution search for the examination timetabling problem.
Doctoral Degree. University of KwaZulu-Natal, Pietermaritzburg.The aim of this work is to present a new approach, namely, Structure Based Partial Solution
Search (SBPSS) to solve the Examination Timetabling Problem. The success of the
Developmental Approach in this problem domain suggested that the strategy of searching the
spaces of partial timetables whilst constructing them is promising and worth pursuing. This
work adopts a similar strategy. Multiple timetables are incrementally constructed at the same
time. The quality of the partial timetables is improved upon by searching their partial solution
spaces at every iteration during construction. Another key finding from the literature survey
revealed that although timetables may exhibit the same behaviour in terms of their objective
values, their structures or exam schedules may be different. The challenge with this finding is
to decide on which regions to pursue because some regions may not be worth investigating due
to the difficulty in searching them. These problematic areas may have solutions that are not
amenable to change which makes it difficult to improve them. Another reason is that the
neighbourhoods of solutions in these areas may be less connected than others which may restrict
the ability of the search to move to a better solution in that neighbourhood. By moving to these
problematic areas of the search space the search may stagnate and waste expensive
computational resources. One way to overcome this challenge is to use both structure and
behaviour in the search and not only behaviour alone to guide the search. A search that is guided
by structure is able to find new regions by considering the structural components of the
candidate solutions which indicate which part of the search space the same candidates occupy.
Another benefit to making use of a structure-based search is that it has no objective value bias
because it is not guided by only the objective value. This statement is consistent with the
literature survey where it is suggested that in order to achieve good performance the search
should not be guided by only the objective value. The proposed method has been tested on three popular benchmark sets for examination timetabling, namely, the Carter benchmark set; the
benchmark set from the International Timetabling competition in 2007 and the Yeditepe
benchmark set. The SBPSS found the best solutions for two of the Carter problem instances.
The SBPSS found the best solutions for four of the competition problem instances. Lastly, the
SBPSS improved on the best results for all the Yeditepe problem instances
- …