Study On Regional Bus Scheduling Problem Under APTS

Bus scheduling modes consists of line scheduling and regional scheduling. The basic dissimilarity between the two scheduling models is least unit where optimize bus resources, one is a line, another is a region which is organized by some lines. Thereamong, vehicle line scheduling is the base mode in bus scheduling. The line scheduling model is generally applied by bus operators in China. Unfortunately, this model has limited both the efficiency of applying the currently insufficient resources and the potential of applying new techniques. Regional scheduling is widely used in many cities of developed county, which will be a trend in the future in China city. Based on the operating experience of regional scheduling pattern in Occident and other countries which have advanced public transportation, the improvements are 8%-20% in working efficiency under regional scheduling pattern relative to single line pattern.The core of organizing and optimizing transportation operation is allocating reasonably vehicle to transportation task and realizing bus reasonably collocating during regional bus scheduling under Advanced Public Transportation System(APTS). Managing effectively bus in a regional can elevate the efficiency of utilizing vehicle and realize scientific bus transportation. And to research generally the bus scheduling problem is the base and the key of constituting perfect transportation system, establishing modern scheduling system, realizing scientific logistics and improving APTS. Urban public transportation system is a giant system, the corresponding models and strategies are very complex. In this dissertation, based on the analysis of current situation of our bus scheduling problem, according as the modern transport theory, using the succeed experience of bus scheduling for reference, deep and systemic investigation is about regional bus scheduling problem under APTS. Resumptively, the main researches are as follows:The first section of the dissertation, reviews the history of development of APTS, regional operating pattern and bus dispatching problems both in China and in other countries, puts forward problems of current bus scheduling that exists in our country today, explains the reason of selecting this problem, and states the significance of the research, logic, methods, the main conten in the research process.The second section of the dissertation, introduces the definition of the regional bus scheduling, the method of dividing areas, and the advantages of regional scheduling, analyzes the necessary function characters of APTS, the scheduling process of the regional bus scheduling under APTS, and the division of the regional scheduling, and outlines the reginal bus scheduling system under APTS.The third section of the dissertation, designes a cooperative timetable model for a given regional buses, that enables the transfer of passengers from one route to another with minimum waiting time in the region. Because of the large set of binary discrete values involved, this is complicated problem. And the combinatorial nature of the problem poses a computational burden and makes it difficult to solve using classical methods, and genetic algorithm is heuristic stochastic search algorithm, which is good at global search, an improved genetic algorithm is developed to solve the problem.The fourth section of the dissertation, analyzes the connotation of regional bus scheduling planning problem, introduces time-space network, based on the time-space network, builds regional bus scheduling planning model, decomposes the problem by time and space, and utilizes tabu search for ideas to improve the algorithm, and verifies the model and algorithm through examples.The fifth section of the dissertation, studies the dynamic regional bus scheduling problem under APTS, and according to the scope of scheduling, the regional bus dynamic scheduling strategy were separated into two methods, one is line dynamic scheduling, another is local dynamic scheduling. In line dynamic scheduling, the holding strategies and dispatching vehicles in the form of options have been studied. A model of local dynamic scheduling is proposes to get the minimum total time of plus defer time, and corresponding algorithm was found.Finally, a summary is given and some problems to be further studied are discussed.