CN111160815B - Automatic compilation method and system for operation plan of railway freight transport locomotive - Google Patents
Automatic compilation method and system for operation plan of railway freight transport locomotive Download PDFInfo
- Publication number
- CN111160815B CN111160815B CN202010257278.2A CN202010257278A CN111160815B CN 111160815 B CN111160815 B CN 111160815B CN 202010257278 A CN202010257278 A CN 202010257278A CN 111160815 B CN111160815 B CN 111160815B
- Authority
- CN
- China
- Prior art keywords
- locomotive
- time
- sub
- locomotives
- train
- 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.)
- Active
Links
- 230000003137 locomotive effect Effects 0.000 title claims abstract description 366
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000007306 turnover Effects 0.000 claims abstract description 45
- 238000010586 diagram Methods 0.000 claims abstract description 13
- 238000011156 evaluation Methods 0.000 claims description 14
- 230000008569 process Effects 0.000 claims description 13
- 238000012216 screening Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 7
- 238000004458 analytical method Methods 0.000 claims description 6
- 230000000694 effects Effects 0.000 claims description 6
- 230000007246 mechanism Effects 0.000 abstract description 3
- 239000011159 matrix material Substances 0.000 description 18
- 238000012423 maintenance Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 5
- 230000008439 repair process Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000002360 preparation method Methods 0.000 description 2
- 230000002035 prolonged effect Effects 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000007670 refining Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention relates to a method and a system for automatically compiling a railway freight transport locomotive operation plan, wherein the method comprises the steps of establishing an index system; analyzing a dynamic planning model of the locomotive according to the index system; evaluating the effectiveness of the dynamic planning model; and realizing an automatic programming algorithm for locomotive application according to the effectiveness of the dynamic planning model. The method comprises the steps of analyzing the influence of aspects such as locomotive road crossing, an operation mechanism, locomotive technical operation time, a crew control system and the like on a locomotive turnover diagram, so as to construct an index system; dynamically distributing the locomotives in different sub-stages, and improving the locomotive utilization rate through the compressor locomotive turnover period; the locomotive turnover chart can be manually adjusted according to the running line condition of the train, the workload of dispatching personnel is reduced, and the working efficiency is improved.
Description
Technical Field
The invention belongs to the field of locomotive scheduling, and particularly relates to a method and a system for automatically compiling an operation plan of a railway freight transport locomotive.
Background
In recent years, with the development of automation and intelligence of information technology, each department of railways gradually develops a way to improve work efficiency and benefit. The railway department inherits the development concept of improving the turnover period and the operation efficiency of the locomotive and strengthening the locomotive and the crew management, and needs to improve the traditional inefficient locomotive operation and crew management mode. Therefore, the automatic programming of the locomotive accelerates the turnover of the locomotive, and the improvement of the operating efficiency of the locomotive becomes an important embodiment form of system intellectualization, and is also a research subject faced by each department of the railway in the future.
Aiming at the problem of reasonably optimizing and configuring locomotive resources, a lot of scholars make a lot of research on the aspect of locomotive turnaround chart compilation, and mainly focus on the following aspects:
1. compiling and researching a locomotive turnover diagram of a single type in a fixed section;
all trains in a traction section are configured with the same type, and the optimization problem that the single type uses the least locomotives in a fixed section is solved by adopting methods such as a manual simulation method, a man-machine conversation method, a linear programming method and the like.
2. Compiling and researching a locomotive turnover diagram of a fixed section multi-model;
the multi-model compilation is to compile locomotive turnover graphs respectively according to models, convert multi-model problems into a plurality of single-model problems, and finally aim at solving the optimization problem that a single-model locomotive in a fixed section uses the least locomotives.
3. Study on a turnover diagram of a single locomotive in a non-fixed section;
the multiple traction sections use the same type for turnover, and the turnover time of the compressor vehicle such as network flow, simulated annealing and ant colony algorithm is adopted, so that the utilization rate of the locomotive is improved.
Aiming at the realization problem of a locomotive turnaround graph compilation system, the current research is stopped in the aspect of the overall structural design of the system, and the locomotive turnaround graph compilation under various locomotive traffic operation modes is difficult to meet. Most software still needs too much manual work to complete the whole compilation of the locomotive turnaround graph. The dispatching personnel need to comprehensively analyze the current locomotive operation condition in the locomotive sketching process and reasonably allocate locomotive resources according to the train operation condition, and the system can not achieve the automatic and intelligent targets.
Therefore, a method and system are needed to solve the problem of automatic compilation of locomotive turnaround maps.
Disclosure of Invention
In view of the above problems, the present invention relates to a method for automatically compiling a railway freight transportation locomotive operation plan, which comprises:
establishing an index system;
analyzing a dynamic planning model of the locomotive according to the index system;
evaluating the effectiveness of the dynamic planning model;
according to the effectiveness of the dynamic planning model, an automatic programming algorithm for locomotive application is realized;
wherein the dynamic planning model comprises:
dividing a train operation line into sub-stages;
and solving the optimal solution of the locomotive in each sub-phase according to the index system.
Preferably, the establishing an index system comprises:
a data interface is established with the locomotive operation and security system, and a data table of locomotive and crew information in the locomotive operation and security system is obtained in real time;
selecting three modules of locomotive operation, crew attendance and train running time from the data table as an index system;
and determining the weights of the locomotive operation, the crew attendance and the train running time by utilizing an analytic hierarchy process, and establishing a final locomotive automatic programming index system.
Preferably, the locomotive operation comprises: the method comprises the following steps of (1) locomotive warehousing and unloading, locomotive servicing, locomotive overhaul and locomotive standby;
the crew attendance comprises: location of attendance, time of attendance and time of attendance return;
the train operation time comprises the following steps: train grade, origin, destination, origin time, and end time.
Preferably, the dividing the train operation line into the sub-stages includes:
sorting and grouping the operation lines according to time and space dimensions, wherein each group is a sub-stage;
dividing the train path sections according to the operation line timetable;
when each operation line starting station is used as a first head hanging station, each section node of each line is used as a head hanging station.
Preferably, the solving the optimal solution of each sub-phase locomotive according to the index system comprises:
screening the locomotives meeting the conditions at the station with the head-hanging station;
if the number of the locomotives meeting the conditions is larger than 0, turnover is carried out on the locomotives according to the condition that the locomotives meet the traction conditions of the section;
if the number of the locomotives meeting the conditions is =0, the locomotives are turned around according to the hanging condition of the locomotives.
Preferably, the evaluating the effectiveness of the dynamic planning model includes:
establishing an evaluation standard of an automatic programming algorithm;
evaluating the rationality of the establishment of the locomotive turnover diagram;
and judging whether the utilization rate of the locomotive can be maximized.
Preferably, the making of the evaluation criterion of the automatic programming algorithm includes:
whether the locomotive is reasonably configured for the operation line or not and the shortest turnover time of the locomotive is ensured.
Preferably, the judging whether the locomotive utilization rate can be maximized includes:
the locomotive utilization rate is improved by reducing the locomotive turnover time;
the turnover time of the locomotive = pure running time + intermediate station residence time + residence time of the local section and the turning-back section.
Preferably, the rationality of the locomotive turnaround map compilation includes:
when the automatically configured locomotive meets the train running condition and the condition that the locomotive turnover time is shortest, the locomotive turnover diagram is reasonably compiled;
the train operation condition comprises the following steps: train type, zone of operation, zone pull mode, pull consist, origination point, and time of operation.
The invention also relates to an automatic compilation system for the operation plan of the railway freight transport locomotive, which comprises the following steps:
a building module: used for establishing an index system;
an analysis module: a dynamic planning model for analyzing the locomotive according to the index system;
an evaluation module: the automatic programming algorithm is used for evaluating the effectiveness of the dynamic planning model and realizing the locomotive application according to the effectiveness of the dynamic planning model;
the dynamic planning model comprises:
dividing a train operation line into sub-stages;
and solving the optimal solution of the locomotive in each sub-phase according to the index system.
Preferably, the establishing module includes:
an acquisition unit: the data table is used for establishing a data interface with the locomotive and crew information in the locomotive and crew information management system in real time;
a selecting unit: the system comprises a data table, a data acquisition module, a data processing module and a data processing module, wherein the data table is used for selecting a locomotive operation module, a crew attendance module and a train operation time module from the data table as an index system;
a determination unit: and determining the weights of the locomotive operation, the crew attendance and the train running time by using an analytic hierarchy process, and establishing a final locomotive automatic programming index system.
The invention has the technical effects that:
1. analyzing the influence of aspects such as locomotive road changing, an operation mechanism, locomotive technical operation time, a duty shift system and the like on a locomotive turnover diagram, and constructing an index system;
2. dynamically distributing the locomotives in different sub-stages, and improving the locomotive utilization rate through the compressor locomotive turnover period;
3. the locomotive turnover chart can be manually adjusted according to the running line condition of the train, the workload of dispatching personnel is reduced, and the working efficiency is improved.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
FIG. 1 illustrates a tree diagram of an automatic development evaluation index system for a locomotive operation plan, according to an embodiment of the present invention;
FIG. 2 illustrates a flow chart of dynamic planning decisions for various sub-phases of a locomotive operating line in accordance with an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides an automatic compilation method for an operation plan of a railway freight transport locomotive, which comprises the following steps:
the method comprises the following steps: establishing an index system;
the index system is established on the basis of the existing data table, wherein the internal information of the data table comprises locomotive information and crew information. An information island barrier exists between the existing locomotive information and the existing crew information, the information between the existing locomotive information and the existing crew information cannot correspond to each other, and a data connection interface is established with a crew operation safety system (a railway crew operation safety management system), so that the locomotive and crew information can be acquired in real time.
Illustratively, the locomotive operation and security system hangs a locomotive and dispatches a crew service for the arriving train according to the locomotive dispatching plan, manages the actual locomotive assignment information and crew service dispatching information, finally records the information in the system, and manages the information; the information isolated island is mainly characterized in that information communication is lacked between a railway bureau dispatching station system and a locomotive operation and security system, actual locomotive operation, servicing and maintenance and crew assignment information of a locomotive service section are not transparent to a locomotive dispatcher, and if the dispatcher wants to know the actual locomotive operation and crew information, the information interaction is difficult.
Fig. 1 shows a tree diagram of an automatic compilation evaluation index system of a locomotive operation plan according to an embodiment of the present invention, and as shown in fig. 1, when information is acquired, three modules of locomotive operation, crew attendance and train operation time are selected from the data table as an index system. Wherein the locomotive operation comprises: locomotive application, locomotive warehousing and ex-warehousing, locomotive servicing, locomotive maintenance and locomotive standby; the crew attendance comprises: location of attendance, time of attendance and time of attendance return; the train operation time comprises the following steps: train grade, origin, destination, origin time, and end time.
For example, when obtaining information, fields that may affect automatic programming of the locomotive are selected from existing data tables of the service operation and security system as reference indicators. Existing data sheet in the crew security system: basic locomotive data, basic crew information, basic locomotive crew information, a locomotive crew information table, a nameplate information table, a locomotive exit/entry table, a locomotive servicing table, a locomotive overhaul table and a locomotive standby table.
Wherein, locomotive basic data: the method comprises the following steps of (1) including locomotive number, type, locomotive section, application [ home machine, shunting machine and small operation ] and type [ short standby, overhaul, application and the like ];
basic information of the crew service: the driver account number, the acting section, the acting machine type, the driving license type, the duty name and the contact telephone;
the locomotive dispatching information: the method comprises the steps of (1) including the number of a locomotive, the type of the locomotive, a class dispatching assignment section of the locomotive, a class dispatching number of the locomotive and a station (a trailer station) in charge;
a crew assignment information table: the system comprises a driver work number, a crew section to which a crew is assigned, the number of crew assigned, attendance time and attendance returning time;
name card information table: the system comprises a driver work number, a section for taking charge, a current apartment to be taken, a belonging operation workshop and a contact telephone;
locomotive entry/exit bank table: the method comprises the steps of (1) including locomotive number, locomotive type, entering section time, exiting section time, locomotive service section and workshop;
locomotive servicing table: the method comprises the following steps of (1) including locomotive number, model, preparation workshop, start time and end time;
locomotive maintenance table: the method comprises the following steps of (1) including locomotive number, model, repair workshop, start time and end time;
the locomotive standby meter: including locomotive number, model, standby type, start time, and standby time.
In fig. 1, the locomotive operation is divided into: the operation types of locomotive application, locomotive warehousing and ex-warehouse, locomotive servicing, locomotive overhaul, locomotive standby and the like;
the crew attendance is divided into: location of attendance, time of attendance and time of attendance return;
the train operation time is divided into: train grade, origination station, destination station, origination time, and destination time.
Wherein, if the locomotive overhauls specifically divide into: temporary repair, auxiliary repair, minor repair and major repair.
The locomotive application comprises the following steps: taking the number of vehicles and running kilometers;
the locomotive warehouse entry and exit are divided into: warehousing time, ex-warehouse time and a maintenance section;
the locomotive servicing method comprises the following steps: start time, end time, staging content, and staging location;
the locomotive maintenance is divided into: start time, contact time, inspection content and inspection location;
the standby locomotive is divided into: standby time and standby time.
Acquiring a required data table in a locomotive operation and security system, refining an index system according to three modules of locomotive operation, crew attendance and train operation time, and determining an index weight through an Analytic Hierarchy Process (AHP), thereby establishing a final locomotive operation automatic programming index system.
Illustratively, the step of determining the index weight by the analytic hierarchy process is as follows:
1. establishing a pairwise comparison judgment matrix:
the indexes of the same level are mutually compared and expressed by a comparison degree of 1-9; the comparison results are represented by a contrast matrix, CijIndicates the index CiRelative index CjThe importance value of (c). Note: cijThe range of (A) is 1 to 9, the reciprocal of which is 1 to 1/9.
Judgment matrix and meaning description:
wherein when the scale CijIs 2x (x =1, 2, 3, 4), CiAnd CjIs of importance between Cij=2x-1 and CijAnd =2x + 1. Exemplarily, when x =1, the scale C is nowijHas a value of 2, CiAnd CjIs of importance between Cij=1 and Cij=3, and likewise, when x =2, the scale C is now set toijHas a value of 4, CiAnd CjIs of importance between Cij=3 and Cij=5, and so on, up to CiAnd CjIs of importance between Cij=7 and CijAnd = 9.
When C is presentijWhen the value is reciprocal, i.e. CijWhen (d) is 1/3, CjRatio CiOf slight importance, according to the above table, CijWhen (d) is 1/5, CjRatio CiOf obvious importance, CijWhen (d) is 1/7, CjRatio CiImportant poly, CijWhen (d) is 1/9, CjRatio CiOf absolute importance, in the manner described above, scale CijWhen (d) is 1/2, CjAnd CiIs of importance between Cij=1 and Cij=1/3, scale CijWhen (d) is 1/4, CjAnd CiIs of importance between Cij=1/3 and Cij=1/5, and so on, up to CjAnd CiIs of importance between Cij=1/7 and Cij= 1/9.
2. Calculating the weight of each index:
and calculating the maximum characteristic root by using the contrast matrix C and then carrying out normalization processing. The characteristic root equation is calculated by the formula:
CW=λmaxw, wherein each index weight W is the maximum characteristic root lambdamaxThe feature vector of (2).
3. And (3) checking consistency:
calculate the consistency ratio: CR = CI/RI, if CR is less than 0.1, the matrix is judged to reach the consistency test, and if CR is more than 0.1, the relevant data of the matrix is required to be adjusted. Wherein: CI = (λ)max-n）/（n-1），λmaxThe root is the maximum characteristic root, and n is the number of evaluation indexes.
Wherein: RI is the average consistency index value, and when n is 1 to 10, the table is shown below.
RI index value of order judgment matrix
| Order of the scale | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| RI | 0 | 0 | 0.52 | 0.89 | 1.12 | 1.26 | 1.36 | 1.41 | 1.46 | 1.49 |
4. And obtaining a weight vector through the three steps, and taking the average value of the weight vector to obtain the index weight.
5. According to the constructed hierarchical structure model, 10 judgment matrixes, namely a locomotive automatic compilation judgment matrix, a train information judgment matrix, a locomotive information judgment matrix, a crew service judgment matrix, an arrival/departure train judgment matrix, a locomotive basic information judgment matrix, a locomotive dispatching information judgment matrix, a locomotive operation information judgment matrix, a crew service basic information judgment matrix and a crew service dispatching information judgment matrix, are respectively constructed.
And obtaining an AHP judgment matrix by using the numerical value 1-9 scalar table, solving each index weight, and evaluating each sub-attribute index and a total index according to a principle of total hierarchical ordering so as to determine the index weight through the AHP.
Step two: and analyzing the dynamic planning model of the locomotive according to the index system, wherein the analysis of the dynamic planning model is performed by taking a common freight train as an object for analysis and description, and the dynamic planning model is not limited to the common freight train which is a train type, and is also applicable to high-speed rails, subways and the like.
Exemplary, dynamic planning models are characterized by: the solution problem is decomposed into a plurality of sub-stages, the sub-stages are sequentially solved, the solution of the previous sub-stage provides useful information for the solution of the next sub-stage (each station is equal to the sub-stage, and the solution of the sub-stage is equal to the allocation of a locomotive for the operation line of the station in different time periods). And when the sub-stage is solved, listing possible local solutions, reserving the locomotive with the shortest locomotive turnover time as the local solution through decision, and discarding other local solutions.
The dynamic planning model comprises:
(1) dividing a train operation line into sub-stages;
1. sorting and grouping the operating lines according to time and space dimensions, wherein each group is a sub-stage;
the grouping mode is as follows: and screening the operation lines according to the starting time and the ending time in the train operation timetable, dividing the operation lines of the same station into a sub-stage according to the time sequence, and sequencing the sub-stages according to the starting time of the operation lines.
The ordered sub-stages are as follows:
after the trains are sequenced according to the sub-stage mode, the station A, the station B, the station C and the station N are sequenced according to the time sequence of the operation lines, the priority of the station A is highest, and then the station B, the station C and the station N are sequenced. The train is configured from the first sub-stage, the train TA1 in the station A is started, the train TA in the station A is waited for the end of the configuration of the train in the station A, and then the stations B, C and N are arranged, so that the train TA1 < the train TB2 < the train TC1 … …, and the stations are respectively sequenced.
2. Dividing the train path sections according to the operation line timetable;
the process of automatically attaching the train to the locomotive in each station belongs to a linkage effect in the running line from the station A to the station N, and all stages are mutually influenced. And (3) assigning the locomotive to the first-stage operation line and then assigning the locomotive to the second-stage operation line through a locomotive automatic configuration algorithm. If the locomotive attached to the first stage is unreasonable, the subsequent train can be influenced.
Each operation line starting station is used as a first head hanging station, and each section node is used as a head hanging station.
(2) Solving the optimal solution of each sub-phase locomotive according to the index system;
fig. 2 shows a decision flow chart of dynamic planning of each sub-phase of a locomotive operation line according to an embodiment of the present invention, as shown in fig. 2, a qualified locomotive is screened at a station with a head-end station, and if the station does not have the head-end station, locomotive allocation is directly ended;
wherein, the screening conditions are as follows:
1. the locomotive is not distributed in the overhaul period or kilometers when being used;
2. the dispatching time is met, and the locomotive in the garage meets the servicing and overhauling time standards and the like;
3. the attendance time of the crew is met;
4. the locomotive traction type and the number of the locomotives meet the conditions of line conditions, transportation requirements and the like.
And sorting the running lines according to the time sequence through the screening conditions, and selecting the locomotives meeting the conditions in the station with the head-up station.
If the number of the locomotives meeting the conditions is larger than 0, turnover is carried out on the locomotives according to the condition that the locomotives meet the traction conditions of the section;
wherein the traction conditions are as follows:
1. the locomotive meets the traction requirement of the next section, the running of the locomotive is not over kilometers, and the riding is not overstrain;
the turnover mode is as follows: and arranging the locomotives to carry out cross-zone traction, balancing the stay time of the locomotives in the stations, and configuring the locomotives for the operation lines according to a first-come first-serve principle.
2. The locomotive meets the traction requirements of the section and the next section, and the locomotive runs over kilometers and does not overstrain the riding;
the turnover mode is as follows: the locomotive is folded vertically to meet the turn-back time standard, and the locomotive is prepared after being turned back, and returns to the locomotive service section in a hanging mode to be prepared.
3. The locomotive meets the traction requirements of the section and the next section, the locomotive runs no longer than kilometers, and the riding capacity is overstowed;
carrying out overstrain prompt on the overworked train service to be overtaken, and converting the train service mode according to the train operation condition;
the turnover mode is as follows: midway shift, outer shift and rest retracing.
4. The locomotive meets the traction conditions of the section and the next section, and the locomotive runs over kilometers and overtakes the riding;
carrying out overtimeter prompting on the locomotive to be overtimeter, and preparing the attached locomotive at the current section according to the running condition of the train;
the turnover mode is as follows: the locomotive is attached to the return section when the crew changes the shift.
5. The locomotive meets the traction condition of the section and does not meet the traction condition of the next section;
the turnover mode is as follows: selecting a running line meeting the turn-back time, and carrying out locomotive preparation after the locomotive turns back to the current section; and distributing the locomotives according to the actual conditions of the operation lines when the operation lines do not meet the turn-back time.
If the number of the locomotives meeting the conditions is =0, the locomotives are turned around according to the hanging condition of the locomotives.
Wherein, the attaching condition is as follows:
1. returning to the station without an attached locomotive;
the turnover mode is as follows: and selecting the locomotives and the crews meeting the traction requirements from the adjacent stations, and returning by the single machine.
2. The attached locomotive returns to the original section to meet departure time and section traction conditions;
the turnover mode is as follows: matching the locomotives according to a first-in first-out principle.
And (4) turnover is carried out on the screened locomotives, and when the screened locomotives meet the screening condition and the number of the locomotives is more than 0, locomotive resources are distributed according to an attachment principle. When the number of the locomotives is equal to 0, sequentially screening the locomotives meeting the attachment conditions from the adjacent stations of the head-hanging station; and if the condition is not met, manually allocating locomotive resources.
Step three: evaluating the effectiveness of the dynamic planning model;
the way of judging the effectiveness of the dynamic programming model is as follows:
1. the evaluation standard of the automatic programming algorithm is formulated, and the evaluation standard comprises the following steps:
1) whether it is reasonable to configure the locomotive for the operation line;
2) the locomotive has the shortest turnaround time.
2. Evaluating the rationality of the programming of a locomotive turnaround map, comprising:
the automatically configured locomotive meets the train operating conditions: the train type, the operation section, the section traction mode, the traction fixed number, the starting place and the operation time are adopted, so that the locomotive turnaround graph is reasonably compiled, and the dynamic planning model judgment is effective;
the reasonable operation of the locomotive needs to meet the traction condition of the train,
unreasonable conditions are as follows:
1) in a fixed intersection, locomotive A is in traction operation in zone A, and the locomotive is attached to an operation line in zone B;
2) the electric locomotive is assigned to the operating line of the non-electric section.
3. Judging whether the utilization rate of the locomotive can be maximized, comprising the following steps:
the locomotive utilization rate is improved by reducing the locomotive turnover time.
The turnover time of the locomotive = pure running time + the residence time of the intermediate station + the residence time of the local section and the turning-back section + the residence time of the station where the local section and the turning-back section are located.
Under the condition of certain section length and crew technique (namely pure running time), the residence time of the intermediate station, the residence time of the section and the turning-back section and the residence time of the station of the section and the turning-back section are shortened as much as possible.
The residence time of the locomotive in the local section and the return section comprises the locomotive operation time (servicing, maintenance and the like), and a dispatcher can acquire the operation state in a locomotive warehouse in real time from a locomotive transportation security interface, so that unnecessary telephone communication time is reduced. After the locomotive operation is completed, the locomotive is allocated to the train which is sent out first (the premise is that the locomotive meets the operation line allocation condition).
Exemplary, locomotive under-utilization case:
suppose that there are two trains 1 and 2 starting at 18:00 and 19:00 at station A, and one locomotive A arrives at station A at 15:00, and the locomotive A meets the two trains starting from A. Therefore, the locomotive a can be attached to the train 1 and the train 2, and if the locomotive is attached to the train 2, the residence time of the locomotive in the turning section is prolonged, the turnover time of the locomotive is prolonged, and the operation efficiency of the locomotive is reduced.
The case of high locomotive utilization rate:
suppose that there are two trains 1 and 2 starting at 18:00 and 19:00 at station A, and one locomotive A arrives at station A at 15:00, and the locomotive A meets the two trains starting from A. Therefore, the locomotive A can be attached to the train 1 and the train 2, and if the locomotive is attached to the train 1, the residence time of the locomotive in a return section is reduced relative to the attached train 2, the locomotive turnover time is reduced, and the locomotive operation efficiency is high.
Failure of the locomotive to achieve maximum utilization efficiency may result in increased costs, reduced work efficiency for dispatchers, reduced locomotive cash rates, and the like. The data of the locomotive, the train, the crew and the like can be used for carrying out model evaluation comparison tests to check whether the utilization rate of the locomotive reaches the maximum.
Step four: according to the effectiveness of the dynamic planning model, an automatic programming algorithm for locomotive application is realized;
the reason for selecting the dynamic planning model is as follows:
the train operation process is influenced by space and time, belongs to a dynamic change process, and when a certain condition changes, other operation lines can be influenced to generate a series of chain reactions.
The purpose of automatic programming is adopted:
firstly, the method comprises the following steps: the computer automatically and comprehensively considers the influence factors of the operation line, the locomotive, the crew attendance and the like;
secondly, the method comprises the following steps: the labor and time of the dispatching personnel are saved, and the working efficiency is improved.
The locomotive applies a dynamic planning model to comprehensively consider factors influencing the establishment of a locomotive turnover diagram, and the operation lines are sorted and grouped according to time and space dimension pieces, wherein each group is a sub-stage. The sub-stages are not mutually independent, the solution of the next sub-stage is further solved on the basis of the solution of the previous sub-stage, when the sub-stages solve the optimal configuration of the locomotive, all possible local solutions are listed, the local locomotives which are possibly optimal are reserved through locomotive configuration rules, the problem that the locomotives are configured on each operation line is sequentially solved, and the overall optimal solution is obtained.
The locomotive turnaround graph compiling system is designed from the aspects of system design target, requirement analysis, overall functional structure, data design, interface design and the like, and the locomotive turnaround graph target is quickly and accurately compiled by utilizing a computer technology and adopting an automatic compiling algorithm. The locomotive automatic programming test is carried out through the field actual data, and the effects of automatic locomotive number starting, return line connection, locomotive over kilometers, riding over-duty prompt and the like are achieved.
The invention also relates to an automatic compilation system for the operation plan of the railway freight transport locomotive, which comprises the following steps:
a building module: used for establishing an index system;
an analysis module: a dynamic planning model for analyzing the locomotive according to the index system;
an evaluation module: the automatic programming algorithm is used for evaluating the effectiveness of the dynamic planning model and realizing the locomotive application according to the effectiveness of the dynamic planning model;
the dynamic planning model comprises:
dividing a train operation line into sub-stages;
and solving the optimal solution of the locomotive in each sub-phase according to the index system.
The establishing module comprises:
an acquisition unit: the data table is used for establishing a data interface with the locomotive and crew information in the locomotive and crew information management system in real time;
a selecting unit: the system comprises a data table, a data acquisition module, a data processing module and a data processing module, wherein the data table is used for selecting a locomotive operation module, a crew attendance module and a train operation time module from the data table as an index system;
a determination unit: and determining the weights of the locomotive operation, the crew attendance and the train running time by using an analytic hierarchy process, and establishing a final locomotive automatic programming index system.
When the automatic locomotive compiling model is constructed, locomotive traffic is properly increased, the locomotive turnover time is reduced, and the aims of balanced locomotive application and the maximum locomotive application rate are fulfilled. The locomotive turnaround chart of the non-fixed section multi-machine type breaks through the limitation of a locomotive traction section, comprehensively considers factors such as the locomotive type, locomotive traffic, a locomotive operation mechanism, a riding mode, locomotive technical operation and the like, and reasonably allocates locomotive resources for a train operation chart by using a dynamic planning algorithm.
The dynamic planning model realizes that the locomotive application automatic compilation not only improves the transportation production efficiency and the locomotive utilization rate, but also improves the staff efficiency, achieves the effect of achieving half the effort for managing the locomotive and the crew and achieves the intelligent target of the railway freight transportation system.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. An automatic compilation method for the operation plan of a railway freight transport locomotive is characterized in that,
the method comprises the following steps:
establishing an index system;
analyzing a dynamic planning model of the locomotive according to the index system;
evaluating the effectiveness of the dynamic planning model, comprising: establishing an evaluation standard of an automatic programming algorithm; evaluating the rationality of the establishment of the locomotive turnover diagram; judging whether the utilization rate of the locomotive can be maximized;
according to the effectiveness of the dynamic planning model, an automatic programming algorithm for locomotive application is realized;
wherein the dynamic planning model comprises:
dividing the train operation lines into sub-stages, sorting and grouping the operation lines according to time and space dimensions, wherein each group is a sub-stage, screening the operation lines according to the starting time and the final station time in a train operation timetable, dividing the operation lines of the same station into sub-stages according to the time sequence, and sorting the sub-stages according to the starting time of the operation lines;
dividing the train path sections according to the operation line timetable, automatically allocating locomotives to the trains in each station, wherein the process belongs to a linkage effect, and each sub-stage is mutually influenced;
solving the optimal solution of each sub-phase locomotive according to the index system, and screening the locomotives meeting the conditions at the stations with the head-hanging stations when solving the optimal solution of each sub-phase locomotive;
if the number of the locomotives meeting the conditions is larger than 0, turnover is carried out on the locomotives according to the condition that the locomotives meet the traction conditions of the section;
if the number of the locomotives meeting the conditions is =0, the locomotives are turned over according to the hanging condition of the locomotives;
the optimal solution of each sub-phase locomotive comprises: the sub-stages are not mutually independent, the solution of the next sub-stage is further solved on the basis of the solution of the previous sub-stage, when the sub-stages solve the optimal configuration of the locomotive, all possible local solutions are listed, the local locomotives which are possibly optimal are reserved through locomotive configuration rules, the problem that the locomotives are configured on each operation line is sequentially solved, and the overall optimal solution is obtained.
2. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 1,
the establishing index system comprises the following steps:
a data interface with the locomotive and crew operation security system is established, and a data table of locomotive and crew operation information in the locomotive and crew operation security system is obtained in real time;
selecting three modules of locomotive operation, crew attendance and train running time from the data table as an index system;
and determining the weights of the locomotive operation, the crew attendance and the train running time by utilizing an analytic hierarchy process, and establishing a final locomotive automatic programming index system.
3. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 2, wherein,
the locomotive operation comprises: the method comprises the following steps of (1) locomotive warehousing and unloading, locomotive servicing, locomotive overhaul and locomotive standby;
the crew attendance comprises: location of attendance, time of attendance and time of attendance return;
the train operation time comprises the following steps: train grade, origin, destination, origin time, and end time.
4. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 1,
the dividing of the train operation line into sub-stages comprises:
sorting and grouping the operation lines according to time and space dimensions, wherein each group is a sub-stage;
dividing the train path sections according to the operation line timetable;
when each operation line starting station is used as a first head hanging station, each section node of each line is used as a head hanging station.
5. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 1,
the evaluation criterion for formulating the automatic programming algorithm comprises the following steps:
whether the locomotive is reasonably configured for the operation line or not and the shortest turnover time of the locomotive is ensured.
6. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 1,
the determining that locomotive utilization is maximized comprises:
the locomotive utilization rate is improved by reducing the locomotive turnover time;
the turnover time of the locomotive = pure running time + intermediate station residence time + residence time of the local section and the turning-back section.
7. The automatic compilation method for a railroad freight transportation locomotive operation plan according to claim 1,
the rationality of the locomotive turnaround map compilation includes:
when the automatically configured locomotive meets the train running condition and the condition that the locomotive turnover time is shortest, the locomotive turnover diagram is reasonably compiled;
the train operation condition comprises the following steps: train type, zone of operation, zone pull mode, pull consist, origination point, and time of operation.
8. An automatic compilation system for a railway freight transportation locomotive operation plan, comprising:
a building module: used for establishing an index system;
an analysis module: a dynamic planning model for analyzing the locomotive according to the index system;
an evaluation module: an automatic programming algorithm for evaluating the effectiveness of the dynamic planning model and implementing locomotive operation based on the effectiveness of the dynamic planning model, comprising: establishing an evaluation standard of an automatic programming algorithm; evaluating the rationality of the establishment of the locomotive turnover diagram; judging whether the utilization rate of the locomotive can be maximized;
the dynamic planning model comprises:
dividing the train operation lines into sub-stages, sorting and grouping the operation lines according to time and space dimensions, wherein each group is a sub-stage, screening the operation lines according to the starting time and the final station time in a train operation timetable, dividing the operation lines of the same station into sub-stages according to the time sequence, and sorting the sub-stages according to the starting time of the operation lines;
dividing the train path sections according to the operation line timetable, and enabling the train inside each station to automatically attach to a locomotive process to belong to a linkage effect, wherein all sub-stages are mutually influenced;
solving the optimal solution of each sub-stage locomotive according to an index system, selecting locomotives meeting conditions in a station with a head-hanging station when solving the optimal solution of each sub-stage locomotive, and if the number of the locomotives meeting the conditions is more than 0, turning over the locomotives according to the condition that the locomotives meet the traction conditions of a section;
if the number of the locomotives meeting the conditions is =0, the locomotives are turned over according to the hanging condition of the locomotives;
the optimal solution of each sub-phase locomotive comprises: the sub-stages are not mutually independent, the solution of the next sub-stage is further solved on the basis of the solution of the previous sub-stage, when the sub-stages solve the optimal configuration of the locomotive, all possible local solutions are listed, the local locomotives which are possibly optimal are reserved through locomotive configuration rules, the problem that the locomotives are configured on each operation line is sequentially solved, and the overall optimal solution is obtained.
9. The automatic compilation system for a railroad freight transportation locomotive operation plan according to claim 8,
the establishing module comprises:
an acquisition unit: the data interface is used for establishing a data interface with the locomotive and crew operation safety system and acquiring a data table of locomotive and crew operation information in the locomotive and crew operation safety system in real time;
a selecting unit: the system comprises a data table, a data acquisition module, a data processing module and a data processing module, wherein the data table is used for selecting a locomotive operation module, a crew attendance module and a train operation time module from the data table as an index system;
a determination unit: and determining the weights of the locomotive operation, the crew attendance and the train running time by using an analytic hierarchy process, and establishing a final locomotive automatic programming index system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010257278.2A CN111160815B (en) | 2020-04-03 | 2020-04-03 | Automatic compilation method and system for operation plan of railway freight transport locomotive |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010257278.2A CN111160815B (en) | 2020-04-03 | 2020-04-03 | Automatic compilation method and system for operation plan of railway freight transport locomotive |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111160815A CN111160815A (en) | 2020-05-15 |
| CN111160815B true CN111160815B (en) | 2020-11-06 |
Family
ID=70567815
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010257278.2A Active CN111160815B (en) | 2020-04-03 | 2020-04-03 | Automatic compilation method and system for operation plan of railway freight transport locomotive |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111160815B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112550372B (en) * | 2020-11-16 | 2023-01-06 | 卡斯柯信号有限公司 | Method for automatically changing traffic route and turning back during interrupted operation based on operation diagram |
| CN112418733A (en) * | 2020-12-14 | 2021-02-26 | 西安市轨道交通集团有限公司 | Intelligent checking system for subway riding traffic scheme |
| CN113269349B (en) * | 2021-04-15 | 2024-07-16 | 北京交通大学 | Motor car intersection plan management method and application |
| CN114524004B (en) * | 2022-01-04 | 2023-06-20 | 国能包神铁路集团有限责任公司 | Locomotive operation statistical method, device, equipment and storage medium |
| CN115946745A (en) * | 2023-03-10 | 2023-04-11 | 北京全路通信信号研究设计院集团有限公司 | Analysis method and system for train operation plan |
| CN116674613B (en) * | 2023-08-03 | 2023-10-24 | 北京全路通信信号研究设计院集团有限公司 | Locomotive turnover control method, device, equipment and medium for railway small-running locomotive |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104778523B (en) * | 2014-01-15 | 2018-01-12 | 上海亨钧科技有限公司 | A kind of enterprise railway intelligence operation management operation plan generation method and its system |
| US11379730B2 (en) * | 2016-06-16 | 2022-07-05 | The Aerospace Corporation | Progressive objective addition in multi-objective heuristic systems and methods |
| CN107284480B (en) * | 2017-06-08 | 2019-10-29 | 北京交通大学 | A kind of automatic preparation method of route map of train based on the multiplexing of vehicle bottom |
| CN107563546B (en) * | 2017-08-17 | 2021-06-04 | 西南交通大学 | High-speed railway train running chart compiling method based on regional collaboration |
| CN107704950A (en) * | 2017-09-14 | 2018-02-16 | 北京交通大学 | A kind of city rail train figure optimization method based on trip requirements and energy saving of system |
-
2020
- 2020-04-03 CN CN202010257278.2A patent/CN111160815B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111160815A (en) | 2020-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111160815B (en) | Automatic compilation method and system for operation plan of railway freight transport locomotive | |
| CN112598182B (en) | Intelligent scheduling method and system for rail transit | |
| CN105575108B (en) | A kind of intelligent public transportation dispatching method for running | |
| WO2018023331A1 (en) | System and method for real-time evaluation of service index of regular public buses | |
| CN113920769B (en) | Intelligent scheduling list generation method based on public transportation multi-source data analysis | |
| CN110222990B (en) | Train whole-course scheduling method and system based on traffic flow calculation | |
| CN108082224B (en) | Urban rail transit train running chart compiling method based on AFC time-varying passenger flow | |
| CN111815189A (en) | Modular bus dispatching system | |
| CN107564270A (en) | A kind of intelligent public transportation dispatching method for running | |
| CN109774750A (en) | Dynamic scheduling space-time decision method based on virtual coupling mode | |
| CN115860594A (en) | Simulation system and method applied to intelligent bus scheduling | |
| CN115456343B (en) | Intelligent airport evaluation index system construction and evaluation method | |
| CN113344380A (en) | Bus operation index classification and evaluation method | |
| Lin et al. | Intelligent bus operation optimization by integrating cases and data driven based on business chain and enhanced quantum genetic algorithm | |
| CN109214577A (en) | A kind of composite transport channel percentage of passenger transport prediction technique | |
| Feng et al. | Long-term equilibrium relationship analysis and energy-saving measures of metro energy consumption and its influencing factors based on cointegration theory and an ARDL model | |
| CN110598971A (en) | Response type public transportation service planning method based on ant colony algorithm | |
| Li et al. | Optimal track utilization in electric multiple unit maintenance depots | |
| Salih et al. | A Case Study of Bus Line Passenger Volumes of Bakrajo Bus Lines in Sulaimani City | |
| Amorim et al. | Discrete event-based railway simulation model for Eco-efficiency evaluation | |
| Meiquan et al. | Modeling circulation of train-set with multiple routing | |
| CN114524004A (en) | Statistical method, device, equipment and storage medium for locomotive operation | |
| CN114148382A (en) | Train operation diagram compiling method facing virtual formation | |
| Hou et al. | Optimization of Urban Rail Passenger and Freight Collaborative Transport Scheme under The Dual-Carbon Objective | |
| Wang et al. | Carrying capacity and efficiency optimization model for freight train segment train |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |