loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

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

Affiliations: 1 ISEL - Lisbon Polytechnic Institute, Portugal ; 2 ISEL - Lisbon Polytechnic Institute and LaSEEB - System and Robotics Institute, Portugal ; 3 LaSEEB - System and Robotics Institute, IST and TU-Lisbon, Portugal

ISBN: 978-989-8565-77-8

Keyword(s): Examination Timetabling Problem, Toronto Benchmarks, Memetic Algorithm, Shuffled Frog-Leaping Algorithm.

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

Abstract: Shuffled Frog-Leaping Algorithm (SFLA) is a recently proposed memetic meta-heuristic algorithm for solving combinatorial optimisation problems. SFLA has both global and local search capabilities, and great convergence speed towards the global optimum. Compared to a genetic algorithm, the experimental results show an effective reduction of the number of evaluations required to find the global optimal solution. The Examination Timetabling Problem (ETTP) is a complex combinatorial optimisation problem faced by schools and universities every epoch. In this work, we apply the Shuffled Frog-Leaping Algorithm to solve the ETTP. The evolution step of the algorithm, specifically the local exploration in the submemeplex is carefully adapted based on the prototype SFLA. The algorithm was evaluated on the standard Toronto benchmark instances, and the preliminary experimental results obtained are comparable to those produced by state of art algorithms while requiring much less time.

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.204.48.40

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. (2013). Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm.In Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013) ISBN 978-989-8565-77-8, pages 175-180. DOI: 10.5220/0004636001750180

@conference{ecta13,
author={Nuno Leite. and Fernando Melício. and Agostinho Rosa.},
title={Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm},
booktitle={Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)},
year={2013},
pages={175-180},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004636001750180},
isbn={978-989-8565-77-8},
}

TY - CONF

JO - Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)
TI - Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm
SN - 978-989-8565-77-8
AU - Leite, N.
AU - Melício, F.
AU - Rosa, A.
PY - 2013
SP - 175
EP - 180
DO - 10.5220/0004636001750180

Login or register to post comments.

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