An Optimized Intelligent Automation for University Shuttle Bus Driver Scheduling Using Mutual Swapping and Harmony Search

This paper is about an automated driver schedule for university shuttle bus. Driver scheduling is the process of assigning shift to the drivers based on hard and soft constraints. In previous study, a recently developed population-based meta-heuristic optimization algorithm, Harmony Search has been...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer science and information security 2016-08, Vol.14 (8), p.875-875
Main Authors: Shaffiei, Zatul Alwani, Abas, Zuraida Abal, Shibghatullah, Abdul Samad, Rahman, Ahmad Fadzli Nizam Abdul
Format: Article
Language:English
Subjects:
Algorithms
Automation
Buses
Case studies
Fuzzy sets
Genetic algorithms
Heuristic
Integer programming
Mathematical analysis
Mathematical models
Optimization
Optimization algorithms
Production scheduling
Schedules
Scheduling
Searching
Students
Workforce planning
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper is about an automated driver schedule for university shuttle bus. Driver scheduling is the process of assigning shift to the drivers based on hard and soft constraints. In previous study, a recently developed population-based meta-heuristic optimization algorithm, Harmony Search has been applied. However, the problem cannot be solved maximally with optimum result. Therefore, in this study, the algorithm has been modified, which is a mutual-swapping technique with mathematical equation has been embedded, in order to gain the optimum, better and fairer schedule for each driver. As a result, the objective function obtained using the modified algorithm is better than result in standard algorithm. An automated driver schedule can be generated with high quality of performance measurement especially in terms of fairness for each driver since it is very crucial to guarantee the good quality of service and satisfaction.
ISSN:1947-5500