CN114565296A - Intelligent running scheduling method and system for rail transit construction line - Google Patents

Intelligent running scheduling method and system for rail transit construction line Download PDF

Info

Publication number
CN114565296A
CN114565296A CN202210206564.5A CN202210206564A CN114565296A CN 114565296 A CN114565296 A CN 114565296A CN 202210206564 A CN202210206564 A CN 202210206564A CN 114565296 A CN114565296 A CN 114565296A
Authority
CN
China
Prior art keywords
construction
task
driving
queue
time
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
Application number
CN202210206564.5A
Other languages
Chinese (zh)
Inventor
崔东亮
代学武
郑秀萍
柴天佑
岳鹏
程丽娟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northeastern University China
Original Assignee
Northeastern University China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northeastern University China filed Critical Northeastern University China
Priority to CN202210206564.5A priority Critical patent/CN114565296A/en
Publication of CN114565296A publication Critical patent/CN114565296A/en
Pending legal-status Critical Current

Links

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/06316—Sequencing of tasks or work
    • 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/06313—Resource planning in a project environment
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Operations Research (AREA)
  • Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention provides an intelligent vehicle scheduling method and system for a rail transit construction line, which comprises the steps of firstly, collecting the travel arrangement data of all construction vehicle tasks on the rail transit construction line, and constructing a construction vehicle task set to be scheduled; then, carrying out priority sequencing on the construction driving tasks according to the construction type and the construction starting point; finally, an optimization objective function iterative optimization of construction vehicle scheduling is constructed to generate a vehicle scheduling scheme of the rail transit construction line; the invention introduces the construction task priority division method, which not only can effectively reduce the search scale of the problem and improve the decision response speed of the method and the system, but also can lead the generated scheduling scheme to better meet the requirements of practical construction traveling vehicles.

Description

