Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/5983Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jat, SN | - |
| dc.contributor.author | Yang, S | - |
| dc.date.accessioned | 2011-11-21T15:40:53Z | - |
| dc.date.available | 2011-11-21T15:40:53Z | - |
| dc.date.issued | 2011 | - |
| dc.identifier.citation | Proceedings of the 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011, 1, 6622/2011: 1 - 13, 2011-04-27 | en_US |
| dc.identifier.isbn | 978-3-642-20363-3 | - |
| dc.identifier.uri | http://www.springerlink.com/content/036888h02t076157/ | en |
| dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/5983 | - |
| dc.description | Copyright @ Springer-Verlag Berlin Heidelberg 2011. | en_US |
| dc.description.abstract | The 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_US |
| dc.language.iso | en | en_US |
| dc.publisher | Springer | en_US |
| dc.subject | Course timetabling | en_US |
| dc.subject | Combinatorial optimization | en_US |
| dc.subject | Guided search | en_US |
| dc.subject | Genetic algorithm | en_US |
| dc.subject | Local search | en_US |
| dc.subject | MOUCTP | en_US |
| dc.title | A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem | en_US |
| dc.type | Book Chapter | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-20364-0_1 | - |
| pubs.organisational-data | /Brunel | - |
| pubs.organisational-data | /Brunel/Brunel (Active) | - |
| pubs.organisational-data | /Brunel/Brunel (Active)/School of Info. Systems, Comp & Maths | - |
| pubs.organisational-data | /Brunel/Research Centres (RG) | - |
| pubs.organisational-data | /Brunel/Research Centres (RG)/CIKM | - |
| pubs.organisational-data | /Brunel/School of Information Systems, Computing and Mathematics (RG) | - |
| pubs.organisational-data | /Brunel/School of Information Systems, Computing and Mathematics (RG)/CIKM | - |
| Appears in Collections: | Computer Science Dept of Computer Science Research Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Fulltext.pdf | 185.58 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.