Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Dynamic Timetabling Using Reactive Constraint Agents

View through CrossRef
Kebanyakan teknik yang diimplimentasi bagi menyelesaikan masalah penjadualan tertumpu kepada proses yang statik. Walau bagaimanapun, di dalam dunia sebenar, masalah penjadualan merupakan satu masalah yang terbuka, dinamik dan sentiasa berubah–ubah mengikut kekangan dan andaian. Oleh yang demikian, objektif utama kertas ini adalah untuk mengendalikan perubahanperubahan yang berlaku setelah jadual waktu awalan terhasil. Agen Kekangan Reaktif (AKR) telah diimplimentasi lebih khusus dan berkeupayaan membaiki dan mengubahsuai jadual waktu secara bertahap dengan komunikasi dan kerjasama di antara satu sama lain bagi mengekalkan kesauran jadual waktu tersebut. Seni bina AKR ini telah dilaksana dan diuji dengan menggunakan data sebenar iaitu data dari Fakulti Sains, Universiti Ibb, Yemen. Hasil kajian menunjukkan bahawa AKR berupaya mengendalikan perubahan–perubahan dalam masa nyata dengan pembaikan yang minimum ke atas jadual waktu asal. Kata kunci: Masalah penjadualan waktu, penjadualan waktu dinamik, pengaturcaraan terhad, agen perisian, seni bina agen terbuka Most of the approaches that have been applied to solve the timetabling problems focus on the construction of the timetable as a static process. In real world, the timetabling problems are dynamic and open problems since the initial timetable is not fixed and it is required to be changed as the constraints or assumptions on which the timetable is based on, are changed or became invalid. Therefore, the main objective of this paper is to handle the changes after generating the initial timetable. The Reactive Constraint Agents (RCA) architecture is capable of repairing and modifying the timetable gradually by communicating and cooperating with each other to maintain the timetable feasibility. This architecture has been implemented and tested using real data from Faculty of Science, University of Ibb – Yemen. The results show that the RCA can cope with the changes in real–time with minimal modification to the existing timetable. Key words: Timetabling problem, dynamic timetabling, constraints programming, software agents, open agent architecture
Title: Dynamic Timetabling Using Reactive Constraint Agents
Description:
Kebanyakan teknik yang diimplimentasi bagi menyelesaikan masalah penjadualan tertumpu kepada proses yang statik.
Walau bagaimanapun, di dalam dunia sebenar, masalah penjadualan merupakan satu masalah yang terbuka, dinamik dan sentiasa berubah–ubah mengikut kekangan dan andaian.
Oleh yang demikian, objektif utama kertas ini adalah untuk mengendalikan perubahanperubahan yang berlaku setelah jadual waktu awalan terhasil.
Agen Kekangan Reaktif (AKR) telah diimplimentasi lebih khusus dan berkeupayaan membaiki dan mengubahsuai jadual waktu secara bertahap dengan komunikasi dan kerjasama di antara satu sama lain bagi mengekalkan kesauran jadual waktu tersebut.
Seni bina AKR ini telah dilaksana dan diuji dengan menggunakan data sebenar iaitu data dari Fakulti Sains, Universiti Ibb, Yemen.
Hasil kajian menunjukkan bahawa AKR berupaya mengendalikan perubahan–perubahan dalam masa nyata dengan pembaikan yang minimum ke atas jadual waktu asal.
Kata kunci: Masalah penjadualan waktu, penjadualan waktu dinamik, pengaturcaraan terhad, agen perisian, seni bina agen terbuka Most of the approaches that have been applied to solve the timetabling problems focus on the construction of the timetable as a static process.
In real world, the timetabling problems are dynamic and open problems since the initial timetable is not fixed and it is required to be changed as the constraints or assumptions on which the timetable is based on, are changed or became invalid.
Therefore, the main objective of this paper is to handle the changes after generating the initial timetable.
The Reactive Constraint Agents (RCA) architecture is capable of repairing and modifying the timetable gradually by communicating and cooperating with each other to maintain the timetable feasibility.
This architecture has been implemented and tested using real data from Faculty of Science, University of Ibb – Yemen.
The results show that the RCA can cope with the changes in real–time with minimal modification to the existing timetable.
Key words: Timetabling problem, dynamic timetabling, constraints programming, software agents, open agent architecture.

Related Results

Aligning functional network constraint to evolutionary outcomes
Aligning functional network constraint to evolutionary outcomes
Summary It is likely that there are constraints on how evolution can progress, and well-known evolutionary phenomena such as convergent evolution, rapid adaptation,...
Pengurangan Work In Process Inventory di Stasiun Kerja Bottleneck Menggunakan Pendekatan Theory Of Constraint (TOC)
Pengurangan Work In Process Inventory di Stasiun Kerja Bottleneck Menggunakan Pendekatan Theory Of Constraint (TOC)
Abstract. CV. Pustaka Setia is a company engaged in publishing and printing books. The obstacle experienced by CV Pustaka Setia is the occurrence of accumulation (Work In Process i...
Ant colony optimisation for solving university course timetabling problems
Ant colony optimisation for solving university course timetabling problems
Course timetabling is one of the most important activities faced by any educational institution. Furthermore, the course timetabling process is time-consuming and tiresome as it ne...
A study on optimization methods for solving course timetabling problem in university
A study on optimization methods for solving course timetabling problem in university
Course timetabling is one of the most important processes faced by any educational institution. However, the course timetabling process is time consuming and tiresome as it needs t...
Modeling and Solving a Latin American University Course Timetabling Problem Instance
Modeling and Solving a Latin American University Course Timetabling Problem Instance
Timetabling problem is a complex task that is performed by a number of institutions worldwide, which has been usually addressed as an optimization problem where every approach cons...
A Comparative Study of Modern Heuristics on the School Timetabling Problem
A Comparative Study of Modern Heuristics on the School Timetabling Problem
In this contribution a comparative study of modern heuristics on the school timetabling problem is presented. More precisely, we investigate the application of two population-based...
Optimization in University Student Timetables: A Comprehensive Literature Review
Optimization in University Student Timetables: A Comprehensive Literature Review
The University Course Timetabling Problem presents a complex optimization problem as it seeks to meet the diverse requirements and constraints of a university's academic program th...

Back to Top