Intelligent running scheduling method and system for rail transit construction line
Technical Field
The invention belongs to the technical field of vehicle dispatching, and particularly relates to an intelligent vehicle dispatching method and system for a rail transit construction line.
Background
With the continuous development of high-speed railways, tasks such as new line construction, existing line reconstruction and the like are heavier, equipment, vehicles and personnel arrangement is more compact, particularly for construction tasks (construction driving tasks for short) which can be completed only by running special vehicle equipment for track construction on a construction line, a reasonable and efficient construction driving task plan is formulated under the constraint conditions of ensuring equipment, life safety production and the like, and the method is an important means for improving the utilization rate of equipment and shortening the construction period and the economic efficiency. The high-speed rail construction line running scheduling is a core work of intelligent construction in rail transit construction. Compared with the safety guarantee provided by the existing railway operation monitoring system for large-scale road maintenance machinery, most functions of the monitoring system cannot be realized due to the fact that initial infrastructure of the newly-built construction line is imperfect, and potential safety hazards of driving are large. Meanwhile, because a large number of construction tasks can be completed by means of the travelling crane (the travelling crane used for the construction tasks is simply called as a construction travelling crane), limited track resources are frequently occupied, the construction site only depends on manual construction line scheduling, the tasks are heavy, and the working efficiency is low. Therefore, the comprehensive and three-dimensional intelligent vehicle dispatching needs to be carried out on a construction site, safe transportation management is carried out, and the vehicle dispatching efficiency is improved while the vehicle safety of a construction line is ensured.
And establishing a complete vehicle dispatching aid decision-making system, designing a vehicle dispatching method suitable for a construction site, and providing powerful support for the management level of the rail transit construction line. For example, aiming at complex working conditions such as long engineering line management section, multi-unit cross operation and the like, a scheduling command system and a video monitoring system are built for carrying out unified operation scheduling even for a low-speed rail, and the safety management of field construction is enhanced.
At present, in terms of rail transit vehicle scheduling, there are some patents such as "CN 202011135474.9 (an intelligent vehicle scheduling safety card control system for high-speed railway based on cloud-edge coordination)", "CN 201821744971.7 (an auxiliary system for rail transit vehicle scheduling)", "CN 202010097153.8 (an intelligent vehicle scheduling system and method for high-speed railway)", and "CN 201010271149.5 (an intelligent processing method for vehicle scheduling work)". The above patent relates to a driving scheduling scheme of a railway operation line during the service period, the line condition, the running vehicle, the technical equipment, the service object and the like are greatly different from the construction line, and the designed driving scheduling scheme aiming at the operation line is difficult to be directly applied to the construction line. And at present, no relevant patent about the traveling dispatching of the high-speed rail construction line exists. The existing construction line management information system can only realize the detection and alarm of the driving conflict and can not resolve the driving conflict so as to automatically generate a driving scheduling scheme.
Disclosure of Invention
Based on the above problems, the invention aims to provide an intelligent driving scheduling method and system for a rail transit construction line, which aims to consider the grades of each construction driving task and heuristic intelligent driving under special or emergency conditions, and solve by designing the heuristic intelligent driving scheduling method, so that driving conflicts can be detected and eliminated, and the construction driving scheduling task can be efficiently completed.
The invention provides an intelligent driving scheduling method for a rail transit construction line, which comprises the following steps:
step 1: acquiring the travel arrangement data of all construction vehicle tasks on a rail transit construction line, and constructing a construction vehicle task set omega to be scheduled;
step 2: carrying out priority sequencing on construction driving tasks according to the construction type and the construction starting point;
and 3, step 3: and constructing an optimized objective function iterative optimization of the construction traffic scheduling to generate a traffic scheduling scheme of the rail transit construction line.
The step 1 comprises the following steps:
step 1.1: constructing a construction task vector task according to the travel arrangement data of the ith construction vehiclei：
Figure BDA0003529432740000021
Wherein, taskIDiIs shown asNumbering construction tasks; taskTypeiIs a construction task type; taskDes are the work content; s1i、s2iRespectively representing a construction starting point and a construction finishing point;
Figure BDA0003529432740000022
respectively representing a desired start time and a desired end time; s3i、s4iRespectively showing the departure position and the receiving position; t isgiRepresenting vehicle group information;
step 1.2: constructing a construction driving task set omega to be scheduled, wherein the set is expressed as:
Figure BDA0003529432740000023
wherein, TD1And TD2Respectively representing the start time and the end time of the construction schedule,
Figure BDA0003529432740000024
and
Figure BDA0003529432740000025
then the task of construction and driving is showniA desired start time and a desired end time.
The step 2 comprises the following steps:
step 2.1: performing primary priority division on the construction driving tasks according to the construction types of the construction driving tasks, and dividing the construction driving tasks into task sets under different levels;
step 2.2: constructing a priority ordering rule, wherein the farther a construction starting point of a construction driving task is, the higher the corresponding priority of the construction driving task is;
step 2.3: carrying out priority sequencing on the construction driving tasks in each task set according to the sequencing rule generated in the step 2.2, and generating corresponding construction driving task queues according to the sequence of the priority from high to low;
step 2.4: generating a task queue Q with all construction driving task priorities sequenced according to the construction driving task queue1。
The step 3 comprises the following steps:
step 3.1: queue initialization, namely, establishing and initializing a scheduled construction driving task queue
Figure BDA0003529432740000031
To-be-scheduled construction driving task queue
Figure BDA0003529432740000032
Construction driving task queue with conflict
Figure BDA0003529432740000033
Wherein Q2For storing scheduled construction traffic tasks, Q3For storing construction traffic tasks, Q, requiring scheduling4The system is used for storing construction driving tasks with constraint conflict with the construction tasks to be scheduled;
step 3.2: updating queue Q to be scheduled3At Q1Sequentially extracting construction driving tasks with the highest priority from the queue until Q3The number of tasks in the queue is N3N is3Represents Q3The capacity of the queue;
step 3.3: constructing an optimized objective function of construction traffic scheduling and determining Q3The driving time of the driving tasks in the queue is constructed;
step 3.4: determination of Q1And (4) if the train which is not scheduled still exists in the queue, turning to the step 3.2 if the train which is not scheduled still exists in the queue, otherwise, finishing the arrangement of the construction driving task.
Said step 3.3 comprises:
step 3.3.1: determination of Q3Task for construction vehicle in queueiThe decision variables include the starting time t of the construction task1，jEnd time t2，jDeparture time t3，jAnd time t of receiving4，j；
Step 3.3.2: establishing an optimization objective function J of construction traffic scheduling according to decision variables:
Figure BDA0003529432740000034
in the formula (I), the compound is shown in the specification,
Figure BDA0003529432740000035
represents Q3Task for construction vehicle in queuej′The desired start time of the time of day,
Figure BDA0003529432740000036
represents Q3Task for construction vehicle in queuei′The desired end time of;
step 3.3.3: construction of traveling time feasibility constraint C in construction traveling taskin；
Step 3.3.4: judging and constructing feasibility constraint C of driving time between construction driving tasksout；
Step 3.3.5: according to constraint CinAnd CoutSolving an objective function J, and when the problem has a feasible solution, using a queue Q3And Q4The construction task in (1) is added into the queue Q2Defining the obtained decision variable as the running time of the construction running to be scheduled, and when the problem can not obtain a feasible solution, defining the queue Q4The construction task in (1) is transferred to a queue Q to be scheduled3In (1).
Feasibility constraint C in said step 3.3.3inThe method comprises the following steps:
construction driving task departure time and start time constraint C1：
t1，j＞t3，j j＝1，2，3，...，N3
Construction driving task start time and end time constraint C2：
t2，j＞t1，j j＝1，2，3，...，N3
Construction driving task vehicle-receiving time and end time constraint C3：
t4，j＞t2，j j＝1，2，3，...，N3
Operating time constraint C4：
Figure BDA0003529432740000041
Said step 3.3.4 comprises:
traverse Q3Judging the queue Q of the construction driving tasks to be arranged3In each construction vehicle taskjDriving interval [ s ]3j，s1j]And queue Q2In-built construction vehicle taskkDriving interval [ s ]3k，s1k]If there is a common part, if there is, a feasibility constraint C is establishedoutAnd Q is2The corresponding construction driving task in the middle is moved to a queue Q4Performing the following steps; otherwise, feasibility constraint C is not establishedout；
The feasibility constraint CoutThe method comprises the following steps:
tracking Interval time constraint C5：
Figure BDA0003529432740000042
Overrun constraint C6：
(t3j-t3k)×(t1j-t1k)＞0，j≠k，j＝1，2，3，...，N3，k＝1，2，3，...，N2
Where Tz represents a minimum operation interval time to be satisfied between construction vehicles, t3jRepresents Q3Task for construction vehicle in queuejDeparture time of, t4jRepresents Q3Task for construction vehicle in queuejTime of departure, t3kRepresents Q2Task for construction vehicle in queuekDeparture time of, t4kRepresents Q2Task for construction vehicle in queuekTime of collection of (N)2Presentation queue Q2Capacity of (A), N3Presentation queueQ3, in the container.
An intelligent vehicle scheduling system for a rail transit construction line is realized according to the intelligent vehicle scheduling method for the rail transit construction line, and comprises the following components: the system comprises a data preprocessing module, a heuristic driving sequencing sub-module, a heuristic driving time optimizing sub-module and a visual output module;
the data preprocessing module is used for generating a construction vehicle task set to be scheduled according to the travel arrangement data of all construction vehicle tasks on the rail transit construction line;
the heuristic driving ordering submodule is used for carrying out priority ordering on the construction driving tasks according to the construction types and the construction starting points of the construction driving tasks;
the heuristic driving time optimization submodule is used for constructing an optimization objective function of construction driving scheduling and generating a driving scheduling scheme of the rail transit construction line;
the visual output module is used for visually outputting a running scheduling scheme of the rail transit construction line, and the scheduling scheme can be adjusted through human-computer interaction to meet the actual requirements of construction running.
The invention has the beneficial effects that:
the invention provides an intelligent vehicle scheduling method and system for a rail transit construction line, and the method introduces a construction task priority division method before a train construction plan is specifically determined, so that the problem search scale can be effectively reduced, the decision response speed of the method and system is improved, and meanwhile, the generated scheduling scheme can better meet the requirements of actual construction vehicle. When the construction driving time is optimized specifically, the invention provides an iterative optimization method, only part of construction tasks are scheduled in each optimization process, and the problem is solved quickly, so that the real-time scheduling requirement of the driving operation of a construction line is met, and the practical application value of the invention is improved.
Drawings
FIG. 1 is a flow chart of an intelligent traffic scheduling method for a rail transit construction line according to the present invention;
FIG. 2 is a diagram illustrating the development and construction of the intelligent traffic dispatching system of the rail transit construction line according to the present invention;
FIG. 3 is a diagram showing the arrangement of operation and driving after the construction day plan is passed;
fig. 4 is a diagram of arrangement of construction driving tasks according to the intelligent driving scheduling method for the rail transit construction line.
Detailed Description
The invention is further described with reference to the following figures and specific examples. The development and architecture diagram of the intelligent vehicle dispatching system of the rail transit construction line is shown in fig. 2. The received routing data is transmitted from an existing track construction informatization system, and comprises that each construction department on a construction site obtains standard routing data through reporting a construction day plan and auditing by a superior department, wherein the standard routing data comprises a locomotive number, a construction task type, work content, a construction starting point, a construction ending point, a departure position, a collection position, expected starting time, expected ending time and locomotive group information. The received schedule data is stored in a csv type task requirement description file in a tabular form, the format and definition of each field of the file are shown in table 1, table 2 is an actual construction driving task requirement table which is derived from an actual rail transit informatization system, and the table is taken as a specific case to describe the specific implementation process of the method in detail.
TABLE 1 form and definition table for each field of task requirements
Figure BDA0003529432740000051
Figure BDA0003529432740000061
TABLE 2 actual construction vehicle task requirement table
Figure BDA0003529432740000062
As shown in fig. 1, an intelligent driving scheduling method for a rail transit construction line includes:
step 1: acquiring the travel arrangement data of construction vehicle tasks on a rail transit construction line, and constructing a construction vehicle task set omega to be scheduled; the method specifically comprises the following steps:
step 1.1: extracting data information required by the schedule arrangement of the construction vehicles, and sequentially constructing a construction task vector task of each construction vehiclei：
Figure BDA0003529432740000063
Wherein, taskIDiThe construction task number is represented and is the only identification of the construction driving task; taskTypeiThe construction task type is specifically numbered based on the priority of the actual construction requirement, if the track laying task has higher priority, the corresponding number is 1, and the taskDes is used for recording the construction operation content; s is1i、s2iRespectively representing a construction starting point and a construction ending point;
Figure BDA0003529432740000064
respectively representing a desired start time and a desired end time; s3i、s4iRespectively showing the departure position and the receiving position; t isgiInformation of the train set;
step 1.2: constructing a construction driving task set omega to be scheduled, and specifically constructing a driving task set omega according to each construction driving taskiDesired start time t1iAnd a desired end time t2iDetermine whether scheduling is required, when
Figure BDA0003529432740000065
Or
Figure BDA0003529432740000066
When, consider taskiNeed to schedule and taskiAdding the data into a construction vehicle task set omega to be scheduled, otherwise, not scheduling, wherein the final set omega can be expressed as:
Figure BDA0003529432740000071
wherein, TD1And TD2Respectively representing the starting time and the ending time of construction scheduling;
the time range specified by the user and needing to arrange the construction driving task is assumed as follows:
TD1＝2021/4/3 00:00，TD2＝2021/4/5 00:00
according to the step 1, the finally constructed set Ω of driving tasks to be scheduled for construction can be represented by a table, which is specifically shown in table 3:
TABLE 3 running task set omega table for construction to be scheduled
Figure BDA0003529432740000072
Step 2: carrying out priority sequencing on construction driving tasks according to the construction type and the construction starting point; the method comprises the following steps:
step 2.1: performing primary priority sequencing on the construction driving tasks according to the construction types of the construction driving tasks, and defining task tasks in a construction driving task set omegaiIs given by piTo show, in the present embodiment, there are 9 tasks to be sorted in the task set Ω. p is a radical ofiHas a value range of {1, 2, 3, … 9}, piThe smaller the value, the higher the priority. Traversing each driving task in the driving task set omegaiWhen taskiConstruction task type taskTypei1 (i.e. "track laying") type), the task is divided into a high-priority driving task set omega1＝{taski|taskType i1, the driving tasks of other categories are divided into a driving task set omega with low priority2＝{taski|taskTypeiNot equal to 1 }. Specific example Ω in this example1＝{task28}，Ω2＝{task27，task30，task31，task32，task33，task37，task34，task35}
Step 2.2: constructing a priority ordering rule, wherein the farther a construction starting point of a construction driving task is, the higher the corresponding priority of the construction driving task is; specifically, it can be expressed as:
If s1i＜s1j then pi＜pj
wherein s is1iAnd s1jTask for showing construction drivingiAnd construction driving taskjConstruction starting point of piAnd pjRespectively indicating construction driving taskiAnd construction driving taskjTask priority of (2).
Step 2.3: set task omega1And Ω2The construction vehicle tasks in the step (2) are subjected to priority sequencing according to the sequencing rule generated in the step (2.2), and corresponding construction vehicle task queues Q are generated according to the sequence of the priority from high to low11And Q12(ii) a In this example Q11＝{task28} and Q12＝{task37，task30，task31，task32，task33，task34，task35，task27}；
Step 2.4: utilizing construction driving task queue Q11And Q12Generating task queue Q after priority sequencing of all construction driving tasks1：
Q1＝[Q11，Q12]
According to step 2.4, the construction driving task queue Q in the embodiment1Comprises the following steps:
{task28，task37，task30，task31，task32，task33，task34，task35，task27}
queue Q1The specific information of (1) is shown in the following table, and the field p represents the priority of the task, as shown in table 4;
TABLE 4 task priority Table represented by field p
Figure BDA0003529432740000081
And step 3: constructing an optimized objective function iterative optimization of construction vehicle scheduling to generate a vehicle scheduling scheme of the rail transit construction line; the method comprises the following steps:
step 3.1: queue initialization, namely, establishing and initializing a scheduled construction driving task queue Q2，Q2The initial value being null, i.e. initialised
Figure BDA0003529432740000082
To-be-scheduled construction driving task queue Q3，Q3With an initial value of null, i.e. initialised
Figure BDA0003529432740000083
Construction and initialization of scheduled construction driving task queue Q with conflict4，Q4With an initial value of null, i.e. initialised
Figure BDA0003529432740000084
Wherein Q2For storing scheduled construction traffic tasks, Q3The system is used for storing construction driving tasks needing to be scheduled; q4The system is used for storing the construction driving task after the conflict constraint detection;
step 3.2: updating queue Q to be scheduled3Extracting Q1The first construction driving task to be scheduled in the queue reaches Q3In the queue, a first construction driving task is selected from the queue Q1 and is placed into the queue Q3;
Q1＝Q1-{taski}
Q3＝Q3∪{taski}
the above operations are repeatedly executed until the queue Q3Number of tasks in (1) up to N3And (4) stopping.
In this embodiment, N is defined31, so queue Q will be equal to1Team head construction driving task28Put into queue Q3At this time Q3＝{task28}，Q1＝{task37，task30，task31，task32，task33，task34，task35，task27}；
Step 3.3: constructing an optimized objective function of construction traffic scheduling and determining Q3The driving time of the driving tasks in the queue is constructed; the method comprises the following steps:
step 3.3.1: determination of Q3Task for construction vehicle in queueiThe decision variables include the starting time t of the construction task1，jEnd time t2，jDeparture time t3，jAnd time t of receiving4，j；
According to the characteristics of construction driving track, following basic process criteria and safety criteria, a four-point three-line solving idea is established, namely each construction task is determinedjStart time t of1，jEnd time t2，jDeparture time t3，jAnd time t of receiving4，jAnd the four space-time points are sequentially connected end to generate three running lines to finish the drawing of the single construction driving track. Thus defining the decision variable X ═ t1，j，t2，j，t3，j，t4，j|j＝1，...，N3}. In the present embodiment, the decision variable X is represented as { t }1，1，t2，1，t3，1，t4，1}。
Step 3.3.2: in order to ensure that the generated construction driving track conforms to the actual construction plan requirement as much as possible, an optimization objective function J of construction driving scheduling is established according to decision variables:
Figure BDA0003529432740000091
in the formula (I), the compound is shown in the specification,
Figure BDA0003529432740000092
represents Q3Task for construction vehicle in queuej′The desired start time of the time of day,
Figure BDA0003529432740000093
represents Q3Task for construction driving in queuej′The desired end time of; the minimization objective function J represents that the generated construction trajectory should be as consistent as possible with the desired construction plan, while minimizing the total operation time of the train to achieve a consideration of energy consumption objectives.
Step 3.3.3: the construction vehicle tasks have a fixed logical relation in time, and in order to ensure the feasibility of the construction vehicle track, a vehicle time feasibility constraint C in the construction vehicle tasks needs to be established for each construction vehicle taskinThe method specifically comprises the following steps:
constraint C for departure time and start time of same construction driving task1：
t1，j＞t3，j j＝1，2，3，...，N3
Constraint C for starting time and ending time of same construction driving task2：
t2，j＞t1，j j＝1，2，3，...，N3
Constraint C for vehicle collection time and ending time of same construction driving task3：
t4，j＞t2，j j＝1，2，3，...，N3
Operating time constraint C4：
Figure BDA0003529432740000105
Step 3.3.4: judging whether construction traveling time feasibility constraint C between construction traveling tasks needs to be constructed or notout(ii) a Traverse Q3Judging the queue Q of the construction driving tasks to be arranged3In each construction driving taskjDriving interval [ s ]3j，s1j]And queue Q2In-built construction vehicle taskkDriving interval of(s)3k，s1k]If there is a common part, if there is, a feasibility constraint C is establishedout(ii) a And Q is2The corresponding construction driving task in the middle is moved to a queue Q4The preparation method comprises the following steps of (1) performing; otherwise, feasibility constraint C is not establishedout；
The feasibility constraint CoutThe method comprises the following steps:
tracking Interval time constraint C5：
Figure BDA0003529432740000101
Overrun constraint C6：
(t3j-t3k)×(t1j-t1k)＞0，j≠k，j＝1，2，3，...，N3，k＝1，2，3，...，N2
Where Tz represents a minimum operation interval time to be satisfied between construction vehicles, t3jRepresents Q3Task for construction vehicle in queuejDeparture time of, t4jRepresents Q3Task for construction vehicle in queuejTime of departure, t3kRepresents Q2Task for construction vehicle in queuekDeparture time of, t4kRepresents Q2Task for construction vehicle in queuekTime of collection of (N)2Presentation queue Q2Capacity of (A), N3Presentation queue Q3The capacity of (a);
according to the steps 3.3.2-3.3.4, the corresponding optimization problem of the embodiment can be expressed as:
Figure BDA0003529432740000102
Figure BDA0003529432740000103
step 3.3.5: solving by adopting an optimization solver according to the constructed optimization problem, and when the problem can obtain a feasible solution, solving the queue Q3And Q4The construction task in (1) is added into the queue Q2In (1),namely Q2＝Q2∪Q3∪Q4，
Figure BDA0003529432740000104
Defining the obtained decision variable as the running time of the running for the scheduled construction, and when the problem has no feasible solution, defining the queue Q4The construction task in (1) is transferred to a queue to be scheduled Q3In (1), namely: q3＝Q3∪Q4，
Figure BDA0003529432740000111
In this embodiment, we use a Cplex optimizer to solve, and finally find that there is a feasible solution to the problem, and the obtained decision variable X ═ 2021/4/40: 00, 2021/4/48: 00, 2021/4/420: 00, 2021/4/501: 00]Queue of
Figure BDA0003529432740000112
Q2＝{tatsk28}。
Step 3.4: determination of Q1And (4) if the train which is not scheduled still exists in the queue, turning to the step 3.2 if the train which is not scheduled still exists in the queue, otherwise, finishing the arrangement of the construction driving task. In this embodiment, Q1There are also unscheduled trains in the queue and so the operations of steps 3.2 to 3.4 need to be repeated until the termination condition is met.
The graphical display method is used for generating a scheduling scheme, so that a user can master the situation that conflicts are likely to occur in the vehicle scheduling process, the expected starting time, the expected ending time parameter and the construction vehicle task requirement are adjusted through man-machine interaction, and the scheduling scheme is further optimized. The method of the invention is used for obtaining a driving aid decision scheme of the rail transit construction line, as shown in figure 4. In the figure, the abscissa represents the time of the travelling crane, the ordinate is a station corresponding to the construction travelling crane track, the dotted line represents the travelling crane track from the departure position to the construction starting point, the solid line represents the operation track from the construction starting point to the construction ending point of the construction travelling crane, and the dash-dot line represents the travelling crane track from the construction ending point to the receiving position, so that after the system is optimized, each construction travelling crane forms a basic pattern of 'four-point three-line', and the basic idea of the system optimization solution is met. Fig. 4 also includes the locomotive number of a certain operation construction vehicle and specific construction operation contents.
An intelligent vehicle scheduling system for a rail transit construction line is realized according to the intelligent vehicle scheduling method for the rail transit construction line, and comprises the following components: the system comprises a data preprocessing module, a heuristic driving sequencing submodule, a heuristic driving time optimizing submodule and a visual output module;
the data preprocessing module is used for generating a construction vehicle task set to be scheduled according to the travel arrangement data of all construction vehicle tasks on the rail transit construction line;
the heuristic driving ordering submodule is used for carrying out priority ordering on the construction driving tasks according to the construction types and the construction starting points of the construction driving tasks;
the heuristic driving time optimization submodule is used for constructing an optimization objective function of construction driving scheduling and generating a driving scheduling scheme of a rail transit construction line;
the visual output module is used for visually outputting a railway traffic construction line traveling scheduling scheme, and the scheduling scheme can be adjusted through man-machine interaction (such as adjustment of expected start time, expected end time parameters and construction traveling task requirements) so as to meet the actual requirements of construction traveling.
Fig. 3 shows the operational driving arrangement after the construction day plan review passed by each construction unit, and by comparing fig. 3 with fig. 4, it is found that the present invention can fully solve the potential driving conflict of construction driving tasks reported by each construction unit and perform optimized arrangement on each construction driving task, for example, in fig. 3, there is an occupation conflict of track resources between the driving tasks with taskID of 30 and 31, and there is also a potential driving conflict between taskID of 28 and 32, 33 and 37, and fig. 4 shows that the construction driving tasks optimized and solved by the present invention have no driving conflict and satisfy the safety constraint C1，C2，C3，C4，C5And C6。

