A study of heuristic combinations for hyper- heuristic systems for the uncapacitated examination timetabling problem Kuo-Hsien Chuang 2009/02/24.

Slides:

Advertisements

Similar presentations

Constraint Satisfaction Patrick Prosser. An Example, Exam Timetabling Someone timetables the exams We have a number of courses to examine how many? Dept.

Advertisements

HND Global Trade and Business Graded Units 1 and 2

Timetabling with Genetic Algorithms. Timetabling Problem Specifically university class timetabling Specifically university class timetabling Highly complex.

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.

Biologically Inspired Computation Really finishing off EC.

MANAGING PROJECT RESOURCES. Resource Allocation Problem  A shortcoming of most scheduling procedures is that they do not address the issues of resource.

Degree completion as an indication of quality Nigel Palmer College of Arts & Social Sciences Australian National University International Conference on.

Branch and Bound Optimization In an exhaustive search, all possible trees in a search space are generated for comparison At each node, if the tree is optimal.

Ant Colony Hyper-heuristics for Graph Colouring Nam Pham ASAP Group, Computer Science School University of Nottingham.

THE SINGLE MACHINE EARLY/TARDY PROBLEM* PENG SI OW & THOMAS E. MORTON IE Paper Presentation A. İrfan Mahmutoğulları *Ow, P. S., & Morton, T. E. (1989).

Study of mobile collaborative information system using distributed database architecture Mahmoud Abaza, Duane Cato A THABASCA U NIVERSITY.

Reinforcement Learning Rafy Michaeli Assaf Naor Supervisor: Yaakov Engel Visit project’s home page at: FOR.

Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 1 Ryan Kinworthy CSCE Advanced Constraint Processing.

A Hospital Placements Allocation Problem Stephen Cresswell and Lee McCluskey (paper to be presented at PlanSIG 2005)

Project Management: A Managerial Approach

Reporter : Mac Date : Multi-Start Method Rafael Marti.

An indirect genetic algorithm for a nurse scheduling problem Ya-Tzu, Chiang.

Better Ants, Better Life? Hybridization of Constraint Programming and Ant Colony Optimization Supervisors: Dr. Bernd Meyer, Dr. Andreas Ernst Martin Held.

1 Forming Hyper-heuristics with GAs when Solving 2D-Regular Cutting Stock Problems Kuo-Hsien Chuang 2009/03/24.

CITE Seminar 011 Development of automated school timetabling in Hong Kong Alvin Kwan CITE, Faculty of Education.

Software Verification and Validation (V&V) By Roger U. Fujii Presented by Donovan Faustino.

Article Title: Optimization model for resource assignment problems of linear construction projects ShuShun Liu & ChangJung Wang, National Yunlin University.

Optimal Scheduling for ICU Patients SIDDHANT BHATT STEVE BOYLE ERICA CUNNINGHAM.

SWORDS 2004 Ant Colony Optimisation Dr Jonathan Thompson, School of Mathematics, Cardiff University.

SBSE Course 4. Overview: Design Translate requirements into a representation of software Focuses on –Data structures –Architecture –Interfaces –Algorithmic.

Masquerade Detection Mark Stamp 1Masquerade Detection.

Chapter 6 System Engineering - Computer-based system - System engineering process - “Business process” engineering - Product engineering (Source: Pressman,

Nelishia Pillay School of Mathematics, Statistics and Computer Science University of KwZulu-Natal

Introduction to LEKIN Gareth Beddoe

Instant Design Challenge

Evaluation of a Hybrid Self-improving Instructional Planner Jon A. Elorriaga and Isabel Fernández-Castro Computer Languages and Systems Dept. University.

The Analysis Phase: Gathering Information. The Analysis Phase The “ Analysis Phase ” answers the questions of who will use the system, what the system.

The Effect of Computers on Student Writing: A Meta-Analysis of Studies from 1992 to 2002 Amie Goldberg, Michael Russell, & Abigail Cook Technology and.

A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.

The Value of Old Data: Trends in GSA Data Repository Usage Matt Hudson, Geological Society of America, 3300 Penrose Place, Boulder CO INTRODUCTION.

Final Year Project COMP390/393/394/395 Irina Biktasheva – coordinator

Multimedia Specification Design and Production 2013 / Semester 1 / week 9 Lecturer: Dr. Nikos Gazepidis

MANAGING PROJECT RESOURCES

Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.

University Course Timetabling with Soft Constraints Hana Rudova, Keith Murray Presented by: Marlien Edward.

Heuristic Optimization Methods Tabu Search: Advanced Topics.

Conceptual Database Design

FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)

Intel Confidential – Internal Only Co-clustering of biological networks and gene expression data Hanisch et al. This paper appears in: bioinformatics 2002.

1 Contents 1. Statement of Timetabling Problems 2. Approaches to Timetabling Problems 3. Some Innovations in Meta-Heuristic Methods for Timetabling University.

Taguchi. Abstraction Optimisation of manufacturing processes is typically performed utilising mathematical process models or designed experiments. However,

