A Method of Optimizing the Work Schedule of Bus Drivers Based on Set Covering Theory

Abstract

A work schedule optimization model of a bus route is proposed to minimize labor cost by optimizing the work schedule of bus drivers. The mathematical model is constructed using set covering theory to minimize the number of operating buses by considering the bus schedule chain of a single bus line as the research subject, as well as the constraints of vehicle operation task, shift time, and labor rules. In addition, a 0–1 integer programming algorithm based on heuristic method is designed to solve the model. Finally, this algorithm is realized according to the real investigation data of Jinan Public Transit, and the schedule scheme is solved using MATLAB. Experimental results show that (1) unlike other algorithms, 0–1 integer programming algorithm can shorten the waiting period of drivers and decrease the total work time and personnel cost to reduce the operating costs of the bus company; and (2) the method can protect the working hours of drivers by improving their efficiency, thereby providing a reasonable solution to optimize the work schedule of bus drivers.