Improved Harmony search Algorithm for Bus Scheduling Optimization

In the actual Scheduling, the objective function of the bus scheduling problem needs to be considered from the following two aspects: the standpoint of the bus company, which provides the largest possible departure interval, that is, reducing the number of departures and increasing the company's income by reducing operating costs; the passenger's standpoint, which is necessary to minimize the departure interval for reducing the cost of waiting for the car and the transfer. In this paper, the sum of the operating cost of bus company in whole-day and the cost of passengers waiting for the car and the transfer is optimized. The departure time interval is based on the idea of time-division processing. Under the premise of reasonable assumptions, the optimization model of the bus departure interval is established. Based on the basic harmony algorithm, the improved harmony algorithm is used to solve the bus scheduling problem. Taking a city bus route as an example, the MATLAB simulation is carried out on the bus scheduling model based on the improved harmony algorithm. The simulation results verify that the improved harmony algorithm are more effective and better.