A Hybrid Genetic Algorithm Approach to a Departmental Class Timetabling Problem Using Efficient Data Structures

2010 ◽  
Vol 1 (17) ◽  
pp. 117-121 ◽  
Author(s):  
Arvind.S. Babu ◽  
R. Chockalingam ◽  
S. Kavitha
Keyword(s):  
Genetic Algorithm ◽  
Data Structures ◽  
Hybrid Genetic Algorithm ◽  
Timetabling Problem ◽  
Efficient Data ◽  
Genetic Algorithm Approach ◽  
Efficient Data Structures

scholarly journals Genetic Algorithm for Exam Timetabling Problem - A Specific Case for Japanese University Final Presentation Timetabling

2020 ◽  
Author(s):  
Jiawei LI ◽  
Tad Gonsalves
Keyword(s):  
Genetic Algorithm ◽  
Real Data ◽  
Initial Population ◽  
Exam Timetabling ◽  
Timetabling Problem ◽  
Training Approach ◽  
Chromosome Representation ◽  
Genetic Algorithm Approach ◽  
Hard And Soft Constraints ◽  
Microsoft Office

This paper presents a Genetic Algorithm approach to solve a specific examination timetabling problem which is common in Japanese Universities. The model is programmed in Excel VBA programming language, which can be run on the Microsoft Office Excel worksheets directly. The model uses direct chromosome representation. To satisfy hard and soft constraints, constraint-based initialization operation, constraint-based crossover operation and penalty points system are implemented. To further improve the result quality of the algorithm, this paper designed an improvement called initial population pre-training. The proposed model was tested by the real data from Sophia University, Tokyo, Japan. The model shows acceptable results, and the comparison of results proves that the initial population pre-training approach can improve the result quality.

Efficient Data Structures for Range Selections Problem

2013 ◽  
Vol 756-759 ◽  
pp. 1387-1391
Author(s):  
Xiao Dong Wang ◽  
Jun Tian
Keyword(s):  
Data Structure ◽  
Linear Space ◽  
Data Structures ◽  
Computation Model ◽  
Word Size ◽  
Selection Problems ◽  
Efficient Data ◽  
Space Data ◽  
Efficient Data Structures ◽  
Range Selection

Building an efficient data structure for range selection problems is considered. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size . Our data structure is a practical linear space data structure that supports range selection queries in time with preprocessing time.

Scalable plasma simulation with ELMFIRE using efficient data structures for process communication

2008 ◽  
Vol 179 (5) ◽  
pp. 330-338
Author(s):  
Artur Signell ◽  
Francisco Ogando ◽  
Mats Aspnäs ◽  
Jan Westerholm
Keyword(s):  
Data Structures ◽  
Plasma Simulation ◽  
Process Communication ◽  
Efficient Data ◽  
Efficient Data Structures
Sign in / Sign up

Export Citation Format

Share Document