Evolutionary algorithms in lecture timetabling

Adamidis, Panagiotis/ Arapakis, Panagiotis/ Αδαμίδης, Παναγιώτης/ Αραπάκης, Παναγιώτης


Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdamidis, Panagiotisel
dc.contributor.authorArapakis, Panagiotisel
dc.contributor.otherΑδαμίδης, Παναγιώτηςel
dc.contributor.otherΑραπάκης, Παναγιώτηςel
dc.date.accessioned2015-07-22T16:36:13Zel
dc.date.accessioned2018-02-28T17:06:01Z-
dc.date.available2015-07-22T16:36:13Zel
dc.date.available2018-02-28T17:06:01Z-
dc.date.issued1999el
dc.identifierhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=782552&queryText=Evolutionary+Algorithms+in+Lecture+Timetabling&newsearch=true&searchField=Search_Allel
dc.identifier10.1109/CEC.1999.782552el
dc.identifier.citationCongress on Evolutionary Computation, Washington, DC, 1999el
dc.identifier.citationAdamidis P., Arapakis P. (1999). Evolutionary algorithms in lecture timetabling. Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on (Volume:2 ). Jul 1999. Washington, DC: IEEEel
dc.identifier.urihttp://195.251.240.227/jspui/handle/123456789/10378-
dc.descriptionΔημοσιεύσεις μελών--ΣΤΕΦ--Τμήμα μηχανικών Πληροφορικής, 1999el
dc.description.abstractSeveral approaches have been used to solve the timetabling problem. Recently, evolutionary algorithms (EAs) have been applied with very good results to various types of timetabling problems. This paper presents the results of our work on a real course timetabling problem using EAs. We compare two versions of the EA with different representation schemes. We also compare the performance of three configurations, with or without mutation and different recombination and mutation operators. The results show that EAs can always produce a feasible solution without violation of any hard constraintel
dc.language.isoenel
dc.publisherIEEEel
dc.relation.ispartofProceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99el
dc.rightsThis item is probably protected by Copyright Legislationel
dc.rightsΤο τεκμήριο πιθανώς υπόκειται σε σχετική με τα Πνευματικά Δικαιώματα νομοθεσίαel
dc.source.urihttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6342el
dc.titleEvolutionary algorithms in lecture timetablingel
dc.typeConference articleel
heal.typeotherel
heal.type.enOtheren
heal.dateAvailable2018-02-28T17:07:01Z-
heal.languageelel
heal.accessfreeel
heal.recordProviderΤΕΙ Θεσσαλονίκηςel
heal.fullTextAvailabilityfalseel
heal.type.elΆλλοel
Appears in Collections:Δημοσιεύσεις σε Περιοδικά

Files in This Item:
There are no files associated with this item.



 Please use this identifier to cite or link to this item:
http://195.251.240.227/jspui/handle/123456789/10378
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.