loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Nuno Leite 1 ; Fernando Melício 2 and Agostinho C. Rosa 3

Affiliations: 1 Instituto Superior de Engenharia de Lisboa/ADEETC, Instituto Superior Técnico and Universidade de Lisboa, Portugal ; 2 Institute for Systems and Robotics/LaSEEB and, Portugal ; 3 Instituto Superior Técnico, Universidade de Lisboa and Instituto de Sistemas e Robótica/LaSEEB, Portugal

ISBN: 978-989-758-052-9

Keyword(s): Examination Timetabling, Shuffled Complex Evolution Algorithm, Memetic Computing, Great Deluge Algorithm, Toronto Benchmarks, Two-Epoch Examination Timetabling.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Hybrid Systems ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Memetic Algorithms ; Society and Cultural Aspects of Evolution ; Soft Computing ; Swarm/Collective Intelligence

Abstract: In this work we present a memetic algorithm for solving examination timetabling problems. Two problems are analysed and solved. The first one is the well-studied single-epoch problem. The second problem studied is an extension of the standard problem where two examination epochs are considered, with different durations. The proposed memetic algorithm inherits the population structure of the Shuffled Complex Evolution algorithm, where the population is organized into sets called complexes. These complexes are evolved independently and then shuffled in order to generate the next generation complexes. In order to explore new solutions, a crossover between two complex’s solutions is done. Then, a random solution selected from the top best solutions is improved, by applying a local search step where the Great Deluge algorithm is employed. Experimental evaluation was carried out on the public uncapacitated Toronto benchmarks (single epoch) and on the ISEL-DEETC department examination benchm ark (two epochs). Experimental results show that the proposed algorithm is efficient and competitive on the Toronto benchmarks with other algorithms from the literature. Relating the ISEL-DEETC benchmark, the algorithm attains a lower cost when compared with the manual solution. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.232.171.18

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Leite, N.; Melício, F. and Rosa, A. (2014). A Shuffled Complex Evolution Based Algorithm for Examination Timetabling - Benchmarks and a New Problem Focusing Two Epochs.In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014) ISBN 978-989-758-052-9, pages 112-124. DOI: 10.5220/0005164801120124

@conference{ecta14,
author={Nuno Leite. and Fernando Melício. and Agostinho C. Rosa.},
title={A Shuffled Complex Evolution Based Algorithm for Examination Timetabling - Benchmarks and a New Problem Focusing Two Epochs},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)},
year={2014},
pages={112-124},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005164801120124},
isbn={978-989-758-052-9},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)
TI - A Shuffled Complex Evolution Based Algorithm for Examination Timetabling - Benchmarks and a New Problem Focusing Two Epochs
SN - 978-989-758-052-9
AU - Leite, N.
AU - Melício, F.
AU - Rosa, A.
PY - 2014
SP - 112
EP - 124
DO - 10.5220/0005164801120124

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.