Year-end Sale % OFF 
Abstract
University Course Timetabling Problem is a problem faced by every university, one of which is Universitas Multimedia Nusantara. Timetabling process is done by allocating time and space so that the whole associated class and course can be implemented. In this paper, the problem will be solved by using MAX-MIN Ant System Algorithm. This algorithm is an alternative approach to ant colony optimization. This algorithm uses two tables of pheromones as stigmergy, i.e. timeslot pheromone table and room pheromone table. In addition, the selection of timeslot and room is done by using the standard deviation of the value of pheromones. Testing is carried out by using 105 events, 45 timeslots, and 3 types of categories based on the number of rooms provided, i.e. large, medium, and small. In each category, testing is performed 5 times and for each testing, the data recorded is the unplace and Soft Constraint Penalty. In general, the greater the number of rooms, the smaller the unplace.
 Index Terms—ant colony optimization, max-min ant system, timetabling
Published Version (
Free)
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.