CprE 458/558: Real-Time Systems

Configuration Management and Change Control Change is inevitable! So it has to be planned for and managed.

How do I analyse data? Module 5. How do I analyse data?

1 An Approach to Accelerate Heuristic for Exam Timetabling Jiawei Li (Michael)

DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.

Daniel A. Keim, Hans-Peter Kriegel Institute for Computer Science, University of Munich 3/23/ VisDB: Database exploration using Multidimensional.

The Goldilocks Problem Tudor Hulubei Eugene C. Freuder Department of Computer Science University of New Hampshire Sponsor: Oracle.

I T & S A e r o s p a c eD e f e n c e Integration of a Multicriteria Decision Model in Constraint Programming F. Le Huédé M. Grabisch C. Labreuche P.

Introduction ESTIMATING THE MINIMALLY IMPORTANT DIFFERENCE (MID) OF THE DIABETES HEALTH PROFILE (DHP-18) FOR TYPE 1 AND TYPE 2 DIABETES MELLITIS Brendan.

STATISTICAL AND METHODOLOGICAL CONSIDERATIONS FOR EXAMINING PROGRAM EFFECTIVENESS Carli Straight, PhD and Giovanni Sosa, PhD Chaffey College RP Group Conference.

Tutorial: Hyper-heuristics and computational Intelligence

Objectives of the Session By the end of this session, it will be hoped to achieve the following objectives;  To understand the nature and scope of managerial.

Biologically Inspired Computing: Indirect Encodings, and Hyperheuristics This is DWC’s lecture 7 for `Biologically Inspired Computing’ Contents: direct.

(6) Estimating Computer’s efficiency Software Estimation The objective of Software Estimation is to provide the skills needed to accurately predict the.

University of Warwick, Department of Sociology, 2012/13 SO 201: SSAASS (Surveys and Statistics) (Richard Lampard) Survey Design: Some Implications for.

Shortcomings of Traditional Backtrack Search on Large, Tight CSPs: A Real-world Example Venkata Praveen Guddeti and Berthe Y. Choueiry The combination.

1 Sobah Abbas Petersen Adjunct Associate Professor, NTNU Researcher, Sintef TDT4252 Modelling of Information Systems Advanced Course TDT4252,

1 A latent information function to extend domain attributes to improve the accuracy of small-data-set forecasting Reporter ： Zhao-Wei Luo Che-Jung Chang,Der-Chiang.

CCEA Support Events GCE A2 3 CHEMISTRY Practical Assessment – Practical Techniques NEW FORMAT December 2014.

Timetable Problem solving using Graph Coloring

Final Year Project COMP390/393/394/395

Final Year Project COMP390/393/394/395

Evolutionary Algorithms and Hyper-Heuristics

Masters in Professional Practice Orientation Programme (MPPOP)

Presentation transcript:

A study of heuristic combinations for hyper- heuristic systems for the uncapacitated examination timetabling problem Kuo-Hsien Chuang 2009/02/24

Introduction The study presented in this paper tests the effect of combining low-level heuristics hierarchically. Low-level heuristics: –largest degree, largest enrolment, –largest weighted degree and saturation degree, and highest cost

The examination timetabling problem Scheduling a given set of exams in a given number of examination sessions Hard Constraint: –students should not be required to write two exams at the same time Soft Constraint: –students’ examinations must be well spaced over the timetable

The examination timetabling problem An examination timetabling problem may be capacitated or uncapacitated. Capacitated version: –Venue allocation is taken into consideration. Uncapacitated version: –This paper focuses on.

Previous work A vast amount of research has been conducted in the domain of examination timetabling with various methodologies being applied to the uncapacitated examination timetabling problem in an attempt to produce better quality timetables. The studies discussed thus far have focussed on improving the quality of timetables generated for the Carter benchmarks.

Previous work A more recent direction of research in the domain of examination timetabling is aimed at developing systems that generalise well over a range of problems rather than producing the best results for a few problems. This has led to the development of hyper- heuristic systems for the examination timetabling problem.

Previous work Hyper-heuristic systems producing combinations of low-level heuristics employ an optimisation technique to search the space of heuristic combinations.

Heuristic combinations and overall system Largest degree (LD) – The number of conflicts an examination is involved in. Largest enrolment (LE) – The number of students enrolled for the course. Largest weighted degree (LWD) – The examination with the largest number of conflicting students is scheduled first.

Heuristic combinations and overall system Saturation degree (SD) – The number of remaining periods that an exam can be allocated to without causing a clash, i.e. the number of feasible periods. Highest cost (HC) – The soft constraint cost of scheduling an examination given the current state of the timetable.

Heuristic combinations and overall system The heuristics LD, LE and LWD can be calculated prior to the construction process and remain static throughout the process. The values of SD and HC are dependant on the current status of the timetable and have to be recalculated after each exam allocation.

Heuristic combinations and overall system In this study each combination consists of p primary heuristics and a secondary heuristic, with p >= 2. Using a Pareto comparison to order the examinations

Heuristic combinations and overall system

Result and Discussion