• română
    • English
    • français
    • Deutsch
    • español
    • italiano
  • română 
    • română
    • English
    • français
    • Deutsch
    • español
    • italiano
  • Logare
Vezi articolul 
  •   Pagina principală
  • Scientific papers - Annals of "Dunarea de Jos" University of Galati - Analele științifice ale Universității "Dunărea de Jos" din Galați
  • Fascicula I
  • 2003- 2017 (economie; informatică aplicată)
  • 2012 fascicula1 nr2
  • Vezi articolul
  •   Pagina principală
  • Scientific papers - Annals of "Dunarea de Jos" University of Galati - Analele științifice ale Universității "Dunărea de Jos" din Galați
  • Fascicula I
  • 2003- 2017 (economie; informatică aplicată)
  • 2012 fascicula1 nr2
  • Vezi articolul
JavaScript is disabled for your browser. Some features of this site may not work without it.

Multi Population Hybrid Genetic Algorithms for University Course Timetabling

Thumbnail
View/Open
ugal_f1_2012_nr2_1_Kokshori_Liri.pdf (645.9Kb)
Dată
2012
Autor
Shahvali Kohshori, Meysam
Shirani Liri, Mehrnaz
Metadata
Arată înregistrarea completă a articolului
Abstract
University course timetabling is one of the important and time consuming issues that each University is involved with at the beginning of each university year. This problem is in class of NP-hard problem and is very difficult to solve by classic algorithms. Therefore optimization techniques are used to solve them and produce optimal or almost optimal feasible solutions instead of exact solutions. Genetic algorithms, because of their multidirectional search property, are considered as an efficient approach for solving this type of problems. In this paper three new hybrid genetic algorithms for solving the university course timetabling problem (UCTP) are proposed: FGARI, FGASA and FGATS. In the proposed algorithms, fuzzy logic is used to measure violation of soft constraints in fitness function to deal with inherent uncertainty and vagueness involved in real life data. Also, randomized iterative local search, simulated annealing and tabu search are applied, respectively, to improve exploitive search ability and prevent genetic algorithm to be trapped in local optimum. The experimental results indicate that the proposed algorithms are able to produce promising results for the UCTP.
URI
http://10.11.10.50/xmlui/handle/123456789/3548
Colecții
  • 2012 fascicula1 nr2 [19]

DSpace 6.0 | Copyright © Arthra Institutional Repository
Contactați-ne | Trimite feedback
Theme by 
Atmire NV
 

 

Răsfoiește

În tot DSpaceComunități; ColecțiiDupă data publicăriiAutoriTitluriSubiecteAceastă colecțieDupă data publicăriiAutoriTitluriSubiecte

Contul meu

Conectare

DSpace 6.0 | Copyright © Arthra Institutional Repository
Contactați-ne | Trimite feedback
Theme by 
Atmire NV