Claims (8)

1. An intelligent vehicle dispatching method for a rail transit construction line is characterized by comprising the following steps:
step 1: acquiring the travel arrangement data of all construction vehicle tasks on a rail transit construction line, and constructing a construction vehicle task set omega to be scheduled;
step 2: carrying out priority sequencing on construction driving tasks according to the construction type and the construction starting point;
and step 3: and constructing an optimized objective function of construction vehicle scheduling to generate a vehicle scheduling scheme of the rail transit construction line.
2. The intelligent traffic scheduling method for the rail transit construction line according to claim 1, wherein the step 1 comprises:
step 1.1: constructing a construction task vector task according to the travel arrangement data of the ith construction vehiclei：
Figure FDA0003529432730000011
Wherein, taskIDiExpressed as a construction task number; taskTypeiIs a construction task type; taskDes are the work content; s1i、s2iRespectively representing a construction starting point and a construction ending point;
Figure FDA0003529432730000012
respectively representing expected start time and expected end time; s3i、s4iRespectively showing the departure position and the receiving position; t isgiRepresenting vehicle group information;
step 1.2: constructing a construction driving task set omega to be scheduled, wherein the set is expressed as:
Figure FDA0003529432730000013
wherein, TD1And TD2Individual watchShowing the start time and the end time of the construction schedule,
Figure FDA0003529432730000014
and
Figure FDA0003529432730000015
then the task of construction and driving is showniA desired start time and a desired end time.
3. The intelligent traffic scheduling method for the rail transit construction line according to claim 1, wherein the step 2 comprises:
step 2.1: performing primary priority division on the construction driving tasks according to the construction types of the construction driving tasks, and dividing the construction driving tasks into task sets under different levels;
step 2.2: constructing a priority sequencing rule, wherein the farther a construction starting point of a construction driving task is, the higher the priority of the corresponding construction driving task is;
step 2.3: carrying out priority sequencing on the construction driving tasks in each task set according to the sequencing rule generated in the step 2.2, and generating corresponding construction driving task queues according to the sequence of the priority from high to low;
step 2.4: generating task queue Q with all construction driving tasks in priority order according to construction driving task queue1。
4. The intelligent traffic scheduling method for the rail transit construction line according to claim 1, wherein the step 3 comprises:
step 3.1: queue initialization, namely, establishing and initializing a scheduled construction driving task queue
Figure FDA0003529432730000016
To-be-scheduled construction driving task queue
Figure FDA0003529432730000017
And construction driving driver with conflictBusiness queue
Figure FDA0003529432730000018
Wherein Q2For storing scheduled construction traffic tasks, Q3For storing construction traffic tasks, Q, requiring scheduling4The system is used for storing construction traveling tasks with constraint conflict with the construction tasks to be scheduled;
step 3.2: updating queue Q to be scheduled3At Q1Sequentially extracting construction driving tasks with the highest priority from the queue until Q3The number of tasks in the queue is N3N is one3Represents Q3The capacity of the queue;
step 3.3: constructing an optimized objective function of construction traffic scheduling and determining Q3The driving time of the driving tasks in the queue is constructed;
step 3.4: determination of Q1And (4) if the train which is not scheduled still exists in the queue, turning to the step 3.2 if the train which is not scheduled still exists in the queue, otherwise, finishing the arrangement of the construction driving task.
5. The intelligent traffic scheduling method for the rail transit construction line according to claim 4, wherein the step 3.3 comprises the following steps:
step 3.3.1: determination of Q3Task for construction vehicle in queueiThe decision variables include the starting time t of the construction task1，jEnd time t2，jDeparture time t3，jAnd time t of vehicle receiving4，j；
Step 3.3.2: establishing an optimization objective function J of construction traffic scheduling according to decision variables:
Figure FDA0003529432730000021
in the formula (I), the compound is shown in the specification,
Figure FDA0003529432730000022
represents Q3In queueConstruction driving taskj′The desired start time of the time of day,
Figure FDA0003529432730000023
represents Q3Task for construction vehicle in queuej′The desired end time of;
step 3.3.3: construction of traveling time feasibility constraint C in construction traveling taskin；
Step 3.3.4: judging and constructing feasibility constraint C of driving time between construction driving tasksout；
Step 3.3.5: according to constraint CinAnd CoutSolving an objective function J, and when the problem has a feasible solution, using a queue Q3And Q4The construction task in (1) is added into the queue Q2Defining the obtained decision variable as the running time of the construction running to be scheduled, and when the problem can not obtain a feasible solution, defining the queue Q4The construction task in (1) is transferred to a queue Q to be scheduled3In (1).
6. The method for intelligent traffic scheduling of rail transit construction line according to claim 5, wherein feasibility constraint C in the step 3.3.3inThe method comprises the following steps:
construction driving task departure time and start time constraint C1：
t1，j＞t3，j j＝1，2，3，...，N3
Construction driving task start time and end time constraint C2：
t2，j＞t1，j j＝1，2，3，...，N3
Construction driving task vehicle-receiving time and end time constraint C3：
t4，j＞t2，j j＝1，2，3，...，N3
Operating time constraint C4：
Figure FDA0003529432730000031
7. The intelligent traffic scheduling method for the rail transit construction line according to claim 5, wherein the step 3.3.4 comprises: traverse Q3Judging the queue Q of the construction driving tasks to be arranged3In each construction vehicle taskjDriving interval [ s ]3j，s1j]And queue Q2In-built construction vehicle taskkDriving interval [ s ]3k，s1k]If there is a common part, if there is, a feasibility constraint C is establishedoutAnd Q is2The corresponding construction driving task in the queue Q4Performing the following steps; otherwise, feasibility constraint C is not establishedout；
The feasibility constraint CoutThe method comprises the following steps:
tracking interval time constraint C5：
Figure FDA0003529432730000032
Overrun constraint C6：
(t3j-t3k)×(t1j-t1k)＞0，j≠k，j＝1，2，3，...，N3，k＝1，2，3，...，N2
Where Tz represents a minimum operation interval time to be satisfied between construction vehicles, t3jRepresents Q3Task for construction driving in queuejDeparture time of, t4jRepresents Q3Task for construction vehicle in queuejTime of departure, t3kRepresents Q2Task for construction driving in queuekDeparture time of, t4kRepresents Q2Task for construction vehicle in queuekTime of taking-up of (N)2Presentation queue Q2Capacity of (C), N3Presentation queue Q3The capacity of (c).
8. An intelligent traffic scheduling system for a rail transit construction line, which is realized by the intelligent traffic scheduling method for the rail transit construction line according to any one of claims 1 to 7, and comprises: the system comprises a data preprocessing module, a heuristic driving sequencing submodule, a heuristic driving time optimizing submodule and a visual output module;
the data preprocessing module is used for generating a construction vehicle task set to be scheduled according to the travel arrangement data of all construction vehicle tasks on the rail transit construction line;
the heuristic driving ordering submodule is used for carrying out priority ordering on the construction driving tasks according to the construction types and the construction starting points of the construction driving tasks;
the heuristic driving time optimization submodule is used for constructing an optimization objective function of construction driving scheduling and generating a driving scheduling scheme of a rail transit construction line;
the visual output module is used for visually outputting a running scheduling scheme of the rail transit construction line, and the scheduling scheme can be adjusted through human-computer interaction to meet the actual requirements of construction running.
CN202210206564.5A 2022-03-03 2022-03-03 Intelligent running scheduling method and system for rail transit construction line Pending CN114565296A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210206564.5A CN114565296A (en) 2022-03-03 2022-03-03 Intelligent running scheduling method and system for rail transit construction line

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210206564.5A CN114565296A (en) 2022-03-03 2022-03-03 Intelligent running scheduling method and system for rail transit construction line

