Research On Public Traffic Driver Scheduling Problem

Traffic problems are deteriorating more and more seriously because of faster and faster urbanization in the world. In order to solve the problems, the public traffic should be highly developed, meanwhile, public traffic system must be improved continually to face the increasingly traffic pressure. Driver scheduling problem is an important factor to improve the public traffic capacity and efficiency. Good driver schedule not only be more fair, reasonable and effective for drivers, but also save the cost of the operations.The thesis first explains the definitions of the driver scheduling problem. The driver scheduling problem involves assigning bus to drivers in such a way that all the bus work is covered and the number of drivers and duty costs are minimized. Then the development of the driver scheduling problem is introduced. Heuristic approach and Mathematical programming approaches are the main ways use for solve the driver scheduling problem. Some of the successful driver scheduling systems are also showed. Following part of the thesis focuses on solving the driver scheduling problem using a Tabu Search meta-heuristic approach. And at last, an example is given to prove the feasible of the approach. The result concludes that the present driver schedule has much space to improve,and a good schedule can decrease the duties number and the cost.