Cart (Loading....) | Create Account
Close category search window

Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Al Tarawneh, H.Y. ; Center for Artificial Intell. Technol., Univ. Kebangsaan Malaysia, Bangi, Malaysia ; Ayob, M.

In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.

Published in:

Data Mining and Optimization (DMO), 2011 3rd Conference on

Date of Conference:

28-29 June 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.