Show simple item record

dc.contributor.authorJat, Sadaf Naseemen
dc.contributor.authorYang, Shengxiangen
dc.date.accessioned2013-05-24T09:42:16Z
dc.date.available2013-05-24T09:42:16Z
dc.date.issued2011
dc.identifier.citationJat, S. and Yang, S. (2011) A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem. In: Evolutionary Computation in Combinatorial Optimization: Proceedings of 11th European Conference, EvoCOP 2011, Torino, April 2011. Berlin: Springer-Verlag, pp. 1-13.en
dc.identifier.isbn978-3-642-20363-3
dc.identifier.urihttp://hdl.handle.net/2086/8669
dc.description.abstractThe university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previous good solutions to guide the generation of new solutions, and two local search schemes to enhance its performance for the MOUCTP. The experimental results based on a set of test problems show that the proposed algorithm is efficient for solving the MOUCTP.en
dc.language.isoenen
dc.publisherSpringer-Verlag.en
dc.relation.ispartofseriesLecture Notes on Computer Science;Vol. 6622
dc.titleA guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem.en
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-20364-0_1
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedYesen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record