A STUDY OF THE UNIVERSITY COURSE TIMETABLING PROBLEM BY USING A HYBRID OF IMPROVED MEMETIC AND SIMULATED ANNEALING ALGORITHMS

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.

JOUDAKI M.; MONTAZERI M.A.; MOUSAVI S.R.

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

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, A- MUHANDISI -I BARQ Year:2012 | Volume:9 | Issue:4 Page(s): 192-202

Download Full-Text

Persian Verion

View:

1,012

Download:

Cites:

Information Journal Paper

Title

A STUDY OF THE UNIVERSITY COURSE TIMETABLING PROBLEM BY USING A HYBRID OF IMPROVED MEMETIC AND SIMULATED ANNEALING ALGORITHMS

Author(s)

JOUDAKI M. | MONTAZERI M.A. | MOUSAVI S.R. | Issue Writer Certificate

Keywords

SIMULATED ANNEALING ALGORITHMQ3

MEMETIC ALGORITHMQ2

LOCAL SEARCHQ2

UNIVERSITY COURSE TIMETABLING PROBLEMQ3

Abstract

Course timetabling is a complex problem, happening at the beginning of every semester at universities. One of the most important problems related to this issue is various constraints. As a result of this, timetabling is performed in various methods at different departments. Many works have been performed to solve this problem which majority of them have used metaheuristic based techniques. In this paper, an algorithm is based on hybridization of improved MEMETIC ALGORITHM and SIMULATED ANNEALING ALGORITHM is proposed. Improvement in MEMETIC ALGORITHM means heuristic initializes population and modification in crossover operator. Also, an operator which is called improvement is designed for improvement of created chromosomes and decrease of violation of constraints. In addition, utilization of simulated annealing will result to increase of the exploitive search ability of MEMETIC ALGORITHM. The experimental results which based on standard data indicate this method is more efficient in comparison with some other new methods.

Cites

No record.

References

No record.

Cite

APA: Copy

JOUDAKI, M., MONTAZERI, M.A., & MOUSAVI, S.R.. (2012). A STUDY OF THE UNIVERSITY COURSE TIMETABLING PROBLEM BY USING A HYBRID OF IMPROVED MEMETIC AND SIMULATED ANNEALING ALGORITHMS. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), 9(4), 192-202. SID. https://sid.ir/paper/53829/en

Vancouver: Copy

JOUDAKI M., MONTAZERI M.A., MOUSAVI S.R.. A STUDY OF THE UNIVERSITY COURSE TIMETABLING PROBLEM BY USING A HYBRID OF IMPROVED MEMETIC AND SIMULATED ANNEALING ALGORITHMS. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN)[Internet]. 2012;9(4):192-202. Available from: https://sid.ir/paper/53829/en

IEEE: Copy

M. JOUDAKI, M.A. MONTAZERI, and S.R. MOUSAVI, “A STUDY OF THE UNIVERSITY COURSE TIMETABLING PROBLEM BY USING A HYBRID OF IMPROVED MEMETIC AND SIMULATED ANNEALING ALGORITHMS,” NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), vol. 9, no. 4, pp. 192–202, 2012, [Online]. Available: https://sid.ir/paper/53829/en

Related Journal Papers