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

conference contribution
posted on 2023-08-25, 05:30 authored by ND Thanh
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. © 2007 IEEE.

History

Volume

3

Pagination

472-477

Start date

2007-07-30

End date

2007-08-01

ISBN-13

9780769529097

ISBN-10

0769529097

Title of proceedings

Proceedings - SNPD 2007: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

Event

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)

Publisher

IEEE

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC