Improved Variable Neighbourhood Descent (VND) to Solve Universiti Malaysia Sarawak (UNIMAS) Course Timetabling Problem
Academic institutions face the timetabling problem every semester. The task of allocating lectures to limited timeslots and venues must fulfil certain constraints unique to each educational institution. This study investigated heuristic orderings and the variable neighbourhood descent approach to ta...
Saved in:
Main Author: | Mei Ching, Chen |
---|---|
Format: | Thesis |
Language: | English English English |
Published: |
2023
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/43242/3/chen%20mei%20ching_dsva.pdf http://ir.unimas.my/id/eprint/43242/4/Thesis%20PhD_%20Chen%20Mei%20Ching%20-%2024%20pages.pdf http://ir.unimas.my/id/eprint/43242/5/Thesis%20PhD_%20Chen%20Mei%20Ching.ftext.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving an application of university course timetabling problem by using genetic algorithm
by: Norhana, Shaibatul Khadri
Published: (2022) -
Hybrid Metaheuristic Algorithm and Metaheuristic Performance Measurement for Solving University Course Timetabling Problem
by: Md Sultan, Abu Bakar
Published: (2007) -
Hybrid particle swarm optimization-constraint-based reasoning in solving university course timetabling problem
by: Ho, Sheau Fen @ Irene
Published: (2010) -
Hybrid particle swarm optimization constraint based reasoning in solving university course timetabling problem
by: Ho, Irene Sheau Fen
Published: (2010) -
Enhancement of Ant System Algorithm for Course Timetabling Problem
by: Djamarus, Djasli
Published: (2009)