Optimal Bus Scheduling using a Distributed Game Model Approach

The efficiency of the transport system depends on the planning and control strategies applied. The satisfaction of both the operator and the passenger in transport systems is challenging and determines the level of service of the system. In order to adapt to disruptions in the transport system which influence the traveled time by the buses, the stop skipping control strategy is adopted. The goal is to serve all the passengers waiting at stops by minimizing the total delay in a known static system. Because of the NP-Hardness of minimizing the real total delay of the system, a new delay based on the notion of balancing the load inside the buses, denoted as load - del a y, is defined. A distributed game model is proposed to solve the delay minimization problem using stop skipping control strategy. Finally, the distributed game is solved by Linear Reward Inaction algorithm (LRI) and its results are compared with the Simulated Annealing meta-heuristic results.

I. Introduction

The public transport system is considered as the backbone of sustainable urban development since it allows more efficient movements in cities. It is the most popular form of public transport as it operates on a fixed route and serves a defined set of stops. Various factors such as dynamic changes in traffic congestion, weather conditions, and unstable de-mand patterns lead to uncomfortable travel time for both the passengers and the operators [1]. Thus, It is critical that bus services run on time for the convenience of passengers and to be able to provide a dependable public transportation service for them. A delay in the arrival time of a bus at a station may lead to a longer waiting time for passengers and a deterioration of the service.