loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
Solving Timetabling Problem Using Genetic and Heuristic Algorithms
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
ASCII Text
x 
 
Nguyen Duc Thanh, "Solving Timetabling Problem Using Genetic and Heuristic Algorithms," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, vol. 3, pp. 472-477, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2007.464,
author = {Nguyen Duc Thanh},
title = {Solving Timetabling Problem Using Genetic and Heuristic Algorithms},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {3},
year = {2007},
isbn = {0-7695-2909-7},
pages = {472-477},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.464},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - Solving Timetabling Problem Using Genetic and Heuristic Algorithms
SN - 0-7695-2909-7
SP472
EP477
A1 - Nguyen Duc Thanh,
PY - 2007
KW - null
VL - 3
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
Nguyen Duc Thanh, Nong Lam University, Vietnam
In this paper, we propose a hybrid algorithm that combines genetic and heuristic approach. By using this method, solving timetabling problem is converted to finding the optimal arrangement of elements on a 2D matrix. This algorithm was implemented and tested with the synthetic and real data of Nong Lam University of HCM City, Vietnam. The experimental results reveal the usability and potential of the proposed algorithm in solving timetabling problems.
Citation:
Nguyen Duc Thanh, "Solving Timetabling Problem Using Genetic and Heuristic Algorithms," snpd, vol. 3, pp.472-477, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.