Font Size: a A A

Study On Models And Algorithms Of Automatically Making Stage Plan For Railroad Locomotive Depot Station

Posted on:2004-04-26Degree:DoctorType:Dissertation
Country:ChinaCandidate:J XuFull Text:PDF
GTID:1102360092990794Subject:Transportation planning and management
Abstract/Summary:PDF Full Text Request
The stage plan for railway depot station is one of the operative plans, by which the dispatchers in the station manage all transportation work. A high-quality operative plan should focus on the important tasks, organize car flow into all kind of trains according to the demands of the marshalling plan, ensure that all departure trains leave station on time, schedule exactly the decomposing and marshalling of all trains and suitably arrange all trains to occupy the arrival and departure lines. At present, railway depot station daily-shift operative plans are drawn up manually, which is inefficient, and the dispatchers draw the plan chart by hand, which is toilsome. Therefore, the realization of automatically making the daily-shift plan with computer is practical value on the spot, which is conducive to increase the speed of making plan and improve quality of operative plan, upgrade the capacity of railway and greatly lessen the dispatcher's physical work.In order to study the problem of automatically making railway locomotive station operative plan and making a high quality plan, above all, we ought to analyze the operation system of the station, know thoroughly the procedures of operation system and make acquainted with regulations of all the work of the stations. Thus, the paper introduces all the essential facilities, the procedure of all operations, such as marshalling, decomposing, fetching and delivering train, of the stations and coordinate work of all department, so that the working of automatically making stage plan with computer is well grounded on.It is significant in theory and in effect that automatically making operative plan with computer. The spottiness of plans workout can be avoided because of people's different thought patterns and professional characteristics, in effect; In theory, the method of making operative plan for district stations will be further developed and the relative mathematics theories will be boosted. To better elucidate the following critical problems -- building the rational mathematics model and searching the effective algorithms, this paper sets forth the basis of algorithms and heuristic algorithm. Meanwhile it compendiously introduces the main principles of genetic algorithm and the stimulated annealing algorithm, principal parameters during the course of solving problems and vertex coloringtheory.This paper analyzes the network model of cars flow organization related to my work, which was presented in the references and points out that it is improper. Analyzing in detail the mental activities, which the dispatchers have during the course of dispatching, I find out the rules used for reference and the essential theory meeting the demand of operative plans with computers aided. According to the regulations above, the paper presents the virtual price and profit function in the course of selecting cars for the departing trains and the model of the grouping cars into arrival trains. Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations, this paper analyzes the features of time sets of shunting locomotives, constructs the reasonable graph model in the way of making out time sets, and converts it into the problem of graph coloring. The paper exploits then method of combining the simulated annealing algorithm with genetic algorithm for the question and designs the coding way which based on ordinal characters, builds up fitness function on the basis of penalty function, adopts the basal technology, such as crossover, mutation etc. to deal with the model and put forward adjustable algorithms for trains occupying time sets. Consulting on the method of arrangement of shunting locomotives, the mathematical model of the arrival and departure lines occupying arrangement is set up. I apply the hybrid algorithm that combines greedy-selector into genetic algorithm to the question and get satisfactory answers.During the process of algorithm realization with computer, this paper draws a conclusion, which the syste...
Keywords/Search Tags:railway district station, stage plan, genetic algorithm, simulated annealing algorithm, k-vertex coloring
PDF Full Text Request
Related items