Memetic algorithms for timerabling problems in pricate schools

Aldoğan, Deniz
The aim of this study is to introduce a real-world timetabling problem that exists in some private schools in Turkey and to solve such problem instances utilizing memetic algorithms. Being a new type of problem and for privacy reasons, there is no real data available. Hence for benchmarking purposes, a random data generator has been implemented. Memetic algorithms (MAs) combining genetic algorithms and hill-climbing are applied to solve synthetic problem instances produced by this generator. Different types of recombination and mutation operators based on the hierarchical structure of the timetabling problem are proposed. A modified version of the violation directed hierarchical hill-climbing method (VDHC), introduced by A. Alkan and E. Ozcan, coordinates the process of 12 different low-level hill-climbing operators grouped in two distinct arrangements that attempt to resolve corresponding constraint violations. VDHC is an adaptive method advocating cooperation of hill-climbing operators. In addition, MAs with VDHC are compared with different versions of multimeme algorithms and pure genetic algorithms. Experimental results on synthetic benchmark data set indicate the success of the proposed MA.


Modelling and predicting binding affinity of PCP-like compounds using machine learning methods
Erdaş, Özlem; Alpaslan, Ferda Nur; Department of Computer Engineering (2007)
Machine learning methods have been promising tools in science and engineering fields. The use of these methods in chemistry and drug design has advanced after 1990s. In this study, molecular electrostatic potential (MEP) surfaces of PCP-like compounds are modelled and visualized in order to extract features which will be used in predicting binding affinity. In modelling, Cartesian coordinates of MEP surface points are mapped onto a spherical self-organizing map. Resulting maps are visualized by using values...
A systematic study of probabilistic aggregation strategies in swarm robotic systems
Soysal, Onur; Şahin, Erol; Department of Computer Engineering (2005)
In this study, a systematic analysis of probabilistic aggregation strategies in swarm robotic systems is presented. A generic aggregation behavior is proposed as a combination of four basic behaviors: obstacle avoidance, approach, repel, and wait. The latter three basic behaviors are combined using a three-state finite state machine with two probabilistic transitions among them. Two different metrics were used to compare performance of strategies. Through systematic experiments, how the aggregation performa...
An information system re-structuring study for the financial inspection board
Yıldırım, Meltem; Bilgen, Semih; Department of Information Systems (2004)
With the scope of this study, certain tasks of the finance inspectors have been restructured by means of information technology in an effective way. The new structure has been integrated to the Internet technology and thus can eliminate the problems of time and place. The Documentation and Personnel Departments of FIB have been chosen for piloting and performance assesment has been performed after the restructuring with new technology. The result of the assesment suggest that, when compared to the old syste...
Trusted mail gateway
Ayla, Erkut Sinan; Özgit, Attila; Department of Computer Engineering (2004)
The study aims to make contribution to solve mail security problems. The Trusted Mail Gateway provides a domain with the basic security services that are message integrity, confidentiality, non-repudiation, origin authentication and availability while message (e-mail) being delivered through the Internet. It generates S/MIME digital signatures and performs S/MIME encryption on behalf of the domain using secret key cryptography and public-key techniques and generating Cryptographic Message Syntax (CMS) data ...
Using collaboration diagrams in component oriented modelin
Tuncel, Mehmet Burhan; Doğru, Ali Hikmet; Department of Computer Engineering (2006)
Component Oriented Software Engineering (COSE) seems to be the future of software engineering. Currently, COSEML is the only modeling language that completely supports the COSE approach. Abstract decomposition of the system and their representing components are shown in a hierarchy diagram to support the COSE process model. In COSEML, only static modeling is supported through this single diagram. However, software is about behavior and static modeling is not sufficient to describe the system. The aim of thi...
Citation Formats
D. Aldoğan, “Memetic algorithms for timerabling problems in pricate schools,” M.S. - Master of Science, Middle East Technical University, 2005.