AUTOMATIC GENERATION OF UNIVERSITY COURSE TIMETABLING USING GENETIC ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AHANGARAN M.; Pourbozorg H.; TALEBI M.; SOLEYMANI K.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

221

Download:

356

Information Seminar Paper

Title

AUTOMATIC GENERATION OF UNIVERSITY COURSE TIMETABLING USING GENETIC ALGORITHM

Author(s)

AHANGARAN M. | Pourbozorg H. | TALEBI M. | SOLEYMANI K.

Keywords

CONSTRAINT SATISFACTION PROBLEM

GENETIC ALGORITHM

OPTIMIZATION

UNIVERSITY COURSE TIMETABLING PROBLEM

Abstract

UNIVERSITY COURSE TIMETABLING PROBLEM (UCTP) IS A WELL-KNOWN CONSTRAINT SATISFACTION PROBLEM (CSP) PROBLEM THAT HAS EXPONENTIAL NUMBER OF SOLUTIONS BASED ON COURSE CONFLICTS, TEACHER’S EMPTY TIMES AND OTHER PARAMETERS. THIS IS A NP-HARD PROBLEM. SCHEDULING IS A MAJOR DEBATE ON PLANNING WHICH CAN BE USED IN TRAINS SCHEDULING, CLASSROOM SCHEDULING, TRAFFIC EVEN IN SCHOOLS AND UNIVERSITIES. THE SCHEDULING LEADS TO ORGANIZING TASKS AND REMOVING TASKS INTERFERENCE WHICH IS IMPORTANT. THE GOAL OF SOLVING UCTP IS SETTING TIMES FOR COURSES AND TEACHERS IN WEEKDAYS IN ORDER TO REACH MINIMUM COURSES CONFLICTS. IT IS ALSO IDEAL FOR TEACHERS TO HAVE JOINT DAYS FOR TEACHING IN THE LEAST WEEKDAYS. OF COURSE, SUBJECT TO THE RESTRICTIONS OF CLASSES AND TEACHERS PROGRAM THIS SCHEDULING IS VERY DIFFICULT. GENERALLY, EVOLUTIONARY ALGORITHMS (EA) ARE EFFICIENT TOOLS TO SOLVE THIS PROBLEM. THE FINAL TIMETABLING MUST BE OPTIMUM WHICH MEANS THAT THERE IS NO CONFLICTS IF POSSIBLE AND BEST SCHEDULING GENERATE FOR TEACHERS. IN THIS PAPER WE SOLVE THIS PROBLEM BASED ON GENETIC ALGORITHM AND IMPLEMENT THIS ALGORITHM WITH DEAP PYTHON BASED TOOLBOX ON RANDOM DATASET. THE IMPLEMENTATION RESULTS SHOW THAT GENETIC ALGORITHM IS EFFICIENT TOOLS THAT CAN CLOSE TO THE GLOBAL OPTIMUM POINT.

Cites

No record.

References

No record.

Cite

APA: Copy

AHANGARAN, M., Pourbozorg, H., TALEBI, M., & SOLEYMANI, K.. (2017). AUTOMATIC GENERATION OF UNIVERSITY COURSE TIMETABLING USING GENETIC ALGORITHM. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/937028/en

Vancouver: Copy

AHANGARAN M., Pourbozorg H., TALEBI M., SOLEYMANI K.. AUTOMATIC GENERATION OF UNIVERSITY COURSE TIMETABLING USING GENETIC ALGORITHM. 2017. Available from: https://sid.ir/paper/937028/en

IEEE: Copy

M. AHANGARAN, H. Pourbozorg, M. TALEBI, and K. SOLEYMANI, “AUTOMATIC GENERATION OF UNIVERSITY COURSE TIMETABLING USING GENETIC ALGORITHM,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/937028/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops