The effect of neighborhood structures on tabu search algorithm in solving university course timetabling problem

2014 ◽  
Author(s):  
Ali Shakir ◽  
Belal AL-Khateeb ◽  
Khalid Shaker ◽  
Hamid A. Jalab
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Neighborhood Structures ◽  
Course Timetabling Problem ◽  
University Course

AN ADAPTED CUCKOO OPTIMIZATION ALGORITHM AND GENETIC ALGORITHM APPROACH TO THE UNIVERSITY COURSE TIMETABLING PROBLEM

2014 ◽  
Vol 13 (01) ◽  
pp. 1450002 ◽  
Author(s):  
CHONG KEAT TEOH ◽  
ANTONI WIBOWO ◽  
MOHD. SALIHIN NGADIMAN
Keyword(s):  
Optimization Algorithm ◽  
Search Algorithm ◽  
Problem Instance ◽  
Cuckoo Optimization Algorithm ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University

The university course timetabling problem is an NP-hard and NP-complete problem concerned with assigning a specific set of events and resources to timeslots under a highly-constrained search space. This paper presents a novel metaheuristic algorithm entitled adapted cuckoo optimization algorithm which is derived from the cuckoo optimization algorithm and cuckoo search algorithm. This algorithm includes features such as local random walk on discrete data which mimics the behavior of Lévy flights and an Elitism-based mechanism which echoes back the best candidate solutions and prevents the algorithm from plunging into a curse of dimensionality. The algorithm was tested on a problem instance gathered from a University in Malaysia and the results indicate that the proposed algorithm exhibits very promising results in terms of solution quality and computational speed when compared to genetic algorithms.

scholarly journals B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem

2013 ◽  
Vol 3 (4) ◽  
pp. 251-263 ◽  
Author(s):  
Marco Antonio Cruz Chvez ◽  
Alina Martnez Oropeza
Keyword(s):  
Complexity Analysis ◽  
Search Algorithm ◽  
Binary Search ◽  
Tree Search ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University

Abstract This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.

scholarly journals A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

DYNA ◽  
2020 ◽  
Vol 87 (215) ◽  
pp. 47-56
Author(s):  
Javier Arias-Osorio ◽  
Andrés Mora-Esquivel
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Academic Program ◽  
Mixed Integer ◽  
Computational Time ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course

In this study, we address the current issues that usually manifest during the programming of university courses, classified as University Course Timetabling Problem, which is considered as a NP-hard problem due to the high computational demand that it requires.To solve the problem, a Mixed Integer Linear Programming model is proposed, which serves as a reference when dimensioning the problem and the restrictions that must be considered. Next, a hybrid metaheuristic method is designed based on the HGATS algorithm, Hybrid Genetic Algorithm Tabu Search Approach, developed by [16], which combines the diversification capacity of the Genetic Algorithm with the strategy of intensification of the Tabu Search Algorithm. Finally, the validation of the proposed algorithm is performed using the data from the programming of the classes from the academic periods 2018-1 and 2018-2 for the academic program of Industrial Engineering at the Industrial University of Santander, obtaining interesting solutions in a reasonable computational time, being that the process of organizing the schedule by the coordinator can last from hours to days, depending on your ability.  

scholarly journals PENERAPAN ALGORITMA TABU SEARCH DALAM PROSES PENJADWALAN PADA APLIKASI PENJADWALAN KURSUS MOBIL BERBASIS ANDROID

2018 ◽  
Vol 4 (2) ◽  
Author(s):  
Tri Sutrisno
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Client Server ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
Course Timetabling Problem

Aditya, F. dan Handoyo, E. (2011). �Perbandingan Paid Hosting dan Free Hosting Berdasarkan Fasilitas Backup yang ada�, Jurnal Teknologi, VOL. 4, NO. 1, JUNI 2011, h. 1-5.Akhmad, Dharma Kasman. (2015). Aplikasi Pemesanan Tiket Online Berbasis Web & PHP. Cirebon : CV. ASFA SolutionAladag, C. H. and Hocaoglu, G. (2007). A Tabu Search Algorithm to Solve A Course Timetabling Problem. Haccettepe Journal of Mathematics and Statistics Volume 36 (1) (2007), 53-64.A.S, Rosa. (2011).� Modul Pembelajaran Rekayasa Perangkat Lunak. Bandung : ModulaA.S, Rosa dan M. Salahuddin. (2015). Rekayasa Perangkat Lunak Terstruktur dan Berorientasi Objek. Bandung : Informatika BandungBudi Sutedjo, Dharma Oetomo dkk. (2006). Konsep dan Aplikasi Pemrograman Client Server dan Sistem Terdistribusi. Yogyakarta: Penerbit ANDIEfendi, I.(2014).Pengertian Domain dan Hosting.[Online]. Tersedia :http://www.it-jurnal.com/2014/11/pengertian-domain-dan-hosting.html [11 Mei 2016]Ginting, Rosnani. (2009), Penjadwalan Mesin, Penerbit Graha Ilmu, YogyakartaHakim, Lukmanul. (2008). Membongkar Trik Rahasia Para Master PHP.��������� Yogyakarta : Lokomedia.Jogiyanto. (2006). Sistem Informasi Manajemen, Andi Offset, Yogyakarta.

Sign in / Sign up

Export Citation Format

Share Document