CN111260260A - Method and system for calculating passing capacity of high-speed rail motor car - Google Patents
Method and system for calculating passing capacity of high-speed rail motor car Download PDFInfo
- Publication number
- CN111260260A CN111260260A CN202010157986.9A CN202010157986A CN111260260A CN 111260260 A CN111260260 A CN 111260260A CN 202010157986 A CN202010157986 A CN 202010157986A CN 111260260 A CN111260260 A CN 111260260A
- Authority
- CN
- China
- Prior art keywords
- motor train
- train unit
- time
- motor
- scheme
- 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
- 238000000034 method Methods 0.000 title claims abstract description 167
- 230000008569 process Effects 0.000 claims abstract description 94
- 238000004364 calculation method Methods 0.000 claims abstract description 42
- 238000005457 optimization Methods 0.000 claims abstract description 19
- 238000007514 turning Methods 0.000 claims description 20
- 238000010977 unit operation Methods 0.000 claims description 11
- 238000010845 search algorithm Methods 0.000 claims description 8
- 238000012546 transfer Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 claims description 3
- 238000011156 evaluation Methods 0.000 claims description 3
- 238000012423 maintenance Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 9
- 238000002360 preparation method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 230000008901 benefit Effects 0.000 description 6
- 230000008439 repair process Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000003754 machining Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000003111 delayed effect Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000002035 prolonged effect Effects 0.000 description 2
- 239000011541 reaction mixture Substances 0.000 description 2
- 230000001172 regenerating effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000005406 washing Methods 0.000 description 2
- 101100346179 Arabidopsis thaliana MORC7 gene Proteins 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention relates to the technical field of high-speed rails, in particular to a method and a system for calculating passing capacity of a high-speed rail motor car. The method comprises the following steps: constructing a passing capacity calculation model of the high-speed rail motor car; generating a feasible motor train unit shunting operation plan initial scheme to obtain a maximum passing capacity initial value of the motor train; optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest out-of-service location as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest out-of-service location; and continuously applying the dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit, and continuously optimizing the dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, wherein the obtained maximum number of the whole motor train units is the passing capacity of the motor train units. The modeling process is convenient and simple, the modeling standard is unified, the method is real and reliable, the method has comprehensive consideration factors, and the method has good operability, universality and reusability.
Description
Technical Field
The invention relates to the technical field of high-speed rails, in particular to a method and a system for calculating passing capacity of a high-speed rail motor car.
Background
The high-speed railway motor train station is used for bearing all maintenance work and motor train unit parking operation of the motor train unit except high-grade maintenance, and is generally arranged near a starting station, a final station and a hub station of a high-speed railway line, so that the motor train unit is guaranteed to have a maintenance and preparation place in a safe and normal operating state. The passing capacity of the motor train refers to the maximum number of the motor train units which can be connected and reconditioned in a given time period under certain equipment conditions and operation modes.
At present, the passing capacity calculation method of the high-speed rail motor car is less in research, the calculation is mainly carried out by using the calculation idea and method of the passing capacity of the common station, the accuracy of the calculation result is not high, and the main problems are solved as follows:
1. the traditional utilization rate method of the general speed station and the bus service station is used for calculation, various parameters in a formula are required to be selected by the method, the influence of the values of the various parameters is limited, and the accuracy of a calculation result is not high.
2. In the calculation process, the motor car equipment is regarded as a plurality of independent links for capacity analysis, and the passing capacity research under the integrated application of the motor car equipment is lacked.
3. The traditional utilization rate method only obtains the capacity estimation value, and can not effectively measure the coordination of the passing capacity of the motor train and the adjacent interval and the high-speed rail station.
Disclosure of Invention
The invention aims to provide a method and a system for calculating the passing capacity of a high-speed rail vehicle, so as to improve the problems. In order to achieve the purpose, the technical scheme adopted by the invention is as follows:
in one aspect, the application provides a method for calculating capacity of a high-speed rail vehicle, which includes:
constructing a passing capacity calculation model of the high-speed rail motor car; generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of a motor train unit; optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest out-of-service location as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest out-of-service location; and continuously applying the dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit, and continuously optimizing the dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, wherein the obtained maximum number of the whole motor train units is the passing capacity of the motor train units. According to the motor train unit shunting operation plan scheme under the condition of maximum capacity passing capacity, the equipment capacity bottleneck of the motor train unit is determined, the coordination matching performance of each equipment capacity of the motor train unit is determined, and the utilization rate of the passing capacity of the motor train unit is improved by adjusting the equipment use scheme of the capacity bottleneck.
Optionally, the passing capacity calculation model of the high-speed rail vehicle comprises:
constructing a model objective function; and constructing a constraint condition.
The objective function is shown in equation (1):
in the formula (1), Z is the sum of the motor train units with different servicing operation flows in each direction, and niThe number of the motor train sets of the servicing work flow i handled by the motor trains is shown;
the constraints include the following formula:
in the formula (2), niNumber of motor train units n representing servicing operation flow of ii′Number of motor train units R representing servicing operation flow i' handled by motor traini/i′The set constant represents the proportion of the motor train unit receiving and dispatching with the servicing operation flow i as a denominator, which is obtained by taking the number of the motor train units with a certain servicing operation flow i 'as a denominator and is specified by the motor train unit operation plan, namely, the parameter i' is fixed relative to the variable i;
in the formula (3), xijkrIs a variable from 0 to 1, and represents x if the kth shunting operation of the jth motor train unit with the overhaul process flow of i is arranged on a station track r of a field depotijkr1, otherwise xijkr＝0，i＝1,2,...M,j＝1,2,...ni,k＝1,2,...Di；
In the formula (5), the first and second groups,
the starting time of the kth shunting operation of the jth motor train unit with the preparation flow i is shown, and the starting time is also the occupied strand of the motor train unit for handling certain operationA track start time;
the method comprises the steps that the end time of the kth shunting operation of the jth motor train unit with the servicing process flow i is represented, and the end time of the occupation of a station track due to handling of a certain operation of the motor train unit is also represented;
representing the servicing time standard of the kth shunting operation of the jth motor train unit with the servicing flow being i;
in the formula (6), the first and second groups,
and
respectively indicates the starting time and the ending time of the kth 'shunting operation of the jth motor train unit with the preparation process i', i 'is 1,2,. M, j' is 1,2,. ni′,k′＝1,2,...Di；
In the formula (8) and the formula (9),
and
respectively represents the number i of the preparation processThe entrance time and the exit time of the j-row motor train unit;
in the formula (10), CijkrThe method comprises the steps that the benefit of operation on a station track r arranged in a yard is shown in the kth operation of the jth motor train unit with the servicing process i; when the motor train unit is arranged on the track r which cannot be used or is not allowed to be used according to the organization regulation of the motor train unitijkrNot equal to 0, otherwise Cijkr＝1；
In formula (11), yijklAnd y'ijklAll are variable 0-1, if the approach route is arranged on l when the jth motor train unit with the servicing process flow of i is switched from the previous task to the kth task, y isijkl1, otherwise yijkl0; y 'if the route is arranged on l when the jth motor train unit with the preparation flow of i is shifted out from the kth task to the next task'ijkl1, otherwise'ijkl＝0；
In the formula (12), IInter-arrival spaceRepresenting the minimum arrival interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i'; i isInterval of arrivalRepresenting the minimum arrival interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i'; i isStarting intervalThe minimum departure interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i' is represented; i isTo the intervalRepresenting the minimum sending interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i'; p is a radical ofll′A variable of 0-1, if there is a conflict between routes l and lpll′1, otherwise pll′＝0；
Optionally, the generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to the constraint conditions and the decision variables to obtain a maximum passing capacity initial value of the motor train unit includes:
determining a dispatching operation plan compiling principle of the motor train unit according to the dispatching operation characteristics and the target of the motor train unit; and generating a feasible motor train unit shunting operation plan initial scheme meeting the constraint condition according to the motor train unit shunting operation plan compiling principle to obtain the maximum passing capacity initial value of the motor train unit.
Optionally, the planning principle of the shunting operation plan of the motor train unit includes:
determining rules of the sequence of the motor train unit entering and exiting the motor train unit; determining rules of time when the motor train unit enters or exits the motor train unit; arranging rules of the arrival and departure routes of the motor train unit; arranging rules of the tracks of the motor train unit; arranging rules of the motor train unit transfer route; the time of the track occupation of the motor train unit is regular; and (5) solving the conflict of the operation of the motor train unit.
Optionally, the determining a rule for determining the sequence of the motor train unit entering or exiting the motor train unit comprises:
generating a group of minimum motor train unit sets which accord with the formation proportion of the motor train unit servicing operation process types; sequentially and randomly selecting the motor train units from the set, arranging the operation plan until the set is empty, and regenerating a group of motor train unit set;
the rule for determining the time when the motor train unit enters or leaves the motor train unit comprises the following steps:
taking the starting time of the passing capacity calculation period of the motor train as a starting time point, taking the arrival time of the motor train unit entering the motor train as the starting time of the passing capacity calculation period of the motor train, and sequentially increasing the motor train units entering the motor train according to the minimum arrival tracking interval to obtain a formula (14):
in the formula (14), the reaction mixture,
showing the time when the previous motor train unit enters the motor train unit, IInter-arrival spaceRepresents a minimum arrival tracking interval;
determining the departure time of the motor train unit according to the total residence time of the motor train unit in the motor train unit;
the determining of the motor train unit arrival route arrangement rule comprises the following steps:
arranging the motor train unit to a launching route according to the rule of the maximum parallel route;
the method for determining the track arrangement rule of the motor train unit comprises the following steps:
arranging the station track where each overhaul operation of the motor train unit is located according to a first-come-first arrangement, a station track compact use priority rule of key equipment and a station track balance use rule; because some equipment resources of the motor train unit have scarcity, such as maintenance storehouses, garage washing, wheel turning and wheel repair and the like, the invalid time of the motor train unit occupying the key equipment is reduced, and the practicability of the technical operation plan of the motor train unit is improved.
The method for determining the arrangement rule of the shunting route of the motor train unit comprises the following steps:
arranging routes according to the rules that the departure depot shunting routes are preferentially entered into the depot shunting routes and the maximum parallel routes are preferentially entered;
the rule for determining the time occupied by the station track of the motor train unit comprises the following steps:
and (3) arranging the track occupation time according to the minimum operation time standard rule, wherein the specific time is shown as a formula (15):
the motor train unit operation conflict resolution rule comprises the following steps:
when the motor train unit carries out station track arrangement according to the operation process and operation conflict occurs, the operation start-stop time needs to be adjusted to resolve the conflict. The operation is performed differently in two cases:
when the motor train unit is in and out of a conflict of receiving and sending routes or a conflict of parking lines, all trains in conflict with the routes of the motor train unit are required to be compared, minimum time adjustment amounts required to be met by conflict resolution of the trains are calculated respectively, and the time of getting in and out of the motor train unit is adjusted according to the minimum value;
when a diversion route or track conflict occurs in other operations except for an entrance and exit, the start time of the operation needs to be delayed while the end time of the previous operation is prolonged, namely, the waiting time is generated in the previous operation and is equal to the minimum time adjustment amount which can be utilized after all available tracks are vacated.
Optionally, the generating a feasible motor train unit shunting operation plan initial scheme meeting constraint conditions according to the motor train unit shunting operation plan compiling principle to obtain a maximum passing capacity initial value of the motor train unit includes the following steps:
s2021, assigning an initial value to the total number n of the motor train unit as 0, and assigning the total number z of the working procedures of the motor train unit as 0;
s2022, generating a group of minimum sets of motor train unit proportions according with different servicing operation flow types;
s2023, judging whether plans are arranged for all motor train units in the set, if yes, turning to the step S2022; otherwise, randomly selecting a motor train unit without a schedule from the current set;
s2024, selecting an operation to be arranged according to the servicing operation process of the motor train unit;
s2025, determining the time of the motor train unit to enter and exit according to the motor train unit time determining rule;
s2026, arranging station yard operation tracks, arrival routes and diversion routes required by operation for the motor train unit according to a motor train unit arrival route arrangement rule, a motor train unit track occupation time rule and a motor train unit diversion shunting route arrangement rule; if the idle station track or route cannot be found in the operation, the operation arrangement of the motor train unit conflicts with other motor train units, the step S2027 is executed, and otherwise, the step S2028 is executed;
s2027, adjusting the operation start-stop time and the access path occupation start-stop time of the motor train unit according to the motor train unit operation conflict resolution rule, and turning to the step S2026;
s2028, if the ending time of the operation of the motor train unit is more than that
The termination time of the job is set to
And step S2029; otherwise, judging whether all the operation items of the motor train unit are scheduled, if so, recording the motor train unit, wherein n is n +1, turning to the step S2023, recording the operation plan of the motor train unit, and z is z +1, and turning to the step S2024;
and S2029, outputting the current values of n and z to obtain the maximum passing capacity initial value of the motor car.
Optionally, the optimizing and adjusting the shunting operation plan scheme of the motor train unit by using the minimum time when the motor train unit is at the latest exit as an optimizing index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest exit, includes:
and carrying out optimization adjustment according to a hybrid neighborhood tabu search algorithm based on the longest active chain.
Optionally, the method for optimizing and adjusting the shunting operation plan scheme of the motor train unit by using the minimum time when the motor train unit is at the latest exit as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest exit comprises the following steps:
s301, setting the iteration number as 1, and setting the initial scheme of the first stage as the current scheme;
s302, randomly searching a longest active chain of shunting operation of the motor train unit, moving or exchanging the motor train unit operation of the active blocks on the active chain according to rules, arranging the operation time of the relevant working procedures of the moved longest active chain to generate a neighborhood solution, and repeating the step S302 to obtain the solution
Evaluating the candidate set solutions by using the maximum evaluation index;
s303, judging whether the objects in the candidate solution meet scofflaw criteria, selecting objects which are not taboo in the neighborhood solution and taboo objects meeting scofflaw criteria as current solutions, and updating a taboo list;
s304, the iteration number is increased by 1, if the iteration number is the maximum iteration number or the occurrence frequency of the maximum value is high, the algorithm is terminated, an optimal scheme is output, and otherwise, the step S302 is executed.
Optionally, the method for constructing the longest active chain includes the following steps:
s3021, finding the last working procedure in all motor train units;
s3022, determining a direct front-edge process of the machine and a direct front-edge process of the workpiece, comparing the two processes, selecting a process with the ending time equal to the starting time as the direct front-edge process of the active chain, and continuously searching the direct front-edge process until the first operation is finished to obtain the longest active chain;
s3023, if the end times of the machine direct leading edge process and the workpiece direct leading edge process are the same, one of them can be arbitrarily selected or designated as the direct leading edge process.
Optionally, the method further comprises the steps of continuously applying a dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit, and continuously optimizing a dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, wherein the obtained maximum number of the whole spare motor train units is the passing capacity of the motor train units, and the method comprises the following steps:
s401, judging whether the latest motor train unit departure time in the optimization scheme is less than the termination time
If yes, go to step S402, if not, go to step S404;
s402, continuously selecting a motor train unit from the driven train unit type proportion set on the basis of the optimization scheme, and arranging a shunting operation plan of the motor train unit by using a motor train unit shunting operation plan compiling principle until the termination time of operation of a certain motor train unit is longer than that of operation of the motor train unit
S403, optimizing the shunting operation plan scheme of the motor train unit at the moment by using a tabu search algorithm, and turning to the step S401;
s404, recording the number of motor train sets in the current scheme, namely the passing capacity of the motor trains.
In another aspect, the invention provides a high-speed rail vehicle passing capacity calculation system which comprises a model building module, a first calculation module, a second calculation module and a third calculation module.
The model building module is used for building a passing capacity calculation model of the high-speed rail motor car;
the first calculation module is used for generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of a motor train unit;
the second calculation module is used for optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest time of getting out of the motor train unit as an optimization index to obtain the shunting operation scheme at the minimum time when the motor train unit is at the latest time of getting out of the motor train unit;
and the third calculation module is used for continuously applying the dispatching operation plan compilation principle of the motor train unit to increase and arrange the motor train unit and continuously optimizing the dispatching operation plan scheme of the motor train unit until the capacity of the motor train units is used up, and the obtained maximum number of the whole motor train units is the passing capacity of the motor train units.
The invention has the beneficial effects that:
the invention comprehensively considers the proportion of the motor train unit servicing types in the motor train unit station, the use and state constraint of the station equipment of the motor train unit station, the safety constraint and the standard constraint of the motor train unit servicing operation process arrangement and the influence of the shunting operation plan of the motor train unit on the passing capacity. The method can well solve the problems that the accuracy of the calculation result of the traditional utilization rate method of the passing capacity of the motor train units is not high, and the coordination with the passing capacity of the adjacent section and the adjacent station cannot be effectively measured. The modeling process is convenient and simple, the modeling standard is unified, the method is real and reliable, the method has comprehensive consideration factors, and the method has good operability, universality and reusability.
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 the practice of the embodiments 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 technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
Fig. 1 is a flowchart of a method for calculating the passing capacity of a high-speed rail vehicle according to an embodiment of the invention;
FIG. 2 is a schematic diagram of a shunting operation scheme of 3 motor train units (CRH1-CRH3) in the embodiment of the invention;
fig. 3 is a block diagram of a system for calculating the passing capacity of the high-speed rail vehicle according to the embodiment of the 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. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the 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.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present invention, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
The terms referred to in this application:
a motor train station: the maintenance and repair device is used for bearing all maintenance work except high-grade maintenance of the motor train unit and parking operation of the motor train unit, and is generally arranged near a starting station, a final station and a hub station of a high-speed railway line, so that the motor train unit is guaranteed to have a maintenance and repair place in a safe and normal operating state.
The passing capacity of the motor train is as follows: the method refers to the maximum number of motor train units which can be connected, disconnected and reconditioned in a given time period under certain equipment conditions and operation modes.
The shunting operation plan of the motor train unit: the station track stopping and line turning plan of the motor train unit in each station warehouse in the motor train unit is compiled by the operation planning personnel of the motor train unit according to the motor train unit overhauling and operation plan, covers the whole process of entering, overhauling, parking and leaving of the motor train unit, and is an equipment operation plan for ensuring that the servicing operation task of the motor train unit can be completed. The method comprises the operation arrangement of the motor train unit on the entrance and exit routes of the motor train unit, the application sequence of station tracks of each station, the occupied start and stop time, the route switching and the time and the like.
The motor train unit servicing type proportion is as follows: the motor train unit has different operation flows and operation standards for various servicing and overhauling operations (parking operation, primary overhauling operation, secondary overhauling operation and the like) of various types of motor trains, and occupies different capacity resources of the motor trains. The proportion of the servicing types of the motor train units refers to the proportion of the motor train units of various servicing types in the motor train units.
The dispatching operation planning principle of the motor train unit is as follows: the decision rules of the arrangement priority of the shunting operation of the motor train unit are constructed according to long-term practical experience and preference targets of the shunting operation of the motor train unit and comprise motor train unit group departure route arrangement rules, motor train unit station track arrangement rules, motor train unit transfer route arrangement rules, motor train unit station track and route arrangement conflict resolution rules and the like.
At the latest time when the motor train unit is released: refers to the departure time of the last train in a given technical operation scheme. The indexes can be used for conveniently comparing the advantages and disadvantages of a plurality of shunting operation schemes with the same maintenance and application tasks in a given time period, the smaller the index is, the better the shunting operation scheme corresponding to the index is, and more space-time resources can be saved for arranging the motor train unit operation, so that the passing capacity is improved.
Tabu search algorithm: the method is a sub-heuristic random search algorithm, and starts from an initial feasible solution, a series of specific search directions (movements) are selected as heuristics, and the movement which enables the specific target function value to change most is selected. In order to avoid trapping in a local optimal solution, a flexible memory technology is adopted in the search, the optimization process which is already carried out is recorded and selected, and the search direction of the next step is guided, namely the building of a Tabu table.
Scheduling problem of the processing workshop: given a set of workpieces and a set of machines, each machine can process at most one workpiece at a time. Each workpiece comprises a series of operations, each of which requires the machining on a specific machine for a given time without interruption. A schedule is determined that assigns each process to a corresponding machine for a time period while minimizing the processing duration required to complete all of the workpieces.
Leading edge process of the workpiece: assuming that the processes u and v are two processes of the workpiece J, in the work flow, u needs to be processed before v, and then u is the leading edge process of v same workpiece, and if the two processes are just adjacent, then u is the direct leading edge process of v same workpiece.
Leading edge procedure on machine: let u and v be two steps of machining on the machine M, and if u starts machining earlier than v, u is called the leading step of the same machine of v, and if these two steps are just adjacent, u is the direct leading step of the same machine of v.
A movable chain: a live chain of process u is a collection of processes that starts with a process that has no leading edge process (i.e., starts with the first process) and ends with process u, where each process on the live chain is either a workpiece-directed leading edge process or a machine-directed leading edge process for one of the remaining processes.
Length of the movable chain: the length from the start time of the first process to the end time of the last process in the active chain.
The longest active chain: the movable chain of one procedure finished at the latest in all the movable chains
A movable block: the longest live chain is the set of a set of directly adjacent processes of the same machine.
In one aspect, as shown in fig. 1, the present embodiment provides a method for calculating passing capacity of a high-speed rail vehicle, the method including step S10, step S20, step S30 and step S40.
S10, constructing a passing capacity calculation model of the high-speed rail motor car;
s20, generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of the motor train unit;
s30, optimally adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest time as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest time;
and S40, continuously applying the dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit, and continuously optimizing the dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, wherein the obtained maximum number of the whole spare motor train units is the passing capacity of the motor train units.
Optionally, the method may further include step S50.
And S50, determining the equipment capacity bottleneck of the motor train according to the motor train unit shunting operation plan scheme under the condition of maximum capacity passing capacity, determining the coordination and matching performance of each equipment capacity of the motor train unit, and improving the utilization rate of the passing capacity of the motor train unit by adjusting the equipment use scheme of the capacity bottleneck.
Optionally, the step S10 may further include step S101 and step S102.
S101, constructing a model objective function;
and S102, constructing constraint conditions.
Suppose all L of a motor carZA section line for the entrance and exit of a motor train, S work yards, each work yard having Gi(i ═ 1,2,3.. S) tracks, there are in common
Strand track, SLShunting route by using the strip turning line; the multiple types of motor train units have M motor train unit servicing processes (daily parking, first-level maintenance, second-level maintenance and the like), and each servicing process has Di(i ═ 1,2,3.. M) servicing job tasks. The starting time of the calculation time period of the passing capacity of the motor train is
And an end time of
In a time period
The number of the servicing motor train units for internal overhaul and application is Z, and the proportion of the motor train units of each servicing type is Ri(i ═ 1,2,3.. M), no maintenance skylight was provided.
And arranging the motor train units with various servicing operation flows as much as possible in a calculation period, and realizing the maximization of the servicing number of the motor train units, thereby determining the passing capacity of the motor train units.
The objective function is shown in equation (1):
in the formula (1), Z is the sum of the motor train units with different servicing operation flows in each direction, and niThe number of the motor train sets of the servicing work flow i handled by the motor trains is shown;
the constraints include the following formula:
the number of the motor train sets in each servicing operation process of the high-speed rail motor train receiving and sending needs to meet the determined proportion constraint, which is the service content of the motor train determined by the train operation diagram or the design annual traffic volume:
in the formula (2), niNumber of motor train units n representing servicing operation flow of ii′Number of motor train units R representing servicing operation flow i' handled by motor traini/i′The set constant represents the proportion of the motor train unit receiving and dispatching with the servicing operation flow i as a denominator, which is obtained by taking the number of the motor train units with a certain servicing operation flow i 'as a denominator and is specified by the motor train unit operation plan, namely, the parameter i' is fixed relative to the variable i;
each motor train unit has to meet the uniqueness constraint of space-time occupation of station yard tracks, that is, any one track is only allowed to be occupied by one motor train unit at any time, and can be expressed as:
in the formula (3), xijkrIs a variable from 0 to 1, and represents x if the kth shunting operation of the jth motor train unit with the overhaul process flow of i is arranged on a station track r of a field depotijkr1, otherwise xijkr＝0，i＝1,2,...M,j＝1,2,...ni,k＝1,2,...Di；
The number of the tracks arranged on each train of the motor train unit is more than or equal to the number of the operations specified by the process, and the number can be expressed as follows:
the actual stay time of each operation of each train of motor train unit on the track of the motor train unit can meet the specified minimum operation preparation time, and can be represented as follows:
in the formula (5), the first and second groups,
the starting time of the kth shunting operation of the jth motor train unit with the preparation flow i is represented, and the starting time of the occupied station track for handling a certain operation of the motor train unit is also represented;
the method comprises the steps that the end time of the kth shunting operation of the jth motor train unit with the servicing process flow i is represented, and the end time of the occupation of a station track due to handling of a certain operation of the motor train unit is also represented;
representing the servicing time standard of the kth shunting operation of the jth motor train unit with the servicing flow being i;
any two motor train units which arrive and send on the same station track in sequence are not allowed to overlap in the time of occupying the station track, namely when a certain station track is occupied by a motor train unit, the station track is not allowed to send and receive other motor train units, and the method can be represented as follows:
in the formula (6), the first and second groups,
and
respectively showing the starting time and the ending time of the kth' shunting operation of the jth motor train unit with the servicing process flow of iBeam time, i '═ 1,2,. M, j' ═ 1,2,. ni′,k′＝1,2,...Di；
The motor train unit only considering the operation time in the calculation period can be represented as follows:
the start time and the end time of each shunting operation of each motor train unit must meet the constraint of the former operation time and the latter operation time:
the starting time of the first operation is equal to the arrival time of the motor train unit; except the first operation, the starting time of each operation time is larger than the ending time of the previous operation; the final operation ending time is equal to the time of the motor train unit and can be represented by a first fraction, a second fraction and a third fraction respectively:
only the motor train unit with the time of the trip in and out in the calculation period is considered, and the method can be represented as follows:
in the formula (8) and the formula (9),
and
respectively representing the entering time and the exiting time of the jth motor train unit with the servicing process flow i;
the track arrangement of each shunting operation of each motor train unit must be carried out with the station yard constraint, that is, each servicing operation must be finished on a specific station yard track, which can be expressed as:
in the formula (10), CijkrThe method comprises the steps that the benefit of operation on a station track r arranged in a yard is shown in the kth operation of the jth motor train unit with the servicing process i; when the motor train unit is arranged on the track r which cannot be used or is not allowed to be used according to the organization regulation of the motor train unitijkrNot equal to 0, otherwise Cijkr＝1；
The motor train unit has to meet the uniqueness constraint of route space-time occupation, that is, any 1 route is only allowed to be occupied by 1 motor train unit at any time, and can be represented as follows:
in formula (11), yijklAnd y'ijklAll are variable 0-1, if the approach route is arranged on l when the jth motor train unit with the servicing process flow of i is switched from the previous task to the kth task, y isijkl1, otherwise yijkl0; y 'if the route is arranged on l when the jth motor train unit with the preparation flow of i is shifted out from the kth task to the next task'ijkl1, otherwise'ijkl＝0；
Only 1 route is allowed to be arranged for the turning-in and turning-out of the station track of each task of each motor train unit, and can be represented as follows:
In the formula (12), IInter-arrival spaceRepresenting the minimum arrival interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i'; i isInterval of arrivalRepresenting the minimum arrival interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i'; i isStarting intervalThe minimum departure interval time between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process i' is represented; i isTo the intervalThe most important part between the jth motor train unit with the servicing process i and the jth motor train unit with the previous servicing process iSmall arrival interval; p is a radical ofll′A variable of 0-1, if there is a conflict between routes l and l', then pll′1, otherwise pll′＝0；
The occupied time of a rotating line access of the motor train unit is equal to the difference between the occupied start-stop time of front and rear task station tracks; when different motor train units have a conflict in the route of the rotating line, the minimum time interval standard of shunting is required to be met and can be respectively represented by a first fraction and a second fraction:
optionally, step S20 may further include step S201 and step S202.
S201, determining a dispatching operation plan compiling principle of the motor train unit according to the dispatching operation characteristics and the target of the motor train unit;
and S202, generating a feasible motor train unit shunting operation plan initial scheme meeting constraint conditions according to a motor train unit shunting operation plan compiling principle to obtain a maximum passing capacity initial value of the motor train unit.
Optionally, the planning principle of the shunting operation plan of the motor train unit includes:
determining rules of the sequence of the motor train unit entering and exiting the motor train unit;
determining rules of time when the motor train unit enters or exits the motor train unit;
arranging rules of the arrival and departure routes of the motor train unit;
arranging rules of the tracks of the motor train unit;
arranging rules of the motor train unit transfer route;
the time of the track occupation of the motor train unit is regular;
and (5) solving the conflict of the operation of the motor train unit.
The rule for determining the sequence of the motor train unit entering and exiting the motor train unit comprises the following steps:
generating a group of minimum motor train unit sets which accord with the formation proportion of the motor train unit servicing operation process types;
sequentially and randomly selecting the motor train units from the set, arranging the operation plan until the set is empty, and regenerating a group of motor train unit set;
the rule for determining the time when the motor train unit enters or leaves the motor train unit comprises the following steps:
taking the starting time of the passing capacity calculation period of the motor train as a starting time point, taking the arrival time of the motor train unit entering the motor train as the starting time of the passing capacity calculation period of the motor train, and sequentially increasing the motor train units entering the motor train according to the minimum arrival tracking interval to obtain a formula (14):
in the formula (14), the reaction mixture,
showing the time when the previous motor train unit enters the motor train unit, IInter-arrival spaceRepresents a minimum arrival tracking interval;
determining the departure time of the motor train unit according to the total residence time of the motor train unit in the motor train unit;
the determining of the motor train unit arrival route arrangement rule comprises the following steps:
arranging the motor train unit to a launching route according to the rule of the maximum parallel route;
the method for determining the track arrangement rule of the motor train unit comprises the following steps:
arranging the station track where each overhaul operation of the motor train unit is located according to a first-come-first arrangement, a station track compact use priority rule of key equipment and a station track balance use rule; because some equipment resources of the motor train unit have scarcity, such as maintenance storehouses, garage washing, wheel turning and wheel repair and the like, the invalid time of the motor train unit occupying the key equipment is reduced, and the practicability of the technical operation plan of the motor train unit is improved.
The method for determining the arrangement rule of the shunting route of the motor train unit comprises the following steps:
arranging routes according to the rules that the departure depot shunting routes are preferentially entered into the depot shunting routes and the maximum parallel routes are preferentially entered;
the rule for determining the time occupied by the station track of the motor train unit comprises the following steps:
and (3) arranging the track occupation time according to the minimum operation time standard rule, wherein the specific time is shown as a formula (15):
the motor train unit operation conflict resolution rule comprises the following steps:
when the motor train unit carries out station track arrangement according to the operation process and operation conflict occurs, the operation start-stop time needs to be adjusted to resolve the conflict. The operation is performed differently in two cases:
when the motor train unit is in and out of a conflict of receiving and sending routes or a conflict of parking lines, all trains in conflict with the routes of the motor train unit are required to be compared, minimum time adjustment amounts required to be met by conflict resolution of the trains are calculated respectively, and the time of getting in and out of the motor train unit is adjusted according to the minimum value;
when other operations except for the entrance and exit have a diversion route or station conflict, the starting time of the operation needs to be delayed, and the ending time of the previous operation needs to be prolonged, namely, the waiting time is generated in the previous operation, and the waiting time is equal to the minimum time adjustment amount which can be utilized after all available stations are vacated; as shown in the following CRH3 shunting operation scheme of the motor train unit in FIG. 2, when the motor train unit is shifted from the near maintenance line to the overhaul line, the operation conflict is resolved by setting the waiting time.
The step S202 may further include a step S2021, a step S2022, a step S2023, a step S2024, a step S2025, a step S2026, a step S2027, a step S2028, and a step S2029.
Step S2021, assigning an initial value to the total number n of the motor train unit as 0, and assigning the total number z of the working procedures of the motor train unit as 0;
s2022, generating a group of minimum sets of motor train unit proportions according with different servicing operation flow types;
s2023, judging whether plans are arranged for all the motor train units in the set, if yes, turning to the step S2022; otherwise, randomly selecting a motor train unit without a schedule from the current set;
s2024, selecting an operation to be arranged according to the servicing operation flow to which the motor train unit belongs;
s2025, determining the time of the motor train unit to enter and exit according to a motor train unit entering and exiting time determination rule;
step S2026, arranging station yard operation, arrival route and diversion route required by operation for the motor train unit according to the motor train unit arrival route arrangement rule, the motor train unit station yard occupation time rule and the motor train unit diversion shunting route arrangement rule; if the idle station track or route cannot be found in the operation, the operation arrangement of the motor train unit conflicts with other motor train units, the step S2027 is executed, and otherwise, the step S2028 is executed;
step S2027, adjusting the operation start-stop time and the access path occupation start-stop time of the motor train unit according to the motor train unit operation conflict resolution rule, and turning to step S2026;
step S2028, if the ending time of the operation of the motor train unit is more than that of the operation of the motor train unit
The termination time of the job is set to
And step S2029; otherwise, judging whether all the operation items of the motor train unit are scheduled, if so, recording the motor train unit, wherein n is n +1, turning to the step S2023, recording the operation plan of the motor train unit, and z is z +1, and turning to the step S2024;
and S2029, outputting the current values of n and z to be the maximum passing capacity initial values of the motor train.
Optionally, in step S30, the method may further include:
and carrying out optimization adjustment according to a hybrid neighborhood tabu search algorithm based on the longest active chain.
Optionally, the step S30 may further include step S301, step S302, step S303, and step S304.
S301, setting the iteration times to be 1, and setting the initial scheme of the first stage as the current scheme;
step S302, random searchOne motor train unit shunting operation longest movable chain, moving or exchanging motor train unit operation of movable blocks on the movable chain according to rules, arranging operation time of relevant working procedures of the moved longest movable chain to generate a neighborhood solution, and repeating the step S302 to obtain
Evaluating the candidate set solutions by using the maximum evaluation index;
step S303, judging whether the objects in the candidate solution meet the scofflaw criteria, selecting objects which are not taboo in the neighborhood solution and taboo objects meeting the scofflaw criteria as current solutions, and updating a taboo list;
and S304, increasing the iteration number by 1, if the iteration number is the maximum iteration number or the occurrence frequency of the maximum value is higher, terminating the algorithm, and outputting an optimal scheme, otherwise, turning to the step S302.
Optionally, the method for constructing the longest active chain may include step S3021, step S3022, and step S3023.
S3021, finding the last working procedure in all motor train units;
s3022, determining a direct front-edge process of the machine and a direct front-edge process of the workpiece, comparing the two processes, selecting a process with the ending time equal to the starting time as the direct front-edge process of the active chain, and continuously searching the direct front-edge process until the first operation is finished to obtain the longest active chain;
s3023, if the end times of the machine direct leading edge process and the workpiece direct leading edge process are the same, one of them can be arbitrarily selected or designated as the direct leading edge process.
Wherein, the operation removes the principle among the movable block and does:
① there are only 1 job in the active block, no change occurs;
② if there are only 2 jobs in the active block, then 2 adjacent jobs are directly exchanged, and if there is non-production waiting time with the leading edge job of the workpiece after the exchange of the 1 st job in the active block, the job start time can be continuously moved to the immediately adjacent leading edge job end time in advance;
③, by moving the following job to the preceding job position, if there is a non-production waiting time with the leading-edge job of the workpiece, the job start time can be continuously advanced to the immediately preceding-edge job end time by exchanging the 1 st job in the following active block.
As shown in fig. 2, job 2 is a work leading edge step of job 3 and a work leading edge step of job 5; job 3 is the direct front-end process of job 4 on the car wash; jobs 1,2,3, 5, 6, 7, 8, 9 constitute the longest active chain, the time of which is the sum of the 7 jobs; jobs 3, 4 and jobs 6, 7 are the active blocks in the longest active chain.
Optionally, the step S40 may further include step S401, step S402, step S403, and step S404.
Step S401, judging whether the latest motor train unit departure time in the optimization scheme is less than the termination time
If yes, go to step S402, if not, go to step S404;
s402, continuously selecting the motor train unit from the driven train unit type proportion set on the basis of the optimization scheme, and arranging the shunting operation plan of the motor train unit by using the shunting operation plan compiling principle of the motor train unit until the termination time of operation of a certain motor train unit is longer than that of operation of the motor train unit
S403, optimizing the shunting operation plan scheme of the motor train unit at the moment by using a tabu search algorithm, and turning to S401;
and S404, recording the number of the motor train sets in the current scheme, namely the passing capacity of the motor trains.
On the other hand, as shown in fig. 3, the present embodiment provides a high-speed rail vehicle passing capacity calculation system, which includes a model building module 61, a first calculation module 62, a second calculation module 63, and a third calculation module 64.
The model establishing module 61 is used for establishing a passing capacity calculation model of the high-speed rail motor car;
the first calculation module 62 is configured to generate a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to the constraint conditions and the decision variables, so as to obtain a maximum passing capacity initial value of the motor train unit;
the second calculation module 63 is used for optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest as an optimization index to obtain the shunting operation scheme at the minimum time when the motor train unit is at the latest;
and the third calculation module 64 is used for continuously applying the dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit and continuously optimizing the dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, and the obtained maximum number of the whole motor train units is the passing capacity of the motor train units.
The implementation principle and the generated technical effects of the system for calculating the passing capacity of the high-speed rail vehicle provided by the embodiment of the invention are the same as those of the embodiment of the method for calculating the passing capacity of the high-speed rail vehicle.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes. It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for calculating passing capacity of a high-speed rail vehicle is characterized by comprising the following steps:
constructing a passing capacity calculation model of the high-speed rail motor car;
generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of a motor train unit;
optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest out-of-service location as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is at the latest out-of-service location;
and continuously applying the dispatching operation planning principle of the motor train unit to increase and arrange the motor train unit, and continuously optimizing the dispatching operation planning scheme of the motor train unit until the capacity of the motor train units is used up, wherein the obtained maximum number of the whole motor train units is the passing capacity of the motor train units.
2. The method for calculating the passing capacity of the high-speed rail vehicle according to claim 1, wherein the model for calculating the passing capacity of the high-speed rail vehicle comprises:
constructing a model objective function;
and constructing a constraint condition.
3. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 1, wherein the step of generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of the motor train unit comprises the following steps of:
determining a dispatching operation plan compiling principle of the motor train unit according to the dispatching operation characteristics and the target of the motor train unit;
and generating a feasible motor train unit shunting operation plan initial scheme meeting the constraint condition according to the motor train unit shunting operation plan compiling principle to obtain the maximum passing capacity initial value of the motor train unit.
4. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 3, wherein the motor train unit shunting operation planning principle comprises the following steps:
determining rules of the sequence of the motor train unit entering and exiting the motor train unit;
determining rules of time when the motor train unit enters or exits the motor train unit;
arranging rules of the arrival and departure routes of the motor train unit;
arranging rules of the tracks of the motor train unit;
arranging rules of the motor train unit transfer route;
the time of the track occupation of the motor train unit is regular;
and (5) solving the conflict of the operation of the motor train unit.
5. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 4, wherein a feasible motor train unit shunting operation plan initial scheme meeting constraint conditions is generated according to a motor train unit shunting operation plan compiling principle to obtain a maximum passing capacity initial value of the motor train unit, and the method comprises the following steps of:
s2021, assigning an initial value to the total number n of the motor train unit as 0, and assigning the total number z of the working procedures of the motor train unit as 0;
s2022, generating a group of minimum sets of motor train unit proportions according with different servicing operation flow types;
s2023, judging whether plans are arranged for all motor train units in the set, if yes, turning to the step S2022; otherwise, randomly selecting a motor train unit without a schedule from the current set;
s2024, selecting an operation to be arranged according to the servicing operation process of the motor train unit;
s2025, determining the time of the motor train unit to enter and exit according to the motor train unit time determining rule;
s2026, arranging station yard operation tracks, arrival routes and diversion routes required by operation for the motor train unit according to a motor train unit arrival route arrangement rule, a motor train unit track occupation time rule and a motor train unit diversion shunting route arrangement rule; if the idle station track or route cannot be found in the operation, the operation arrangement of the motor train unit conflicts with other motor train units, the step S2027 is executed, and otherwise, the step S2028 is executed;
s2027, adjusting the operation start-stop time and the access path occupation start-stop time of the motor train unit according to the motor train unit operation conflict resolution rule, and turning to the step S2026;
s2028, if the ending time of the operation of the motor train unit is more than that
The termination time of the job is set to
And step S2029; otherwise, judging whether all the operation items of the motor train unit are scheduled, if so, recording the motor train unit, wherein n is n +1, turning to the step S2023, recording the operation plan of the motor train unit, and z is z +1, and turning to the step S2024;
and S2029, outputting the current values of n and z to obtain the maximum passing capacity initial value of the motor car.
6. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 1, wherein the step of optimally adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is delivered as an optimal index to obtain the shunting operation scheme with the minimum time when the motor train unit is delivered comprises the following steps:
and carrying out optimization adjustment according to a hybrid neighborhood tabu search algorithm based on the longest active chain.
7. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 1, wherein the method for optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is delivered out of the motor train unit at the latest as an optimization index to obtain the shunting operation scheme with the minimum time when the motor train unit is delivered out of the motor train unit at the latest comprises the following steps:
s301, setting the iteration number as 1, and setting the initial scheme of the first stage as the current scheme;
s302, randomly searching a longest active chain of shunting operation of the motor train unit, moving or exchanging the motor train unit operation of the active blocks on the active chain according to rules, arranging the operation time of the relevant working procedures of the moved longest active chain to generate a neighborhood solution, and repeating the step S302 to obtain the solution
Evaluating the candidate set solutions by using the maximum evaluation index;
s303, judging whether the objects in the candidate solution meet scofflaw criteria, selecting objects which are not taboo in the neighborhood solution and taboo objects meeting scofflaw criteria as current solutions, and updating a taboo list;
s304, the iteration number is increased by 1, if the iteration number is the maximum iteration number or the occurrence frequency of the maximum value is high, the algorithm is terminated, an optimal scheme is output, and otherwise, the step S302 is executed.
8. The method for calculating the passing capacity of the high-speed rail vehicle according to claim 7, wherein the method for constructing the longest active chain comprises the following steps:
s3021, finding the last working procedure in all motor train units;
s3022, determining a direct front-edge process of the machine and a direct front-edge process of the workpiece, comparing the two processes, selecting a process with the ending time equal to the starting time as the direct front-edge process of the active chain, and continuously searching the direct front-edge process until the first operation is finished to obtain the longest active chain;
s3023, if the end times of the machine direct leading edge process and the workpiece direct leading edge process are the same, one of them can be arbitrarily selected or designated as the direct leading edge process.
9. The method for calculating the passing capacity of the high-speed rail motor train unit according to claim 1, wherein the motor train unit is additionally arranged by continuously applying a motor train unit shunting operation planning principle, and the shunting operation planning scheme of the motor train unit is continuously optimized until the capacity of the motor train unit is used up, and the obtained maximum number of the whole spare motor train units is the passing capacity of the motor train unit, and the method comprises the following steps:
s401, judging whether the latest motor train unit departure time in the optimization scheme is less than the termination time
If yes, go to step S402, if not, go to step S404;
s402, continuously selecting a motor train unit from the driven train unit type proportion set on the basis of the optimization scheme, and arranging a shunting operation plan of the motor train unit by using a motor train unit shunting operation plan compiling principle until the termination time of operation of a certain motor train unit is longer than that of operation of the motor train unit
S403, optimizing the shunting operation plan scheme of the motor train unit at the moment by using a tabu search algorithm, and turning to the step S401;
s404, recording the number of motor train sets in the current scheme, namely the passing capacity of the motor trains.
10. A high-speed rail transit capability calculation system, the system comprising:
the model building module is used for building a passing capacity calculation model of the high-speed rail motor car;
the first calculation module is used for generating a feasible motor train unit shunting operation plan initial scheme by applying a motor train unit shunting operation plan compiling principle according to constraint conditions and decision variables to obtain a maximum passing capacity initial value of a motor train unit;
the second calculation module is used for optimizing and adjusting the shunting operation plan scheme of the motor train unit by taking the minimum time when the motor train unit is at the latest time of getting out of the motor train unit as an optimization index to obtain the shunting operation scheme at the minimum time when the motor train unit is at the latest time of getting out of the motor train unit;
and the third calculation module is used for continuously applying the dispatching operation plan compilation principle of the motor train unit to increase and arrange the motor train unit and continuously optimizing the dispatching operation plan scheme of the motor train unit until the capacity of the motor train units is used up, and the obtained maximum number of the whole motor train units is the passing capacity of the motor train units.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010157986.9A CN111260260A (en) | 2020-03-09 | 2020-03-09 | Method and system for calculating passing capacity of high-speed rail motor car |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010157986.9A CN111260260A (en) | 2020-03-09 | 2020-03-09 | Method and system for calculating passing capacity of high-speed rail motor car |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111260260A true CN111260260A (en) | 2020-06-09 |
Family
ID=70951413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010157986.9A Pending CN111260260A (en) | 2020-03-09 | 2020-03-09 | Method and system for calculating passing capacity of high-speed rail motor car |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111260260A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113222226A (en) * | 2021-04-26 | 2021-08-06 | 武汉科技大学 | Method and device for shunting motor train, electronic equipment and storage medium |
| CN116777107A (en) * | 2023-06-12 | 2023-09-19 | 北京城建设计发展集团股份有限公司 | Urban area fast track line passing capability calculation method for fast and slow vehicle mixed operation |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108491950A (en) * | 2018-01-25 | 2018-09-04 | 北京交通大学 | A kind of high-speed railway handling capacity computational methods considering multiple resources constraint |
| CN110135755A (en) * | 2019-05-23 | 2019-08-16 | 南京林业大学 | A kind of method of complex optimum section urban public transit timetable establishment and vehicle scheduling |
-
2020
- 2020-03-09 CN CN202010157986.9A patent/CN111260260A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108491950A (en) * | 2018-01-25 | 2018-09-04 | 北京交通大学 | A kind of high-speed railway handling capacity computational methods considering multiple resources constraint |
| CN110135755A (en) * | 2019-05-23 | 2019-08-16 | 南京林业大学 | A kind of method of complex optimum section urban public transit timetable establishment and vehicle scheduling |
Non-Patent Citations (1)
| Title |
|---|
| 陈韬等: "动车所通过能力计算模型与方法研究", 《铁道学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113222226A (en) * | 2021-04-26 | 2021-08-06 | 武汉科技大学 | Method and device for shunting motor train, electronic equipment and storage medium |
| CN116777107A (en) * | 2023-06-12 | 2023-09-19 | 北京城建设计发展集团股份有限公司 | Urban area fast track line passing capability calculation method for fast and slow vehicle mixed operation |
| CN116777107B (en) * | 2023-06-12 | 2023-12-05 | 北京城建设计发展集团股份有限公司 | Urban area fast track line passing capability calculation method for fast and slow vehicle mixed operation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dong et al. | Integrated optimization of train stop planning and timetabling for commuter railways with an extended adaptive large neighborhood search metaheuristic approach | |
| US8082071B2 (en) | System and method of multi-generation positive train control system | |
| CN110775109B (en) | High-speed railway train arrival time prediction method based on dispatching command system | |
| CN111260260A (en) | Method and system for calculating passing capacity of high-speed rail motor car | |
| Riazi et al. | Energy optimization of large-scale AGV systems | |
| JP7492301B2 (en) | Method and system for adjusting subway train operation when trains leave main line operation | |
| CN102129522B (en) | Method for quickly identifying and eliminating transportation capacity bottleneck of high-speed railway | |
| CN112883640A (en) | Digital twin station system, job scheduling method based on system and application | |
| CN111476490A (en) | Regional multi-line vehicle scheduling algorithm shared by resource pool | |
| CN113212503B (en) | Detection method for rail transit vehicle shunting plan conflict | |
| CN111178697A (en) | Method and system for calculating passing capacity of high-speed railway | |
| Toletti et al. | What about train length and energy efficiency of freight trains in rescheduling models? | |
| Hani et al. | Simulation based optimization of a train maintenance facility | |
| Wang et al. | Optimizing the shunting schedule of electric multiple units depot using an enhanced particle swarm optimization algorithm | |
| Zhu et al. | Collaborative optimization of rescue operation and timetable rescheduling under metro train failure | |
| Shi et al. | Optimization of the shunting operation plan at electric multiple units depots | |
| Tomii et al. | Depot shunting scheduling using combined genetic algorithm and PERT | |
| He et al. | A microscopic agent-based simulation for real-time dispatching problem of a busy railway passenger station | |
| Schulz et al. | Levelling crane workload in multi-yard rail-road container terminals | |
| Chiang et al. | Railway scheduling system using repair-based approach | |
| Khadilkar et al. | Rule-based discrete event simulation for optimising railway hump yard operations | |
| CN112396251A (en) | Motor train station dispatching method based on uncertain processing framework and rule combination algorithm | |
| Fang et al. | Re-scheduling in railway networks | |
| Setyawan et al. | Multi-criteria Mathematical Model for Partial Double Track Railway Scheduling in Urban Rail Network | |
| Hua et al. | An Adaptive Large Neighborhood Search Heuristic for Dynamic Ridesharing Problem |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200609 |
|
| RJ01 | Rejection of invention patent application after publication |