Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem
The Timetabling Problem is a combinatorial optimization problem. The University Course Timetabling Problems (UCTP) deals with the scheduling of the teaching program. Metaheuristic techniques have been very successful in a wide range of timetabling problem including UCTP. The performance of metaheuri...
Saved in:
Main Authors: | Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam |
---|---|
Format: | Article |
Language: | English |
Published: |
Siam Technology College
2008
|
Online Access: | http://psasir.upm.edu.my/id/eprint/16649/1/Selecting%20quality%20initial%20random%20seed%20for%20metaheuristic%20pproaches.pdf http://psasir.upm.edu.my/id/eprint/16649/ http://www.ijcim.th.org/past_editions/2008V16N1/v16n1.htm |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Hybrid Metaheuristic Algorithm and Metaheuristic Performance Measurement for Solving University Course Timetabling Problem
by: Md Sultan, Abu Bakar
Published: (2007) -
Maintaining diversity for genetic algorithm : a case of timetabling problem.
by: Md Sultan, Abu Bakar, et al.
Published: (2006) -
A genetic algorithm approach for timetabling problem: the time group strategy
by: Md Sultan, Abu Bakar, et al.
Published: (2004) -
Exploiting fitness distance correlation (FDC) of timetabling instances
by: Md Sultan, Abu Bakar, et al.
Published: (2005) -
Metaheuristic Algorithm for university timetabling problem
by: Wahid, Juliana, et al.
Published: (2021)