Bus Driver Scheduling Problem using TLBO and JAYA Algorithm

Abstract

Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly generated datasets. In the work solution is obtained with no zero constraint violations. JAYA algorithm gives better results than TLBO algorithm.