Deakin University
Browse

File(s) stored somewhere else

Please note: Linked content is NOT stored on Deakin University and we can't guarantee its availability, quality, security or accept any liability.

Solving timetabling problem using genetic and heuristic algorithms

Version 2 2024-05-30, 12:36
Version 1 2023-08-25, 05:30
conference contribution
posted on 2024-05-30, 12:36 authored by Duc Thanh NguyenDuc Thanh Nguyen
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.

History

Volume

3

Pagination

472-477

Location

Qingdao, China

Start date

2007-07-30

End date

2007-08-01

ISBN-13

9780769529097

ISBN-10

0-7695-2909-7

Language

eng

Publication classification

E1.1 Full written paper - refereed

Copyright notice

2007, IEEE

Title of proceedings

ACIS SNPD 2007 : Proceedings of the 8th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

Event

ACIS SNPD Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing. International Conference (8th : 2007 : Qingdao, China)

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Place of publication

Piscataway, N.J.