CN103198369A - Method and device of automatic schedule information processing of bullet train daily maintenance schedule - Google Patents
Method and device of automatic schedule information processing of bullet train daily maintenance schedule Download PDFInfo
- Publication number
- CN103198369A CN103198369A CN2012100022904A CN201210002290A CN103198369A CN 103198369 A CN103198369 A CN 103198369A CN 2012100022904 A CN2012100022904 A CN 2012100022904A CN 201210002290 A CN201210002290 A CN 201210002290A CN 103198369 A CN103198369 A CN 103198369A
- Authority
- CN
- China
- Prior art keywords
- motor
- car
- server
- information processing
- station track
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a method and a device of automatic schedule information processing of a bullet train daily maintenance schedule. The method of the automatic schedule information processing of the bullet train daily maintenance schedule comprises the following steps that (1) station track information and bullet train information are sent to a calculation engine server; (2) the calculation engine server calculates information of an entrance moment and a departure moment of each group of bullet trains on maintenance station tracks and washing station tracks through a mixed integral linear programming model; (3) the calculation engine server judges whether calculation results are feasible, when the calculation results are feasible, a step (4) is carried out, and when the calculation results are not feasible, model parameters are adjusted again, and the step (2) is carried out again; (4) the calculation engine server judges whether the calculation results are strong through a heuristic algorithm, when the calculation results are strong, a step (5) is carried out, and when the calculation results are not strong, the step (2) is carried out again; and (5) the obtained calculation results are sent to a dispatch terminal and an application server to be selected by a user. The device of the automatic schedule information processing of the bullet train daily maintenance schedule comprises the dispatch terminal, the calculation engine server, a database server and the application server. Compared with an existing manual schedule technology, the method and the device of the automatic schedule information processing of the bullet train daily maintenance schedule have the advantages of being automatic, high in efficiency, good in expansibility and transportability, and the like.
Description
Technical field
The present invention relates to a kind of motor-car scheduling correlation technique, especially relate to a kind of motor-car maintenance repair plan automatic arrangement program information processing method and device.
Background technology
The Development of High Speed Railway of China is in the construction period of a fast development, and high ferro revenue kilometres, overall trip speed and gordian technique level all are in rank first at present.Along with Line for Passenger Transportation operation scale constantly enlarges, in order to guarantee the operation rapidly and efficiently of high speed passenger dedicated railway motor train unit, must have method for optimizing resources and the upkeep operation planning software of the motor car inspection and repair of function synthesized, advanced technology.
At first, the management mode of overseas high speed railway, speed target value, overhaul of the equipments etc. have larger difference with China Line for Passenger Transportation, and referential experience is few; Secondly, motor train unit also is very different with traditional passenger's motor-car formation, and traditional like this maintenance mode, system and mechanism's facility etc. can not be applicable to Line for Passenger Transportation.Therefore, very be necessary the characteristics in conjunction with China's Line for Passenger Transportation, study and define the overhaul of train-set plan that meets Line for Passenger Transportation.
Study and define the upkeep operation plan of motor train unit, satisfy demand of passenger transport, improve the motor-car utilization factor, ensure the property safe and reliable to operation of motor train unit.Overhaul of train-set plan and plan of passenger traffic are coordinated mutually, realize the reasonable disposition of motor-car quantity and the optimization of upkeep operation plan to greatest extent, reduce the non-essential motor train unit residence time and repair time, improve utilization and the overhaul efficiency of motor train unit, have important use and be worth.
At present, the turnaround plan of motor train unit is in the mode of traditional artificial calculating establishment, because the turnaround plan of motor train unit need constantly change along with the operational plan of motor-car, the enforceability that adopts artificial plan of calculating establishment inadequately effectively and inefficiency.Therefore, the thinking of dealing with problems is that the turnaround plan of motor train unit is set up model, makes the turnaround plan of scientific and reasonable motor train unit with the means of intelligent optimization.
Summary of the invention
Purpose of the present invention is exactly to provide a kind of robotization, efficient height, expansion and portable high motor-car maintenance repair plan automatic arrangement program information processing method and device for the defective that overcomes above-mentioned prior art existence.
Purpose of the present invention can be achieved through the following technical solutions:
A kind of motor-car maintenance repair plan automatic arrangement program information processing method is characterized in that, may further comprise the steps:
1) dispatch terminal sends to the computing engines server with station track information, and database server sends to the computing engines server with motor-car information simultaneously;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates the station track information that receives and motor-car information each car in the maintenance station track and cleans entering and departure time information on the station track;
3) the computing engines server judges whether result of calculation is feasible, if yes, and execution in step 4), if not, readjust model parameter, return step 2);
4) the computing engines server judges that by heuritic approach whether healthy and strong obtain result of calculation, if yes, and execution in step 5), if not, return step 2);
5) result of calculation that obtains is sent to dispatch terminal and application server, select for the user.
Described station track information comprises maintenance and cleans quantity and the station track of shunting of station track; Described motor-car information comprise going into of each motor-car and go out time and the needed time of shunting service of institute moment, the needed maintenance of each motor-car and cleaning.
The IBM ILOG CPLEX that described MILP (Mixed Integer Linear Programming) model is embedded in the computing engines server optimizes in the engine.
Described each motor-car go into and go out institute constantly, the quantity of needed time of time, shunting service, maintenance and the cleaning station track of the needed maintenance of each motor-car and cleaning and the station track of shunting be as constraint condition, each car entering with the departure time as integer variable on maintenance station track and cleaning station track.
Described heuritic approach is specially:
To each car of calculating in the maintenance station track and clean the disturbance that adds a Normal Distribution with departure time information that enters on the station track, and judge whether arrangement scheme original after adding such disturbance is feasible, if yes, this result of calculation is healthy and strong, otherwise this result of calculation is not for healthy and strong.
A kind of device of motor-car maintenance repair plan automatic arrangement program information processing method, it is characterized in that, comprise dispatch terminal, computing engines server, database server and application server, described computing engines server is connected with dispatch terminal, database server, application server respectively.
Described dispatch terminal is successively by being connected with the computing engines server behind access switch, the core switch.
Described computing engines server is connected with database server, application server respectively by core switch.
Also comprise disk array, this disk array is by SAN switch and database server.
Compared with prior art, the present invention has the plan of arranging an order according to class and grade of the formulation motor car inspection and repair of science and scheme as requested, has very strong expansibility and portability simultaneously, can be applied to easily in the middle of the scheduling plan of other road bureaus.
Description of drawings
Fig. 1 is process flow diagram of the present invention;
Fig. 2 is hardware configuration synoptic diagram of the present invention.
Embodiment
The present invention is described in detail below in conjunction with the drawings and specific embodiments.
Embodiment
As shown in Figure 1, a kind of motor-car maintenance repair plan automatic arrangement program information processing method may further comprise the steps:
1) dispatch terminal sends to the computing engines server with station track information, and database server sends to the computing engines server with motor-car information simultaneously;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates the station track information that receives and motor-car information each car in the maintenance station track and cleans entering and departure time information on the station track;
3) the computing engines server judges whether result of calculation is feasible, if yes, and execution in step 4), if not, readjust model parameter, return step 2);
4) the computing engines server judges that by heuritic approach whether healthy and strong obtain result of calculation, if yes, and execution in step 5), if not, return step 2);
5) result of calculation that obtains is sent to dispatch terminal and application server, select for the user.
Described station track information comprises maintenance and cleans quantity and the station track of shunting of station track; Described motor-car information comprise going into of each motor-car and go out time and the needed time of shunting service of institute moment, the needed maintenance of each motor-car and cleaning.The IBM ILOG CPLEX that described MILP (Mixed Integer Linear Programming) model is embedded in the computing engines server optimizes in the engine.Described each motor-car go into and go out institute constantly, the quantity of needed time of time, shunting service, maintenance and the cleaning station track of the needed maintenance of each motor-car and cleaning and the station track of shunting be as constraint condition, each car entering with the departure time as integer variable on maintenance station track and cleaning station track.
Linear programming is one of key areas in the optimization problem, is a kind of mathematical method that auxiliary people carry out scientific management.Practical problems in a lot of operational research can be explained with linear programming.Some special circumstances of linear programming, for example problem such as network flow, many commodity flows all is considered to extremely important, and a large amount of specializing in its algorithm are arranged.The optimization problem algorithm of a lot of other kinds can be split into the linear programming subproblem, tries to achieve solution then.Same, in microeconomics and commercial management field, linear programming is widely used in the problem of cost minimization of the maximization of solution income or production run and so on, the material resources of namely rationally disposing available manpower.What linear programming was studied is: under certain condition, resources such as the material resources of rationally disposing available manpower make economic effect reach best.Usually, ask the maximal value of linear objective function under linear constraint condition or the problem of minimum value, be referred to as linear programming problem.The solution that satisfies the linear restriction condition is called feasible solution, and the set of being made up of all feasible solutions is called feasible zone.Decision variable, constraint condition, objective function are the three elements of linear programming.
When some was needed as integer when the variable in the linear programming, we just claimed such MILP (Mixed Integer Linear Programming) that is planned to.The range of application of integral linear programming is extremely extensive, not only aspect industry and engineering design and the scientific research many application is being arranged, and at aspects such as computing machine design, system reliability, coding and economic analyses new application is being arranged also.Integral linear programming proposes to form individual branches after the cutting-plane method from 1958 by R.E. Ge Moli.Developed since half a century and a lot of methods solution variety of issues.Separating the most typical way of integer programming is progressively to generate a relevant problem, claims that it is the problem of deriving of former problem.Each problem of deriving is followed a relaxation problem that is easier to find the solution than it (problem of deriving is called the source problem of relaxation problem) again.Determine the home to return to of its source problem by the solution of relaxation problem, namely source problem should be rejected, or the problem of deriving of the one or more itselfs of regeneration substitutes it.Select the problem of deriving of that be not rejected as yet or the former problem that substitutes immediately again, repeat above step until no longer surplus the unsolved problem of deriving is arranged till.Success at present relatively popular method again is branch and bound method and cutting-plane method, and they all form under said frame.
IBM ILOG CPLEX optimizes engine provides solution the actual required ability of large-scale optimization problem, and can realize rudimentary algorithm with the fastest speed the most reliably, makes a strategic decision thereby formulate accurately and reasonably.The optimizer of high-performance flexibly that it provides can solve problems such as linear programming, quadratic programming and mixed integer programming.CPLEX not only by the outstanding mathematics grounding in basic skills in its behind, can utilize a plurality of CPU especially, allows be operated among each CPU and processes respectively, thereby realize calculating faster effect.
IBM ILOG CPLEX also provides development interface and multi-platform transplantability flexibly.In application development and deployment, the developer can visit CPLEX by most of programmed environments, for example C, C++, Java .Net language etc.It can be deployed on a plurality of platforms and use, and comprises AIX, HP Unix, Linux, Macintosh, Sun Solaris, Windows etc., has really realized portability.
Described heuritic approach is specially: to each car of calculating in the maintenance station track and clean the disturbance that adds a Normal Distribution with departure time information that enters on the station track, and judge whether arrangement scheme original after adding such disturbance is feasible, if yes, this result of calculation is healthy and strong, otherwise this result of calculation is not for healthy and strong.
As shown in Figure 2, a kind of device of motor-car maintenance repair plan automatic arrangement program information processing method, comprise dispatch terminal 1, computing engines server 4, database server 6, application server 5 and disk array 8, described computing engines server 4 is connected with dispatch terminal 1, database server 6, application server 5 respectively.Described dispatch terminal 1 is connected with computing engines server 4 by access switch 2, core switch 3 backs successively.Described computing engines server 4 is connected with database server 6, application server 5 respectively by core switch 3.Described disk array 8 is connected with database server 6 by SAN switch 7.
Claims (9)
1. a motor-car maintenance repair plan automatic arrangement program information processing method is characterized in that, may further comprise the steps:
1) dispatch terminal sends to the computing engines server with station track information, and database server sends to the computing engines server with motor-car information simultaneously;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates the station track information that receives and motor-car information every group of motor-car in the maintenance station track and cleans entering and departure time information on the station track;
3) the computing engines server judges whether result of calculation is feasible, if yes, and execution in step 4), if not, readjust model parameter, return step 2);
4) the computing engines server judges that by heuritic approach whether healthy and strong obtain result of calculation, if yes, and execution in step 5), if not, return step 2);
5) result of calculation that obtains is sent to dispatch terminal and application server, select for the user.
2. a kind of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 1 is characterized in that, described station track information comprises maintenance and cleans quantity and the station track of shunting of station track; Described motor-car information comprise each group motor-car go into institute and go out institute moment, each organizes time and the needed time of shunting service of the needed maintenance of motor-car and cleaning.
3. a kind of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 2 is characterized in that, the IBM ILOG CPLEX that described MILP (Mixed Integer Linear Programming) model is embedded in the computing engines server optimizes in the engine.
4. a kind of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 3, it is characterized in that, described each group motor-car go into institute and go out institute constantly, the quantity of needed time of time, shunting service, maintenance and the cleaning station track of each group needed maintenance of motor-car and cleaning and the station track of shunting be as constraint condition, every group of motor-car overhauling entering with the departure time as integer variable on station track and the cleaning station track.
5. a kind of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 4 is characterized in that described heuritic approach is specially:
To every group of motor-car calculating in the maintenance station track and clean the disturbance that adds a Normal Distribution with departure time information that enters on the station track, and judge whether arrangement scheme original after adding such disturbance is feasible, if yes, this result of calculation is healthy and strong, otherwise this result of calculation is not for healthy and strong.
6. device of implementing the described motor-car maintenance repair of claim 1 plan automatic arrangement program information processing method, it is characterized in that, comprise dispatch terminal, computing engines server, database server and application server, described computing engines server is connected with dispatch terminal, database server, application server respectively.
7. the device of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 6 is characterized in that, described dispatch terminal is successively by being connected with the computing engines server behind access switch, the core switch.
8. the device of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 6 is characterized in that described computing engines server is connected with database server, application server respectively by core switch.
9. the device of motor-car maintenance repair plan automatic arrangement program information processing method according to claim 6 is characterized in that, also comprises disk array, and this disk array is by SAN switch and database server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100022904A CN103198369A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of bullet train daily maintenance schedule |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100022904A CN103198369A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of bullet train daily maintenance schedule |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103198369A true CN103198369A (en) | 2013-07-10 |
Family
ID=48720894
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100022904A Pending CN103198369A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of bullet train daily maintenance schedule |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103198369A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104517195A (en) * | 2015-01-04 | 2015-04-15 | 上海杰之能信息科技有限公司 | Fault localization automated method for motor train unit |
| CN111047144A (en) * | 2019-11-18 | 2020-04-21 | 杉数科技(北京)有限公司 | Flight task ring generation method and device for scheduling of unit |
| CN112215418A (en) * | 2020-10-12 | 2021-01-12 | 苏州大学 | Method and device for automatically generating multi-rail vehicle washing and checking arrangement scheme and storage medium |
| CN112749944A (en) * | 2019-10-30 | 2021-05-04 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium |
| CN112749942A (en) * | 2019-10-30 | 2021-05-04 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium |
-
2012
- 2012-01-06 CN CN2012100022904A patent/CN103198369A/en active Pending
Non-Patent Citations (4)
| Title |
|---|
| 李鹏: "《基于交路互换的客运专线动车组检修计划的研究》", 《中国优秀硕士论文电子期刊网 工程科技辑》 * |
| 王忠凯等: "《动车组管理信息***的云计算支撑平台研究》", 《第六届中国只能交通年会暨第七届国际节能与新能源汽车创新发展论坛优秀论文集（智能交通）》 * |
| 王莹等: "《基于列生成算法的动车组检修计划优化》", 《中国铁道科学》 * |
| 陈华群: "《动车组运用计划编制***相关问题研究》", 《中国优秀硕士论文电子期刊网》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104517195A (en) * | 2015-01-04 | 2015-04-15 | 上海杰之能信息科技有限公司 | Fault localization automated method for motor train unit |
| CN112749944A (en) * | 2019-10-30 | 2021-05-04 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium |
| CN112749942A (en) * | 2019-10-30 | 2021-05-04 | 顺丰科技有限公司 | Scheduling method, device, equipment and storage medium |
| CN111047144A (en) * | 2019-11-18 | 2020-04-21 | 杉数科技(北京)有限公司 | Flight task ring generation method and device for scheduling of unit |
| CN111047144B (en) * | 2019-11-18 | 2020-12-22 | 杉数科技(北京)有限公司 | Flight task ring generation method and device for scheduling of unit |
| CN112215418A (en) * | 2020-10-12 | 2021-01-12 | 苏州大学 | Method and device for automatically generating multi-rail vehicle washing and checking arrangement scheme and storage medium |
| CN112215418B (en) * | 2020-10-12 | 2024-04-16 | 苏州大学 | Method, device and storage medium for automatically generating washing inspection arrangement scheme of multi-rail vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | Digital twin and its application in transportation infrastructure | |
| CN105740556B (en) | The automatic preparation method of route map of train based on passenger flow demand | |
| Yan et al. | Optimal scheduling of emergency roadway repair and subsequent relief distribution | |
| Guo et al. | Efficiency Assessment of Transit‐Oriented Development by Data Envelopment Analysis: Case Study on the Den‐en Toshi Line in Japan | |
| Panchenko et al. | Formation of an automated traffic capacity calculation system of rail networks for freight flows of mining and smelting enterprises | |
| CN110843870B (en) | Method for maintaining fixed capacity of high-speed railway network graph under abnormal event | |
| Salido et al. | Robustness for a single railway line: Analytical and simulation methods | |
| Yan et al. | Logistical support scheduling under stochastic travel times given an emergency repair work schedule | |
| Salido et al. | Robustness in railway transportation scheduling | |
| Nesheli et al. | Environmental impacts of public transport systems using real-time control method | |
| CN105303285A (en) | Intelligent allocation method for power emergency disposal materials | |
| CN103198369A (en) | Method and device of automatic schedule information processing of bullet train daily maintenance schedule | |
| CN105608541A (en) | Electric power material supply whole-course early-warning supervise system and method | |
| CN102509018A (en) | System and method for evaluating importance of power system facilities | |
| CN103050016B (en) | Hybrid recommendation-based traffic signal control scheme real-time selection method | |
| CN106296127A (en) | A kind of dynamic construction system and method for intelligent substation operation flow | |
| López-Ramos | Integrating network design and frequency setting in public transportation networks: a survey | |
| To | Centrality of an urban rail system | |
| Šomplák et al. | Contribution to Global Warming Potential by waste producers: Identification by reverse logistic modelling | |
| Pan et al. | A column generation-based approach for integrated vehicle and crew scheduling on a single metro line with the fully automatic operation system by partial supervision | |
| Gao et al. | An alternative approach for high speed railway carrying capacity calculation based on multiagent simulation | |
| CN103955744B (en) | Track traffic for passenger flow distribution model parameter automatic calibration method and device | |
| Liu et al. | Data analytics approach for train timetable performance measures using automatic train supervision data | |
| Chen et al. | Data-driven planning of plug-in hybrid electric taxi charging stations in urban environments: A case in the central area of Beijing | |
| CN202495086U (en) | Bullet train daily maintenance plan automatic scheduling information processing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130710 |
|
| RJ01 | Rejection of invention patent application after publication |