CN103198370A - Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains - Google Patents
Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains Download PDFInfo
- Publication number
- CN103198370A CN103198370A CN2012100022995A CN201210002299A CN103198370A CN 103198370 A CN103198370 A CN 103198370A CN 2012100022995 A CN2012100022995 A CN 2012100022995A CN 201210002299 A CN201210002299 A CN 201210002299A CN 103198370 A CN103198370 A CN 103198370A
- Authority
- CN
- China
- Prior art keywords
- motor
- car
- information processing
- channel
- cross
- 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 periodic use and maintenance schedules of bullet trains. The method of the automatic schedule information processing of the periodic use and the maintenance schedules of the bullet trains comprises the following steps that (1) a dispatch terminal sends operation state information of traction zones and the bullet trains to a calculation engine server; (2) the calculation engine server uses the received operation state information of the traction zones and the bullet trains as input, and calculates information of bullet trains arranged on each traction zone in a period and information of bullet trains in maintenance each day through a mixed integral linear programming model; and (3) the calculation engine server obtains the operation condition of each traction zone and operation state information of each bullet train according to the information of the bullet trains arranged on each traction zone in the period and the information of the bullet trains in maintenance each day. The device of the automatic schedule information processing of the periodic use and the maintenance schedules of the bullet trains comprises the dispatch terminal, the calculation engine server and a database server. Compared with an existing manual schedule technology, the method and the device of the automatic schedule information processing of the periodic use and the maintenance schedules of the bullet trains have the advantages of enabling the periodic use and the maintenance schedules of the bullet trains to be automatic and intelligent and the like.
Description
Technical field
The present invention relates to a kind of motor car inspection and repair plan automatic arrangement program correlation technique, especially relate to a kind of motor-car Zhou Yunyong and turnaround plan automatic arrangement program information processing method and device.
Background technology
Lasting acceleration along with the continuous development of national economy and city, Development of China's Urbanization, intercity Passenger Traffic continues rapid growth, the contradiction of railway capacity anxiety becomes increasingly conspicuous, the Existing Railway Line transportation, particularly passenger transport seriously lags behind, do not catch up with changes in market demand, Chinese Railway is faced with very urgent situation.Build Line for Passenger Transportation, realize passenger-cargo separation, it is the important content of implementing Mid-term and Long-term Plan of the Railway Network, it also is the direction of world's railway development, Line for Passenger Transportation has been alleviated the railway transport capacity bottleneck, has improved passenger transport speed, has expanded movement capacity, has promoted the whole equipment of railway technology, has been realized railway modernization, for the national economy fast development provides strong support.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 the motor car inspection and repair upkeep operation planning software of function synthesized, advanced technology.
The secondary maintenance is expanding and extending of one-level maintenance, is following the introduction inspection standard, guarantees on the basis not in bad repair, adjusts the time between overhauls(TBO), increases the maintenance corner, realizes the requirement of major tune-up and emphasis maintenance.The main project of maintenance: switchboard, traveling portion, connecting portion, car body both sides etc. in Insulation test, roof equipment, pilothouse, top facility, the car, be carried out in accordance with regulations cleaning or the replacing of filter screen, Total Test and the inspection of equipment such as go forward side by side wardrobe cover branch and device, brake system, vehicle-mounted monitoring screen.The time between overhauls(TBO) that secondary is repaiied is 30,000 kilometers, and the repair time is about 12 hours.
Present domestic motor-car Zhou Yunyong and secondary maintenance are repaiied plan by yardman's hand-coding in conjunction with special project.Because secondary revision of the convention bundle is more, the cycle that consider is long, and the plan execution is bigger to the operation influence, is generally write by veteran yardman.The manual compiling turnaround plan time is long, efficient is low and enforceability is effective inadequately.
Summary of the invention
Purpose of the present invention is exactly to provide a kind of motor-car Zhou Yunyong and turnaround 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 Zhou Yunyong and turnaround 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 cross-channel and motor-car running state information;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates in the cycle motor-car that every cross-channel arranges and the motor-car information of overhauling every day with the cross-channel that receives and motor-car running state information;
3) motor-car arranged according to every cross-channel in the cycle of computing engines server and the motor-car information of overhauling every day obtain the ruuning situation of every cross-channel and the running state information of each motor-car;
4) judge whether the result who obtains is feasible, if yes, execution in step 5), if not, readjust model parameter, return step 2);
5) the computing engines server judges that by heuritic approach whether healthy and strong obtain the result, if yes, and execution in step 6), if not, return step 2);
6) will obtain the result and send to dispatch terminal, select for the user.
Described cross-channel and motor-car running state information comprise days running and the milimeter number of each bar cross-channel, accumulation fate and milimeter number after current distance maintenance last time of each motor-car, and the service ability information of inspection and repair shop.
The IBM ILOG CPLEX that described MILP (Mixed Integer Linear Programming) model is embedded in the computing engines server optimizes in the engine.
Described cross-channel and motor-car running state information be as constraint condition, the accumulation milimeter number of motor-car and accumulation fate as variable, the accumulation milimeter number sum that minimizes all motor-cars with accumulate the fate sum as objective function.
Described heuritic approach is specially:
Every the cross-channel distance travelled that obtains is added the disturbance of a Normal Distribution, 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.
The device of a kind of motor-car Zhou Yunyong and turnaround plan automatic arrangement program information processing method is characterized in that, comprises dispatch terminal, computing engines server and database server, and described computing engines server is connected with dispatch terminal, database 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 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 following advantages:
1, make motor-car Zhou Yunyong and turnaround plan automatic arrangement program information processing robotization, intellectuality, it is low to have solved yardman's plan of writing length consuming time, efficient, problem such as does not optimize;
2, replace human brain to calculate with computing machine, in acceptable time, can infer the turnaround plan of long period, reach the time span that human brain can not be reached;
3, have very strong expansibility and portability simultaneously, can be applied to easily in the middle of the motor-car Zhou Yunyong and turnaround plan scheduling 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 Zhou Yunyong and turnaround plan automatic arrangement program information processing method may further comprise the steps:
1) dispatch terminal sends to the computing engines server with cross-channel and motor-car running state information;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates in the cycle motor-car that every cross-channel arranges and the motor-car information of overhauling every day with the cross-channel that receives and motor-car running state information;
3) motor-car arranged according to every cross-channel in the cycle of computing engines server and the motor-car information of overhauling every day obtain the ruuning situation of every cross-channel and the running state information of each motor-car;
4) judge whether the result who obtains is feasible, if yes, execution in step 5), if not, readjust model parameter, return step 2);
5) the computing engines server judges that by heuritic approach whether healthy and strong obtain the result, if yes, and execution in step 6), if not, return step 2);
6) will obtain the result and send to dispatch terminal, select for the user.
Described cross-channel and motor-car running state information comprise days running and the milimeter number of each bar cross-channel, accumulation fate and milimeter number after current distance maintenance last time of each motor-car, and the service ability information of inspection and repair shop.
The IBM ILOG CPLEX that described MILP (Mixed Integer Linear Programming) model is embedded in the computing engines server optimizes in the engine.Described cross-channel and motor-car running state information be as constraint condition, the accumulation milimeter number of motor-car and accumulation fate as variable, the accumulation milimeter number sum that minimizes all motor-cars with accumulate the fate sum as objective function.
Described heuritic approach is specially: every the cross-channel distance travelled that obtains is added the disturbance of a Normal Distribution, 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, hardware configuration of the present invention comprises dispatch terminal 1, computing engines server 2, database server 3 and disk array 4, and described computing engines server 2 is connected with dispatch terminal 1, database server 3 respectively.Described dispatch terminal 1 is connected with computing engines server 2 by access switch 6, core switch 7 backs successively.Described computing engines server 2 is connected with database server 3 respectively by core switch 7.Disk array 4 is by SAN switch 5 and database server 3.
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.
Aspect optimization, system sets up problem earlier by mixed integer programming model calls IBM ILOG CPLEX engine then and finds the solution this model.The information that is input as cross-channel and motor-car running status of model comprises days running, the milimeter number of each bar cross-channel, accumulation fate and milimeter number after current distance maintenance last time of each motor-car, and the service ability of inspection and repair shop.Model was output as in the cycle, the motor-car of arranging on every cross-channel, the motor-car that overhauls every night.In given these moment, system just can arrange out the ruuning situation of every cross-channel, the running status of each motor-car (the accumulation milimeter number and the accumulation fate that comprise motor-car).After obtaining this arrangement, system uses heuritic approach to come reliability and the robustness of verification model, distance travelled people to every cross-channel is the disturbance that adds a Normal Distribution, if after adding such disturbance, arrangement scheme originally is still feasible, is " stalwartness " with regard to claiming such arrangement.We are divided into several cycles to the operating scheme in the required time, find the solution respectively for each cycle employing said method, are superimposed then, just can obtain several healthy and strong feasible solutions and select for the user.
Repair at secondary and to repair in conjunction with special project, whether we arrange each motor-car as the 0-1 variable at cross-channel, as variable, constraint condition comprises after the availability, maintenance quantitative limitation, motor car inspection and repair of availability, the cross-channel of motor-car the influence of accumulation milimeter number and accumulation fate etc. the accumulation milimeter number of motor-car and accumulation fate.Objective function is the accumulation milimeter number sum and accumulation fate sum that minimizes all motor-cars.After adopting IBM ILOG CPLEX optimization engine to try to achieve optimum solution, we can guarantee that the general health of motor-car improves through a such arrangement, and can satisfy the restriction of all needs and the maintenance vehicle number of cross-channel.
Claims (9)
1. a motor-car Zhou Yunyong and turnaround 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 cross-channel and motor-car running state information;
2) the computing engines server as input, by the MILP (Mixed Integer Linear Programming) model, calculates in the cycle motor-car that every cross-channel arranges and the motor-car information of overhauling every day with the cross-channel that receives and motor-car running state information;
3) motor-car arranged according to every cross-channel in the cycle of computing engines server and the motor-car information of overhauling every day obtain the ruuning situation of every cross-channel and the running state information of each motor-car;
4) judge whether the result who obtains is feasible, if yes, execution in step 5), if not, readjust model parameter, return step 2);
5) the computing engines server judges that by heuritic approach whether healthy and strong obtain the result, if yes, and execution in step 6), if not, return step 2);
6) will obtain the result and send to dispatch terminal, select for the user.
2. a kind of motor-car Zhou Yunyong according to claim 1 and turnaround plan automatic arrangement program information processing method, it is characterized in that, described cross-channel and motor-car running state information comprise days running and the milimeter number of each bar cross-channel, current accumulation fate and the milimeter number after maintenance last time of each motor-car, and the service ability information of inspection and repair shop.
3. a kind of motor-car Zhou Yunyong according to claim 1 and turnaround plan automatic arrangement program information processing method 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 Zhou Yunyong according to claim 1 and turnaround plan automatic arrangement program information processing method, it is characterized in that, described cross-channel and motor-car running state information are as constraint condition, the accumulation milimeter number of motor-car and accumulation fate as variable, the accumulation milimeter number sum that minimizes all motor-cars with accumulate the fate sum as objective function.
5. a kind of motor-car Zhou Yunyong according to claim 1 and turnaround plan automatic arrangement program information processing method is characterized in that described heuritic approach is specially:
Every the cross-channel distance travelled that obtains is added the disturbance of a Normal Distribution, 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 Zhou Yunyong of claim 1 and turnaround plan automatic arrangement program information processing method, it is characterized in that, comprise dispatch terminal, computing engines server and database server, described computing engines server is connected with dispatch terminal, database server respectively.
7. the device of motor-car Zhou Yunyong according to claim 6 and turnaround plan automatic arrangement program information processing method 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 Zhou Yunyong according to claim 6 and turnaround plan automatic arrangement program information processing method is characterized in that, described computing engines server is connected with database server respectively by core switch.
9. the device of motor-car Zhou Yunyong according to claim 6 and turnaround plan automatic arrangement program information processing method 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 |
|---|---|---|---|
| CN2012100022995A CN103198370A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100022995A CN103198370A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103198370A true CN103198370A (en) | 2013-07-10 |
Family
ID=48720895
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100022995A Pending CN103198370A (en) | 2012-01-06 | 2012-01-06 | Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103198370A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106845789A (en) * | 2016-12-27 | 2017-06-13 | 国电南瑞科技股份有限公司 | Based on the automatic pre- discharge method of Transit Equipment year repair schedule for repairing journey |
| 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 |
| CN112966842A (en) * | 2021-03-29 | 2021-06-15 | 卡斯柯信号(成都)有限公司 | Subway vehicle maintenance plan automatic generation method based on time slice segmentation |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007109785A2 (en) * | 2006-03-23 | 2007-09-27 | Toyota Technical Center, Usa, Inc. | System and method of collision avoidance using intelligent navigation |
-
2012
- 2012-01-06 CN CN2012100022995A patent/CN103198370A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007109785A2 (en) * | 2006-03-23 | 2007-09-27 | Toyota Technical Center, Usa, Inc. | System and method of collision avoidance using intelligent navigation |
Non-Patent Citations (3)
| Title |
|---|
| 李鹏: "基于交路互换的客运专线动车组检修计划的研究", 《中国优秀硕士学位论文全文数据库 工程科技辑》》 * |
| 李鹏: "基于交路互换的客运专线动车组检修计划的研究", 《中国优秀硕士学位论文全文数据库 工程科技辑》》, 15 October 2010 (2010-10-15), pages 57 - 65 * |
| 陈华群: "动车组运用计划编制***相关问题研究", 《中国优秀硕士学位论文全文数据库 工程科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106845789A (en) * | 2016-12-27 | 2017-06-13 | 国电南瑞科技股份有限公司 | Based on the automatic pre- discharge method of Transit Equipment year repair schedule for repairing journey |
| 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 |
| CN112966842A (en) * | 2021-03-29 | 2021-06-15 | 卡斯柯信号(成都)有限公司 | Subway vehicle maintenance plan automatic generation method based on time slice segmentation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mavi et al. | Bus rapid transit (BRT): A simulation and multi criteria decision making (MCDM) approach | |
| Kang et al. | A practical model for last train rescheduling with train delay in urban railway transit networks | |
| Salido et al. | Robustness for a single railway line: Analytical and simulation methods | |
| Giacco et al. | Short-term rail rolling stock rostering and maintenance scheduling | |
| Yan et al. | Logistical support scheduling under stochastic travel times given an emergency repair work schedule | |
| Nesheli et al. | Environmental impacts of public transport systems using real-time control method | |
| CN106600027A (en) | Urban traffic carbon emission measurement and calculation system, and measurement and calculation method | |
| Salido et al. | Robustness in railway transportation scheduling | |
| CN107704950A (en) | A kind of city rail train figure optimization method based on trip requirements and energy saving of system | |
| CN105128894A (en) | Train running scheduling method and running scheduling system | |
| CN103886743A (en) | Urban public transport operation scheme optimization method | |
| Van Oort et al. | Reliability improvement in short headway transit services: Schedule-and headway-based holding strategies | |
| Shen et al. | Public transit planning and scheduling based on AVL data in China | |
| 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 | |
| Bertini et al. | Experience implementing a user service for archived intelligent transportation systems data | |
| CN103198369A (en) | Method and device of automatic schedule information processing of bullet train daily maintenance schedule | |
| CN106157609A (en) | The monitoring method of a kind of block status and device | |
| Liu et al. | Data analytics approach for train timetable performance measures using automatic train supervision data | |
| CN103198370A (en) | Method and device of automatic schedule information processing of periodic use and maintenance schedules of bullet trains | |
| CN109272158A (en) | A kind of city railway vehicle frame overhaul system and method | |
| Kang et al. | Decisions on train rescheduling and locomotive assignment during the COVID-19 outbreak: A case of the Beijing-Tianjin intercity railway | |
| Wang et al. | Real-time dispatching of operating buses during unplanned disruptions to urban rail transit system | |
| CN107705545A (en) | A kind of emphasis commerial vehicle tracing point compensation process and system | |
| CN202495087U (en) | Bullet train weekly use and maintenance plan automatic scheduling information processing device | |
| Sangphong et al. | Determining critical rail line blocks and minimum train headways for equal and unequal block lengths and various train speed scenarios |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130710 |