UNIVERSITY COURSE TIMETABLING USING GRAPH-BASED HYPER HEURISTICS

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.

SALIMIFARD KHODAKARAM; JAMALI GHOLAMREZA; BABAEEZADEH SALMAN

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

Journal Paper

Paper Information

Journal: Industrial Management Journal Year:2014 | Volume:5 | Issue:2 Page(s): 49-70

Download Full-Text

Persian Verion

View:

712

Download:

Cites:

Information Journal Paper

Title

UNIVERSITY COURSE TIMETABLING USING GRAPH-BASED HYPER HEURISTICS

Author(s)

SALIMIFARD KHODAKARAM | JAMALI GHOLAMREZA | BABAEEZADEH SALMAN | Issue Writer Certificate

Keywords

GRAPH COLORINGQ2

HYPER HEURISTICSQ2

LOCAL SEARCHQ2

UNIVERSITY COURSE TIMETABLINGQ2

Abstract

University course timetabling is a complex optimization problem. There are many components like departments, faculties, rooms, and students making the problem huge and difficult to solve. Each component enforces a set of normally conflicting constraints on the solution space. The problem will be solved if courses are scheduled in different rooms and within some specific time slots such that a set of constraints are satisfied. In this paper, a graph-based hyper-heuristic is proposed to find a solution to the problem. This is a two tiers modeling approach combining hyper heuristic with GRAPH COLORING technique. The upper tier heuristic is used to select a suitable heuristic to find a feasible solution on the lower tier. To find the suitability of the proposed approach, it has been applied to a real world case. The proposed approach was able to satisfy all the hard and soft constraints. Based on the research findings, it can be concluded that a graph-based hyper heuristic approach is a suitable and computationally efficient method to find a solution to UNIVERSITY COURSE TIMETABLING problem.

Cites

No record.

References

UNIVERSITY TIMETABLING PROBLEM WITH MATHEMATICAL TWO STAGE MODELING

Cite

APA: Copy

SALIMIFARD, KHODAKARAM, JAMALI, GHOLAMREZA, & BABAEEZADEH, SALMAN. (2014). UNIVERSITY COURSE TIMETABLING USING GRAPH-BASED HYPER HEURISTICS. JOURNAL OF INDUSTRIAL MANAGEMENT, 5(2), 49-70. SID. https://sid.ir/paper/139942/en

Vancouver: Copy

SALIMIFARD KHODAKARAM, JAMALI GHOLAMREZA, BABAEEZADEH SALMAN. UNIVERSITY COURSE TIMETABLING USING GRAPH-BASED HYPER HEURISTICS. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2014;5(2):49-70. Available from: https://sid.ir/paper/139942/en

IEEE: Copy

KHODAKARAM SALIMIFARD, GHOLAMREZA JAMALI, and SALMAN BABAEEZADEH, “UNIVERSITY COURSE TIMETABLING USING GRAPH-BASED HYPER HEURISTICS,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 5, no. 2, pp. 49–70, 2014, [Online]. Available: https://sid.ir/paper/139942/en

Related Journal Papers