Abstract
Recently, Ohta et al, reported that an optimal scheduling model for drivers in bus transit systems is formulated as a 0-1 goal programming model. In this paper we propose an efficient algorithm for solving the optimal scheduling problem for bus drivers. This algorithm has an effect on the computer storage required and the computational time. The algorithm proposed here and the usual method are quantitatively evaluated using a numerical example for the optimal scheduling model. In the software package developed here, we adapt the data entry system designed using the BNF notation.
