| Bus scheduling is an important problem in the public transport system,it is according to the departure time of the bus to plan the daily work plan,involving a number of optimization objectives.This paper studies the problem of bus scheduling with branch lines.Compared to the traditional bus scheduling problem,the problem is more complex because it involves more departure time points and departure stops and requires customization..This paper puts forward two methods to solve the problem of bus scheduling with branch lines.The first method is based on the framework of cultural gene algorithm,combining genetic algorithm and variable neighborhood search algorithm.Four search operators are designed,which can not only improve the search ability of the algorithm,but also prevent the algorithm from falling into the local optimal solution.The second method combines the exact method and the local search method.Firstly,the auction algorithm is used to obtain a high quality initial solution,and then the variable neighborhood search algorithm is used to further improve the quality of the solution.In order to verify the feasibility and effectiveness of the method,this paper uses the actual route data of the bus company,evaluates the two methods from many aspects,analyzes the advantages and disadvantages of the two methods and the applicable scenarios,in addition,this paper compares the vehicle scheduling scheme generated by the two methods with the manual scheduling scheme and the scheme generated by the existing method.The comparison results show that the two methods implemented in this paper are superior to the manual method and the existing method.In the end,this paper develops a bus scheduling system,which integrates the algorithm module and provides a simple and intuitive man-machine interface.This system can help users to better generate,manage and display the vehicle scheduling schemes. |