Abstract
In this paper we describe a new hybrid evolutionary algorithm and its implementation for the NP hard exam timetabling problem. This approach uses the good features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the evolutionary Scatter Search (SS) approach which uses strategies for search diversification and intensification to maintain and evolve a population of solutions. New solutions are improved before replacing others according to their quality and diversity. The implementation of the algorithm has been experimented on the popular Carter's benchmarks and compared with the best recent results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