Publications (1)

Publication Number Publication Date
CN114565296A true CN114565296A (en) 2022-05-31

Family

ID=81717553

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210206564.5A Pending CN114565296A (en) 2022-03-03 2022-03-03 Intelligent running scheduling method and system for rail transit construction line

Country Status (1)

Country Link
CN (1) CN114565296A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117592809A (en) * 2023-11-21 2024-02-23 广州市盾建建设有限公司 Municipal engineering construction scheme optimization method and system based on artificial intelligence
CN117610899A (en) * 2024-01-24 2024-02-27 纳博特南京科技有限公司 Multi-robot task allocation method based on priority

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117592809A (en) * 2023-11-21 2024-02-23 广州市盾建建设有限公司 Municipal engineering construction scheme optimization method and system based on artificial intelligence
CN117592809B (en) * 2023-11-21 2024-05-10 广州市盾建建设有限公司 Municipal engineering construction scheme optimization method and system based on artificial intelligence
CN117610899A (en) * 2024-01-24 2024-02-27 纳博特南京科技有限公司 Multi-robot task allocation method based on priority
CN117610899B (en) * 2024-01-24 2024-06-14 纳博特南京科技有限公司 Multi-robot task allocation method based on priority

Similar Documents

Publication Publication Date Title
CN109532960B (en) Automatic dispatching system for marshalling station
Yin et al. Research and development of automatic train operation for railway transportation systems: A survey
CN111353705B (en) Urban rail transit multi-field route management system and comprehensive management and control system
CN114565296A (en) Intelligent running scheduling method and system for rail transit construction line
EP0782521B1 (en) Scheduling system and method
CN114312926B (en) Method and system for optimizing operation adjustment scheme of urban rail transit train
CN103366262A (en) Dispatching plan generating method of industrial railway logistics intelligent dispatching system
CN104778523B (en) A kind of enterprise railway intelligence operation management operation plan generation method and its system
Ramírez et al. Freight train in the age of self-driving vehicles. a taxonomy review
JP7273524B2 (en) Operation management system
CN1256255C (en) Marshalling station comprehensive integrated automation system
Yue et al. Reinforcement learning for online dispatching policy in real-time train timetable rescheduling
Liu Unmanned driving systems for smart trains
Zhen et al. A decision framework for automatic guided vehicle routing problem with traffic congestions
Marlière et al. A conditional time-intervals formulation of the real-time Railway Traffic Management Problem
CN116468210A (en) Vehicle dispatching method and device for coal mine auxiliary transportation and electronic equipment
Wen Prediction methods of train operation conflict for high-speed railway
CN110803203B (en) Method and system for predicting evolution of high-speed railway running track
Prokopov et al. Constructing a model for the automated operative planning of local operations at railroad technical stations
CN110362725B (en) Phase planning improvement method for planning station yard representation
CA2700993A1 (en) Method for creating timetables for transportation systems taking into account time limits
Liu Optimization of Computer-aided Decision-making System for Railroad Traffic Dispatching Command
CN112700058B (en) Tail marshalling plan determining system and method for railway marshalling station
CN118072521B (en) Method, system and equipment for cooperatively controlling multi-vehicle-type vehicles and road resources under internet connection
CN111612309B (en) Railway transportation task generation method and device and railway transportation scheduling system

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