Multimodal transport logistics collaborative management and control system

Abstract

The invention relates to the technical field of distribution service, in particular to a multimodal transport logistics collaborative management and control system, which comprises a task triggering coordination module, a handover sequence constraint module, a transport rhythm monitoring module, a state gap complementation module and a label propulsion adjustment module. According to the method, through sequential comparison of task path segments and node time, in combination with task state updating conditions, scheduling differentiation step items are extracted, a task waiting list with control effectiveness is generated, handover promotion after previous uncompleted tasks is blocked according to a state undertaking sequence, rhythm breaking path segments are identified, and state blank fields are complemented. And the continuous conduction direction of the tail-section label is adjusted according to the path capacity, so that task state evolution and path section propulsion are kept in a consistent rhythm, the phenomena of node conflict, task suspension and information disjunction in a transportation chain are reduced, and a transmission system with continuous rhythm and coordinated time sequence is promoted to be formed between path sections. And the conduction stability of transportation scheduling and the smooth cohesion of tasks among the nodes are enhanced.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of distribution services, in particular to a multimodal logistics collaborative management system. BACKGROUND

[0002] The technical field of distribution services involves transportation node scheduling, transportation path planning, transportation resource coordination, task execution tracking, information registration methods and state feedback mechanisms, etc. It mainly achieves efficient coordination between different transportation means through the collaborative arrangement of multiple transportation modes, and builds a multi-linkage system covering goods loading and unloading, in-transit monitoring, arrival handover, and information interaction. It relies on methods such as task assignment and execution feedback, transportation time window matching, transportation tool entry and exit recording, and node operation connection to achieve efficient coordination between different transportation means. Among them, the traditional multimodal logistics collaborative management system refers to a system used to manage the transfer and execution process of goods in the transportation chain through multiple transportation modes such as railways, highways, waterways, and air transportation. It mainly focuses on transportation tool schedule arrangement, node handover time control, in-transit state registration, and goods connection plan determination. Traditional methods usually complete transportation process organization, transportation state acquisition, and transportation task scheduling through means such as manually setting node connection time tables, recording transportation time nodes on paper, conveying goods connection information verbally, regularly collecting transportation tool location data, and summarizing goods flow based on transportation logs.

[0003] The existing technology relies on static time planning and node preset order for scheduling control, and does not form a synchronous constraint logic based on task state update. In the task advancement process, there is a lack of effective control of the state of the previous and next nodes. When the previous path segment task is delayed or not completed, the next path segment may be mistakenly triggered to execute, causing node resource conflicts and scheduling chaos. In the absence of task state feedback or registration lag, it is difficult to identify task execution rhythm faults and path capacity mismatches, which may lead to transportation rhythm imbalance and information flow disconnection, affecting the transparency and integrity of the task process. SUMMARY

[0004] To solve the technical problems existing in the prior art, the embodiments of the present application provide a multimodal logistics collaborative management system.

[0005] In one aspect, a multimodal logistics collaborative management system is provided, which includes: The task trigger coordination module obtains a list of transportation task path segments, a task initiation time, and a node departure registration time. It compares the time sequence corresponding to the task number and the path segment number and analyzes the scheduling synchronization. It extracts incomplete scheduling items and obtains a node task waiting list. The handover sequence constraint module compares the current task and the previous task execution sequence and state based on the node task waiting list. If the previous task state is not updated, it stops the current task handover and obtains a task handover suspension record. The transport rhythm monitoring module identifies a discontinuous path segment based on the task handover suspension record, and in comparison with a path segment sequence, a to-off node time and a promotion time sequence, to obtain a path segment rhythm anomaly identification table; The state gap completion module identifies a time gap between a state label time field and a placeholder label field based on the path segment rhythm anomaly identification table, writes a placeholder label into the blank time segment, and obtains a state placeholder marking record book; The label promotion adjustment module writes a tail segment label into a next path segment at a quantity inconsistency position based on the state placeholder marking record book, and obtains a multimodal transport task path coordination instruction set.

[0006] As a further scheme of the present application, the node task waiting list includes an unfinished scheduling matching task number, an unfinished scheduling matching path segment number, a node number and a departure time sequence information, the task handover suspension record includes a current task number, a corresponding intermodal node number, a previous task number and an unfinished state mark, the path segment rhythm anomaly identification table includes a path segment number with repeated promotion and time skipping, an associated task paragraph number and a promotion anomaly type identification, the state placeholder marking record book includes a path segment number, a state label sequence, an abnormal interval area and an inserted placeholder label field, and the multimodal transport task path coordination instruction set includes a tail segment state label sequence, a path segment capacity field, a starting node path segment combination and a transport task identification field.

[0007] As a further scheme of the present application, the unfinished scheduling item refers to a task number and a path segment number that have not been responded in a current scheduling instruction. The previous task state refers to a completion condition of a task before a current task in a task handover sequence, and whether the current task can continue to be executed is judged.

[0008] As a further scheme of the present application, the discontinuous path segment refers to a path segment with discontinuous promotion rhythm caused by an abnormal state label time field in a task path promotion process. The blank time segment refers to a time field gap formed due to missing promotion time and incomplete state label in a task path.

[0009] As a further scheme of the present application, the task trigger coordination module includes: The path segment sequence analysis submodule obtains a path segment list of a current batch of transport tasks, a task initiation time and a node departure registration time, reads a task number corresponding to each path segment, and refers to a task number and a path segment number corresponding to a time field, and obtains a task path segment number corresponding result according to the time sequence. The scheduling instruction synchronization judgment submodule judges whether the task number corresponding path segment number appears in the scheduling instruction by comparing the path segment number included in the scheduling instruction based on the task path segment number corresponding result, to obtain a scheduling non-response task record set. The node task list extraction submodule registers the path segment number node departure time, associates the task number and path segment number information according to the node number based on the scheduling non-response task record set, and obtains a node task waiting list.

[0010] As a further scheme of the present application, the handover sequence constraint module comprises: The node field extraction submodule extracts the through node number, task handover sequence field and previous task state parameter based on the node task waiting list, reads the field content corresponding to each task number, and corresponds the task number, sequence field and state parameter under the same node number to obtain a task sequence state corresponding set. The previous task screening submodule identifies the sequence field position corresponding to the current task number based on the task sequence state corresponding set, analyzes the sequence field completion state under the same node number, and obtains an unfinished previous number set. The handover delay verification submodule delays the handover action and extracts the corresponding path segment and task number data based on the unfinished previous number set, matches the data entry associated with the current task number, and obtains a task handover suspension record.

[0011] As a further scheme of the present application, the transport rhythm monitoring module comprises: The task path extraction submodule extracts the path segment sequence of the corresponding task based on the task number in the task handover suspension record, collects the arrival time, departure time and state label content associated with each path segment number, and corresponds each path segment number to the associated time parameter and state label in the time advancing sequence to obtain a path segment state time mapping table. The time sequence scanning submodule screens the path segment numbers that appear repeated advancing and advancing skipping in the advancing interval according to the adjacent state label corresponding time parameter comparison advancing interval based on the path segment state time mapping table, to obtain an advancing sequence abnormal position set. The rhythm abnormality marking submodule locates the abnormal path segment number task paragraph based on the advancing sequence abnormal position set, matches the corresponding information according to the association between the path segment number and the task number, and obtains a path segment rhythm abnormality identification table.

[0012] As a further scheme of the present application, the state gap completion module comprises: The time field extraction submodule extracts the time field of adjacent status labels and node placeholder label fields in the advancement sequence based on the path segment number in the path segment rhythm anomaly identifier table. It aligns the time content of the status labels under the same path segment number according to the advancement order, and then synchronizes the node placeholder label fields to obtain the status time placeholder correspondence table. The advance time blank segment positioning submodule, based on the state time occupancy correspondence table, compares the time field of each group of state tags according to the advance order, filters the skipped and repeated parts in the time field, and locates the position in the tag sequence to obtain the advance time blank segment set; The placeholder label insertion submodule extracts the node placeholder label field at the corresponding position based on the set of blank segments in the advancement time, fills the placeholder labels into the time field column in order according to the position of the blank segment, and updates the continuous status label content under the corresponding path segment to obtain the status placeholder mark record book.

[0013] As a further embodiment of the present invention, during the process of the time field of each group of status labels in the status time occupancy table, the time fields of adjacent status labels under the same path segment number are compared in time order to locate the discontinuous position as the content of the advancement time blank segment. During the process of setting up the node placeholder label field for each position in the time blank segment, the node placeholder label field that matches the path segment number is located in the status time placeholder correspondence table by indexing the path segment number. During the process of filling in the time field column, the node placeholder label fields are written into the corresponding blank positions in the time field column in the order of advancement. After writing, the status label content in the status time placeholder corresponding table is updated synchronously, and the updated content is saved to the status placeholder mark record book.

[0014] As a further aspect of the present invention, the tag propulsion adjustment module includes: The tail tag extraction submodule extracts the number of tags at the tail of the state tag sequence in each path segment based on the state placeholder mark record book, and collects the capacity field of the corresponding path segment. The tag number and capacity field are respectively mapped to the path segment number to obtain the tag capacity corresponding list. The advance position writing submodule, based on the tag capacity corresponding list, filters the path segment numbers where the number of tail tags does not match the capacity field, extracts the corresponding tail tag content, and writes the first and second tag sequences of the next path segment in the advance order to obtain the path tag advance update set; The instruction field generation submodule advances the update set based on the path tags, extracts the transportation task identifier field and path node field associated with each tag, and matches the fields with the path segment numbers according to the task number to obtain the multimodal transport task path coordination instruction set.

[0015] Compared with the prior art, the application has the advantages and positive effects that: In the application, by comparing the task path segment and the node time in sequence, the scheduling differentiated steps are extracted combined with the task state update, the task waiting list with control effect is generated, the handover is promoted after the sequence of the state is blocked to block the previous incomplete task, the rhythm breaking path segment is identified to complete the state blank field, and the tail segment label is adjusted according to the path capacity to continue the conduction direction, so that the task state evolution and the path segment promotion keep consistent rhythm, the node conflict, task suspension and information disconnection phenomenon in the transportation chain are reduced, the transmission system with rhythm continuity and time sequence cooperation is formed between the path segments, and the conduction stability of the transportation scheduling and the smooth connection of the tasks between the nodes are enhanced. BRIEF DESCRIPTION OF DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the application, the following will briefly introduce the drawings needed to be used in the embodiment description. Obviously, the drawings in the following description are only some embodiments of the application, and for those skilled in the art, other drawings can also be obtained from these drawings without creative labor.

[0017] Figure 1 The system flowchart of the application; Figure 2 The system block diagram of the application; Figure 3 The flowchart of the task trigger coordination module in the application; Figure 4 The flowchart of the handover sequence constraint module in the application; Figure 5 The flowchart of the transportation rhythm monitoring module in the application; Figure 6 The flowchart of the state gap completion module in the application; Figure 7 The flowchart of the label promotion adjustment module in the application. DETAILED DESCRIPTION

[0018] The technical solutions in the application will be described below with reference to the drawings.

[0019] In the embodiments of the application, the words such as "example", "for example" and the like are used to represent an example, illustration or description. Any embodiment or design scheme described as "example" in the application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. In fact, the word "example" is intended to present the concept in a specific way. In addition, in the embodiments of the application, the meaning expressed by "and / or" can be both, or can be one of the two.

[0020] In the embodiments of the present application, the terms "image" and "picture" can be used interchangeably, and it should be pointed out that the meanings expressed are consistent when the distinction is not emphasized.

[0021] In the embodiments of the present application, sometimes the subscript such as W1 can be written in the form of non-subscript such as W1, and the meanings expressed are consistent when the distinction is not emphasized.

[0022] In order to make the technical problems, technical solutions and advantages to be solved by the present application more clear, the following will be described in detail in conjunction with the drawings and specific embodiments.

[0023] The embodiments of the present application provide a multimodal logistics collaborative management and control system, as shown in the multimodal logistics collaborative management and control system schematic diagram, the system comprises: Figures 1-2 A task triggering coordination module, a handover sequence constraint module, a transport rhythm monitoring module and a state gap completion module. The task triggering coordination module compares the task initiation time and the node departure registration time in sequence, corresponds the task number and the path segment number, analyzes the synchronization of the scheduling instruction, lists the task number and the path segment number that have not completed the scheduling matching in the to-be-processed list, and obtains the node task waiting list based on the path segment list, the task initiation time and the node departure registration time of the current batch of transport tasks. The handover sequence constraint module extracts the corresponding multimodal node number, the task handover sequence field and the previous task state parameter based on the node task waiting list, jointly compares the sequence field and the state parameter of the tasks under the same node, extracts the number that has not completed the value of the state parameter and is in front of the current task in the sequence field, and delays the handover of the current task number, and obtains the task handover suspension record. The transport rhythm monitoring module extracts the path segment sequence, the time parameter of each segment to and from the node and the advancing time sequence of the state label of the corresponding task based on the task number in the task handover suspension record, compares the advancing time sequence of the state label in the path segment, extracts the position path segment number and the task paragraph where the repetition and time skipping appear in the advancing interval, and obtains the path segment rhythm abnormality identification table. The state gap completion module extracts the adjacent state label time field and the node placeholder label field from the advancing sequence based on the path segment number in the path segment rhythm abnormality identification table, expands and positions the time interval value abnormal area according to the sequence of the time field, inserts the placeholder label field into the blank area, updates the continuous label sequence according to the writing order, and obtains the state placeholder mark record book. The label pushing adjustment module extracts the number of labels at the tail of the state label sequence and the path segment capacity field based on the state placeholder mark record book, writes the tail segment labels to the starting position of the next path segment according to the pushing sequence at the position where the number is inconsistent, and obtains the multimodal transport task path coordination instruction set by combining the corresponding transport task identification field and the path node field.

[0024] The node task waiting list includes the task number of the unfinished scheduling matching, the path segment number of the unfinished scheduling matching, the node number and the departure time sequence information, the task handover suspension record includes the current task number, the corresponding intermodal node number, the previous task number and the unfinished state mark, the path segment rhythm abnormality identification table includes the path segment number of the repeated pushing and the time skipping, the associated task paragraph number and the pushing abnormality type identification, the state placeholder mark record book includes the path segment number, the state label sequence, the abnormal interval area and the inserted placeholder label field, and the multimodal transport task path coordination instruction set includes the tail segment state label sequence, the path segment capacity field, the starting node path segment combination and the transport task identification field.

[0025] Specifically, as shown in Figure 2 , 3 The task trigger coordination module includes: The path segment sequence analysis submodule obtains the path segment list of the current batch of transport tasks, the task initiation time and the node departure registration time, reads the task number corresponding to each path segment, and refers to the task number and the path segment number corresponding to the time field according to the time sequence to obtain the task path segment number corresponding result according to the time sequence pairing number. Firstly, the path segment data of all transportation tasks in the current batch is read from the database, each path segment is composed of the starting point, the ending point, the path segment number and the associated task number, the list is arranged in the order of path segment number, the task number field attached to each path segment needs to be read in turn and screened and classified, and then combined with the start time information of the transportation task to which the path segment belongs and the departure registration time of each path segment node, the task start time is extracted from the transportation task registration record, the node departure registration time is extracted through the node operation log record, both need to be converted into a unified format for comparison, the order of the start time and the departure time is judged, if the departure time is earlier than the start time, it is considered that the data is abnormal and does not participate in the subsequent matching, if the departure time is equal to or later than the start time, it is considered as valid time to screen the task number of the path segment, then the path segment number and its corresponding task number that meet the conditions are established in a one-to-one correspondence, and the path segment number is rearranged according to the order in the time field, during the process, a time interval threshold x can be set, when the time difference between two path segments is less than x, it is considered to belong to the same batch task, the value of x can be set by referring to the average path segment departure time interval of the previous transportation task, for example, in a transportation, the departure time of the path segments usually differs by no more than 30 minutes, then x can be set to 30, further, taking the task number as the index, all valid path segments under the same task are sorted and numbered according to the departure time, the numbering method is to start from 1 and increment the number according to the time sequence, for example, task T1 has three path segments, the departure times are 08:00, 08:25 and 08:50 respectively, then the numbering result is T1-1, T1-2 and T1-3, after the sorting is completed, the task path segment number corresponding result is obtained.

[0026] The scheduling instruction synchronization judgment sub-module is based on the task path segment number corresponding result, compares the path segment number included in the scheduling instruction, analyzes whether the task number corresponding path segment number appears in the scheduling instruction, and obtains the scheduling non-response task record set; First, the task number and path segment number combination result of the paired task completed in the previous stage are taken as the input data set, each record in the data set is composed of task number and path segment number, such as task number T1 corresponding to path segment number P1, P2, P3, forming three records T1-P1, T1-P2, T1-P3, then the path segment number set contained in the current scheduling instruction is extracted, the set is usually derived from the scheduling information list issued by the scheduling console, each scheduling instruction clearly indicates the path segment number to be executed, such as scheduling task D1 instruction lists path segments P1, P4, P5, then the scheduling instruction path segment set is {P1, P4, P5}, then the task path segment number is judged one by one, the judgment process is to search for the existence of the path segment number in each task path segment record in the scheduling instruction path segment set, if the path segment number exists in the set, it is considered that the path segment has been responded in the scheduling instruction, if the path segment number is not in the set, it is marked as an unresponded path segment, and its corresponding task number is recorded in the unresponded task candidate set, this judgment operation can be realized by traversal operation, comparison operation is carried out for each record, for example, if path segment T1-P2 does not appear in the scheduling set {P1, P4, P5}, T1 is marked as an unresponded task number candidate, then the task number in the candidate set is repeated to remove the operation, to avoid the situation that multiple unresponded path segments lead to repeated record task numbers, the screening process removes the duplicate records in the set with task number as the unique key, and obtains the scheduling unresponded task record set.

[0027] The node task list extraction submodule registers the path segment number node departure time based on the scheduling unresponded task record set, associates the task number and path segment number information according to the node number, and obtains the node task waiting list. First, the task number in the record set is searched piece by piece, the path segment number set corresponding to each task number is extracted, and then the starting node number and the departure registration time corresponding to each path segment number are obtained from the path segment basic information library. The departure registration time is obtained by reading the departure field in the path segment corresponding transport log or registration table. The departure field records the accurate time point of the departure operation. The time is uniformly processed in hours and minutes. The uniform time value is used for subsequent association judgment. Next, each path segment number is grouped according to the node number dimension. The departure time is recorded under each node number to form an initial node list. In each group of nodes, the corresponding task number is further found according to the path segment number, and it is mapped to the corresponding node number to form a mapping relationship set of node and task number. For example, if task T1 contains path segments P1 and P2, the starting node of P1 is N1, and the starting node of P2 is N2. T1 will appear under N1 and N2 nodes respectively. Task T1 is registered under node number N1 and node number N2, each with corresponding path segment number and departure time. In the registration process, if multiple task numbers appear under a node number, they need to be sorted in time sequence. This operation is realized by arranging the task departure time field in the node from small to large. If the task departure time in the same node has repeated values, the secondary sorting is performed according to the task number in dictionary order to avoid the disorder of task record sequence. After the task record sorting is completed, the node task preliminary list table structure is constructed, and the fields are node number, task number, path segment number and departure time. Finally, the structure is de-duplicated. The de-duplication basis is the task number and path segment number combination key to avoid the same task path segment being recorded to the same node repeatedly. If path segment number P5 repeatedly appears in two transport tasks of node N3, only the first valid departure time corresponding task path segment pair is recorded. Finally, the node task list registration is completed, and the node task waiting list is obtained.

[0028] Specifically, as shown in Figure 2 , 4 The handover sequence constraint module includes: The node field extraction submodule extracts the intermodal node number, task handover sequence field and previous task state parameter based on the node task waiting list, reads the field content corresponding to each task number, and corresponds the task number, sequence field and state parameter under the same node number to obtain a task sequence state corresponding set; First, the node number, task number, and path segment number corresponding to each record in the list are extracted, and the intermodal node number, task handover sequence field, and previous task state parameter bound to the task number in the task database are read. The intermodal node number is used to identify the task flow link between multiple nodes, the task handover sequence field is an integer value field used to indicate the execution order of the task in the corresponding intermodal node, and the previous task state parameter is a Boolean field used to identify whether the previous task has been completed before entering the current node. After reading the contents of these three fields, the task number is used as the index item, the corresponding intermodal node number is used as the first mapping field, the task handover sequence is used as the second mapping field, and the previous state is used as the third mapping field to form a three-field joint mapping relationship. Then, the tasks are classified and processed by node number. First, all task numbers are classified under their corresponding node numbers using node number as the grouping key. Then, the task number set under each node number is sorted in two levels. The primary sorting rule is the task handover sequence field from small to large, and the secondary sorting rule is the task number dictionary order from small to large under the same sequence field. This sorting step is used to determine the sequential relationship of tasks within a node. After sorting, the previous task state parameter of each sorted task number is retrieved. During the retrieval process, tasks with a task handover sequence value of 1 are marked as having no previous state by default, and their previous state parameter value is set to the completed state "1". The previous task state of the remaining tasks is marked as completed if the corresponding state parameter value of the previous task number is "1", or as incomplete if the value is "0". Further comparison is made between the current task number and the corresponding value of the previous task state. For example, if task T5 has a handover sequence of 2 under node N1 and its previous task T4 has a state of "0", the corresponding state field of task T5 needs to be recorded as "incomplete" if the value is "1", or as "completed" if the value is "1". Through the above processing, a task sequence state corresponding set is constructed, with node number as the first index, task number as the second index, task handover sequence as the sorting basis, and previous task state as the judgment condition. For example, under node N2, the task numbers T8, T9, and T10 have handover sequences of 1, 2, and 3, respectively, T8 has a state of "1", T9 has a state of "1", and T10 has a state of "0". The resulting sequence state corresponding set is {T8: completed, T9: completed, T10: incomplete}. Finally, the field binding and state corresponding relationship construction is completed, and the task sequence state corresponding set is obtained.

[0029] The previous task screening submodule identifies the sequence field position corresponding to the current task number based on the task sequence state corresponding set, analyzes the completed state of the sequence field under the same node number, and obtains a set of incomplete previous numbers. First, the task number, node number, task handover sequence field and previous state parameter in each record are extracted from the task sequence state correspondence set, the current processing task number is identified, the sequence field position of the task number under the same node number is identified, the operation is arranged in ascending order according to the task handover sequence field, and the index position of the current task number in the sequence is located, for example, there are tasks T11, T12 and T13 under node number N5, the sequence fields are 1, 2 and 3 respectively, if the current task number is T13, the sequence position is No. 3, then all position records with a task handover sequence field smaller than the current task sequence field are filtered out from the task set of the node, forming a previous task set of the current task, and in the set, task number records with a previous task state parameter not in the completed state are continuously filtered out, that is, records with a state parameter value not equal to 1 are filtered out, the filtering operation is performed according to the Boolean value, if the state field value is 0, it is not completed, if the value is 1, it is completed, only the record item with a state of 0 is retained, for example, the current task T13 is in the sequence field 3 under the node N5, the corresponding previous tasks are T11 and T12, if the state of T11 is 1 and the state of T12 is 0, only T12 is retained as an unfinished previous record, and an unfinished previous number set is obtained.

[0030] The handover delay verification submodule matches the data entry associated with the current task number based on the unfinished previous number set, delays the handover action, and extracts the corresponding path segment and task number data, to obtain a task handover suspension record; First, each unfinished pre-sequence task number in the set is taken as a filter condition, and an index retrieval operation is performed on the task order state corresponding set. The retrieval content is limited to the task records under the same node number. The subsequent task records in the node where each unfinished pre-sequence task number is located are matched, that is, the task number record set after the handover sequence field value of the task number is found. When performing this step, the node numbers need to be grouped, the handover sequence field needs to be arranged in ascending order, and the items need to be matched with the handover sequence value greater than the pre-sequence number. Then, the matched subsequent task number set is marked as the task list that should be delayed for execution. Next, the path segment number information corresponding to these subsequent task numbers is extracted from the node task waiting list. The path segment number and the task number in the field value are bound to form a delay action association pair. Each pair of records contains a task number that needs to be delayed and its corresponding path segment number information. Then, the above delay action association pair is appended to the suspension list. The list takes the combination of task number and path segment number as the primary key. For example, under the current node number N6, the task number T20 is not completed, and its subsequent task numbers are T21 and T22. T21 and T22 need to perform the handover delay operation. The path segment P21 corresponding to T21 and the path segment P22 corresponding to T22 are extracted from the node task list. The suspension records T21-P21 and T22-P22 are constructed and registered in the task handover suspension list. To ensure data consistency and operation correctness, the task numbers that already exist in the suspension list under the same node number are de-duplicated. If there are duplicate records, only the first registered record is retained to avoid the problem of sequence confusion caused by repeated delay processing. At the same time, the handover delay state field value can be set to 1 to indicate that the current task is suspended, and 0 to indicate the normal state. This field can be directly attached to the list structure. Finally, the suspension list is sorted by node number and task handover sequence to obtain the task handover suspension record.

[0031] Specifically, as shown in Figure 2 , 5 The transport rhythm monitoring module includes: The task path extraction submodule extracts the path segment sequence of the corresponding task based on the task number in the task handover suspension record. The arrival time, departure time, and state label content associated with each path segment number are collected. The path segment number is correspondingly matched to the associated time parameter and state label in the time advancing order to obtain a path segment state time mapping table. First, all path segment records associated with the task number are retrieved from the task path data table, and the field contents including path segment number, path segment start node and end node, path segment sequence number in the task are extracted. The sequence field is used to determine the execution position of the path segment in the whole task. Then, all path segment numbers are sorted in ascending order according to the sequence number field to form a path segment sequence. Next, the time information collection operation is performed for each path segment number. The arrival time field and the departure time field of the path segment are extracted from the transportation log or registration information table respectively. The arrival time represents the actual record time of the transportation unit arriving at the start node, and the departure time represents the registration time of the transportation unit leaving the end node. Both fields are converted to time stamps in minute units for sorting and calculation after unified format conversion. If the original data format is hour: minute, such as 09:30, it is converted to 570 minutes to avoid misjudgment due to data format differences. At the same time, the path segment status label field is read. This field is a character variable that reflects the running state of the current path segment. Commonly used values include "not started", "in transit", "completed" and other state enumeration values. The read operation is performed by joint indexing according to the task number and the path segment number to ensure accurate matching without intersection. After collecting the path segment number, arrival time, departure time, and status label fields, a mapping table of path segment number and time state field is established. The mapping process is bound in time sequence, that is, each path segment number is sequentially mapped to its collected arrival time, departure time, and status label field in ascending order of the path segment sequence field in the task execution. For example, the path segment sequence numbers of task T30 are P31, P32, and P33, where the arrival time of P31 is 600 minutes, the departure time is 640 minutes, and the status is "completed". The arrival time of P32 is 650 minutes, the departure time is empty, and the status is "in transit". P33 is empty and the status is "not started". The mapping table records are: P31→600, 640, completed; P32→650, empty, in transit; P33→empty, empty, not started. The default value "-1" is assigned to the data with empty time field for subsequent logic judgment and empty value processing. Finally, the sequence time field and status label corresponding information of all path segment numbers are summarized to obtain the path segment state time mapping table.

[0032] The time sequence scanning submodule is based on the path segment state time mapping table. According to the comparison of adjacent state label corresponding time parameters, the interval is filtered to obtain the path segment number with repeated promotion and promotion skipping in the interval, and the promotion sequence abnormal position set is obtained. First, sort all path segment numbers under the same task number in ascending order of the task path order field to ensure that the scanning order conforms to the actual transportation path advancement process, and then perform a pair-by-pair comparison operation on the time advancement between adjacent path segments. The operation content is to read the departure time of the first path segment and the arrival time of the second path segment in each pair of adjacent path segments, calculate the time difference between the two as the advancement interval, which is in minutes, and use its value to judge whether there is an abnormal advancement situation in the subsequent advancement. If the advancement interval between a pair of path segments is negative, it means that the subsequent path segment record time is earlier than the departure time of the previous path segment, which is a repeated advancement. If the advancement interval is greater than the preset reasonable advancement upper limit value, it means that the interval time between the two path segments is too long, and there may be an abnormal advancement behavior of skipping path segments. The advancement upper limit value needs to be set according to the actual average interval of the transportation task. For example, if the standard interval is 60 minutes, set the advancement upper limit to 90, which means that more than 1.5 times the normal advancement interval is considered as a skipping behavior. In the judgment process, the above time interval calculation and comparison operation need to be performed for each pair of path segments, and the state label field needs to be verified at the same time. If the state label record is "not shipped" but the time field has been filled in, it is considered as a logical repeated advancement error. Conversely, if the state label record is "completed" but the corresponding departure time field is empty, it is marked as a missing advancement record. The abnormal records obtained through the above judgment are numbered and extracted, and the path segment numbers with abnormal advancement behavior are added to the preliminary advancement abnormality set. To avoid misjudgment due to time collection errors, when judging repeated advancement, set the repeated advancement threshold to be less than zero or between zero and five minutes, and the state label conflict must be established at the same time. The skipping behavior must satisfy the interval time exceeding ninety and the subsequent path segment state label not being "not shipped". For example, in task T40, path segment P41 has a departure time of 680, P42 has an arrival time of 670, and the state is "in transit". The advancement interval is negative ten, which is determined as repeated advancement. P43 is the next path segment, with an arrival time of 810 and an empty departure time of P42, the interval exceeds the reasonable advancement upper limit, and the state is "completed". Therefore, P42 and P43 are both advancement abnormality records. Finally, all abnormal path segment numbers are extracted to form a set, and the advancement sequence abnormal position set is obtained.

[0033] The rhythm abnormality labeling submodule locates the abnormal path segment number task paragraph based on the advancement sequence abnormal position set, matches the corresponding information according to the association between the path segment number and the task number, and obtains a path segment rhythm abnormality identification table. First, take the abnormal position of each path segment number as the retrieval starting point, perform joint matching operation on path segment state time mapping table and task path information table, match action takes path segment number as the primary key, and realizes positioning by comparing path segment number with the number field stored in the record table, when the path segment number is located, read the task number field stored in the record, the field is character type identifier, such as "T50" "T32" and so on, used to indicate the task subject to which the path segment belongs, then execute reverse query operation with the task number as the key, retrieve the complete path segment sequence corresponding to the task number in the task path record set, and confirm the relative position of the abnormal path segment in the task path sequence, the confirmation action is realized by comparing the sequence field of the path segment number in the sequence, for example, the path segment sequence of task T50 is {P501, P502, P503, P504}, if the abnormal path segment is P503, its sequence field is No. 3, after confirming its position, read the time field and state label field corresponding to the path segment number, perform null judgment action on the arrival time and departure time two fields, the judgment content is that if the field value is "-1" or empty string, the record is empty, otherwise the record is normal, the state label field directly reads the character type label, such as "in transit" "completed" "not started", after the above reading, the path segment number, task number, sequence field, time field and state label five contents are collected to form an abnormal path segment record, then write the current record into the rhythm abnormal identifier set, in order to ensure that there is no repeated path segment number record in the set, perform repetition check action before writing, compare the path segment number to be written with the existing number in the set, if it exists, skip this writing, if it does not exist, perform writing operation, the writing action sequence follows the ascending order arrangement logic of node number and task sequence field, for example, if the set already has P401, P305, and the current writing is P360, P360 needs to be inserted after P305 and before P401 according to the value size, the whole processing process does not call any external method, but depends on three types of basic actions of field by field comparison, character and number mixed comparison and repetition check, the example data is abnormal position set {P31, P42}, through retrieval, P31 belongs to task T30, the sequence position is the first segment, the time field is 600 arrival and 640 departure, the state is "completed", so the record is marked as {P31, T30, 1, 600, 640, completed}, similarly, P42 belongs to task T40, the time interval has been identified as abnormal in the previous text, so extract {P42, T40, 2, 670, empty, in transit}, write the two records into the abnormal identifier set according to the path segment number, finally get the path segment rhythm abnormal identifier table.

[0034] Specifically, as shown in Figure 2 , 6 , the state gap completion module comprises: The time field extraction submodule extracts the adjacent state label time field and the node placeholder label field in the advancing sequence based on the path segment number in the path segment rhythm anomaly identification table, aligns the time content corresponding to the state label under the same path segment number in the advancing order, synchronizes the node placeholder label field after alignment, and obtains a state time placeholder corresponding table; Firstly, the record content of the abnormal identifier table is read item by item, and the path segment number, task number, sequence field, arrival time, departure time, state label and node placeholder label field are extracted. Each field is confirmed to be valid through string comparison and value comparison. Then, the path segment number is taken as the retrieval primary key, and a matching action is performed in the task path segment state time mapping dataset. The matching action is realized by comparing whether the path segment number fields in the two datasets are completely consistent. Once the matching is successful, the adjacent path segment records of the path segment in the promotion sequence are read, and the state label value and time field value of the adjacent records are extracted. The index position of the adjacent record is realized by adding or subtracting one from the sequence field. For example, if the current path segment sequence field is 3, the adjacent path segment indexes are sequence field 2 and sequence field 4, respectively. After extracting the adjacent records, a logical judgment action is performed on the time field of the adjacent records. First, it is judged whether the time field is a null value identifier "-1". If it is null, it is identified as a missing time. If it is not null, the original value is read and converted into an integer value in minutes, which is used for subsequent promotion sequence calculation. The state label of the adjacent record is read for sequence alignment action. The alignment action is to form a time sequence alignment matrix according to the promotion sequence of the state label, arrival time and departure time of the current path segment and the adjacent path segment. The matrix is arranged in ascending order of the sequence field. For example, if the path segment P31 has a sequence field of 1, its adjacent record is P32 with a sequence field of 2, then the matrix sequence is {P31, P32}. After the alignment is completed, the node placeholder label field is synchronized to the corresponding row of the alignment matrix. The node placeholder label is a character type content, such as "N1", "N2", etc. According to the sequence position of the path segment in the path, the current path segment placeholder label is directly recorded in the corresponding row of the current path segment, and the adjacent path segment placeholder label is read from the task path mapping table and filled in the corresponding row. The synchronization action is completed through row-by-row comparison of the path segment number. Then, consistency check is performed on each row of the matrix. The check content is whether there is a conflict between the state label and the time field. For example, the state is "not started" but the time field is not empty, or the state is "completed" but the departure time is empty. The row record is marked with an abnormal value "X" if there is a conflict, and marked with "O" if there is no conflict. Through the above processing, the path segment state time placeholder corresponding table original record structure is constructed. Then, the multiple sequences of the same path segment number are de-duplicated. The de-duplication is based on the path segment number and sequence field combination key. If the sequence fields of two records are the same, the first appearing record is retained, and the second record is deleted. In the example, if there are two duplicate records of path segment P42, and their sequence fields are both 2, the first record is retained and the second record is deleted. Finally, the alignment matrix records of all path segment numbers are sorted according to the task number and sequence field, and then summarized to obtain the state time placeholder corresponding table.

[0035] The advance time blank segment positioning submodule is based on the state time placeholder correspondence table. According to the advance order, it compares the time field of each group of state tags, filters the skipped and repeated parts in the time field, and locates the position in the tag sequence to obtain the advance time blank segment set. First, sort all path segment records under the same task number according to the order field from smallest to largest. After sorting, perform a progress time series comparison operation on each group of records. Each group of records includes path segment number, arrival time, departure time, status label, and node placeholder label. The arrival time and departure time need to be converted to integer values ​​in minutes. If the field is empty or "-1", the record is considered missing. During the progress order comparison, the difference between the departure time of the current path segment and the arrival time of the next path segment is calculated. If the difference is negative, it indicates that the progress logic order is incorrect. If the difference is greater than the reasonable maximum progress interval, it is marked as skipping the progress behavior. The reasonable maximum progress interval is set with reference to the average progress interval of the path segment, which is 90 minutes. That is, if the departure time of a certain segment is 670 minutes and the arrival time of the next segment is 780 minutes, the interval is 110 minutes. If it exceeds the set value, it is judged as skipping the segment progress. When comparing the status label sequence, if the status labels of two consecutive path segments are both "not started" or both are "completed", and the corresponding time field has not changed, the progress will be skipped. Changes are marked as repeated advancements. The criteria for judging repeated advancements in the time field are that the departure time of the current path segment is the same as the departure time of the previous path segment, or the arrival time of the current path segment is the same as the arrival time of the previous path segment, and the status label record is not updated. In this case, it is considered a repeated advancement in the time field. Locate the sequence position of these abnormal advancement records, record their sequence field position through the index value, and extract the current path segment number and the task number to form a record unit. If the empty segment behavior is a segment skip, the additional field is marked as "segment skip"; if it is a repeated advancement, it is marked as "repeated". In the example, if the path segment sequence of task T60 is P61, P62, P63, and the time fields are arrival 600, departure 630, P62 arrival 631, departure 630, and P63 arrival 760, departure 790, then P62 has a logical error that the arrival is later than the departure. The advancement interval of P63 is 130 minutes, which exceeds the set value, and it is marked as a segment skip behavior. Record its sequence field 3 and path segment number P63, and finally obtain the set of advancement time blank segments.

[0036] The placeholder label insertion submodule extracts the node placeholder label field at the corresponding position based on the set of blank segments in the advancement time. It fills the placeholder labels into the time field column in order according to the position of the blank segment, and updates the content of the continuous status labels under the corresponding path segment to obtain the status placeholder mark record book. First, take each record in the blank section set as the starting point of operation, read the path segment number, order field, exception type mark (skip or repeat) and the task number to which it belongs. Then, use the task number as an index to retrieve the complete progress sequence of the task from the state time placeholder table. When retrieving, compare the task number with the order field to ensure matching. After positioning, read the corresponding node placeholder label field (such as "N3" "N5" etc.) to identify the logical position of the path segment in the node hierarchy. According to the order field of the current blank segment, perform the placeholder insertion operation. If the exception type is skip, insert a new placeholder record between the previous order number and the current number of the path segment. The inserted record inherits the node placeholder label of the previous record and fills in the arrival time or departure time field position, forming a blank placeholder mark. For example, if the order field of path segment P71 in task T70 is 1, P72 is 3, and P72 is a skip segment, insert record P72' at the position with order field 2 and assign it the same node label "N4" as P71. If the exception type is repeat progress, copy the node placeholder label of the record below the current record and set the corresponding time field to "-1" to distinguish the original record, indicating state repetition. After insertion, update the state label field of the path segment: if the insertion position is blank, set the state label to "placeholder", and the subsequent state labels are assigned in sequence to ensure the consistency of the overall progress sequence. For example, if the original state sequence is {completed, in transit, not shipped}, after inserting the placeholder record, it becomes {completed, placeholder, in transit, not shipped}. Then, sort the complete progress records in ascending order based on the order field. To avoid affecting the sorting logic due to the inserted record, if the inserted record uses a virtual order field, assign it a floating point number between adjacent integers (e.g. 2.5 if the original is 2). Keep this value during sorting and avoid converting it to an integer to prevent confusion or overwrite with the original path segment, ensuring that the inserted record retains its "placeholder" property. After sorting, check for duplicate path segment numbers. If there are any, keep only the first occurrence and delete the subsequent duplicates. Finally, integrate all path segment records of the task to construct the state placeholder mark record book, and arrange it in ascending order based on the task number and order field to obtain the state placeholder mark record book.

[0037] Specifically, as shown in Figure 2 、 7 the label progress adjustment module includes: The tail segment label extraction submodule extracts the number of labels in the tail segment of the state label sequence in each path segment based on the state placeholder mark record book, and collects the capacity field of the corresponding path segment. The label capacity correspondence list is obtained by corresponding the label quantity and the capacity field to the path segment number respectively; First, take each path segment number in the record book as the retrieval starting point, read its subordinate state label sequence one by one, the sequence is composed of several state labels arranged in the order of advancement, for example {completed, in transit, placeholder, placeholder}, {in transit, not shipped, not shipped} and so on, then perform the tail segment interception action on the sequence, which takes the end position of the sequence as the starting point and reads the state label one by one, during the reading process, it judges whether each label is the same as the previous one, the judgment method is to compare the current label with the previous one by string equivalence, if they are the same, the count is increased by one, if they are not the same, the reading is stopped immediately and the tail segment length count is completed, the count is the number of tail segments, for example, the tail segment of the sequence {completed, in transit, placeholder, placeholder} is two placeholder labels, so the tail segment number is 2, the sequence {in transit, not shipped, not shipped} tail segment is two not shipped labels, so the count is 2, record the tail segment number to the tail segment count field of the corresponding path segment, then retrieve the capacity field from the transport path segment attribute table using the path segment number as the index, the capacity field is an integer value record, for example 20, 35, 50 and so on, reflecting the amount of tasks that the path segment transport unit can carry, the retrieval action is achieved by matching the path segment number field, if the capacity field is empty or not found, record the default capacity "0" and mark it in the subsequent processing, then perform the one-to-one action on the tail segment count field and the capacity field, the corresponding action is achieved by building key-value pairs, using the path segment number as the key, and the tail segment number and the capacity field as the value to form a two-tuple, for example, the tail segment number of path segment P81 is 2 and the capacity field is 30, then record {P81:(2,30)}, after generating all path segment two-tuples, sort the path segment numbers in ascending order to ensure the consistency of the output order, sort by comparing the numbers after removing the letters, for example, P9 is 9 and P10 is 10, to avoid the order error caused by character sorting, after sorting, perform the capacity interval determination action on each record, the interval determination is based on the capacity field value, the capacity interval is divided into three levels: 0 to 20 is the low capacity interval, 21 to 50 is the medium capacity interval, and 51 and above is the high capacity interval, the interval division is achieved by comparing the capacity field value with the upper and lower limits of the interval, for example, the capacity field value 30 belongs to the medium capacity interval, but the interval division is only used for record labeling and does not affect the tail segment number record itself, then record the path segment number, tail segment number and capacity field in the list structure in a unified format, for example, the tail segment label number of path segment P91 is 3 and the capacity field is 45, then the list record is {P91:3,45}, all path segment records are written into the final list in the order of sorting to obtain the label capacity corresponding list.

[0038] The pushing position writing submodule filters the path segment number whose tail segment label quantity is inconsistent with the capacity field based on the label capacity corresponding list, extracts the corresponding tail segment label content, and writes it into the first label sequence of the next path segment according to the pushing order to obtain the path label pushing update set; First, the difference filtering action is performed with each path segment number in the list as the starting point. The filtering action is completed by performing a numerical comparison operation on the tail segment label quantity field and the capacity field. The comparison method is to judge the size of the tail segment label quantity and the capacity field. If they are not equal, it is determined that the path segment number needs to enter the pushing writing process. If they are equal, the record is skipped and does not enter subsequent processing. After filtering out the path segments that need to be processed, the complete state label sequence of the corresponding path segment is extracted from the state placeholder record book using the path segment number as the index. The extraction action is realized by comparing whether the path segment numbers are consistent. The sequence read is usually a number of string labels arranged in pushing order, such as {completed, placeholder, placeholder}, {not started, not started, in transit, placeholder}, etc. Then the tail segment extraction action is performed. This action starts from the end of the sequence and records all consecutive and identical tail segment label values. For example, the sequence {not started, not started, in transit, placeholder, placeholder} has two consecutive placeholder labels at the end, and the tail segment label content is {placeholder, placeholder}. After the extraction is completed, the tail segment label is written into the first label sequence of the next path segment according to the pushing order. The positioning method of the next path segment is to position to the next numbered path segment record position by adding the current path segment order field. Then the tail segment label content is inserted into the front end of the label sequence one by one. The insertion action is to append a string to the head of the sequence to maintain the logical coherence of the pushing. For example, the tail segment of path segment P101 is two placeholder labels, and the original sequence of the next path segment P102 is {in transit, not started}. After insertion, the sequence becomes {placeholder, placeholder, in transit, not started}. After the insertion action is completed, the length of the entire sequence needs to be corrected. The correction method is to limit the maximum length of the sequence according to the capacity field. If the length after insertion is greater than the capacity field value, the redundant labels are deleted from the end to ensure that the sequence is consistent with the capacity field. For example, if the capacity is 3 and the sequence length is 4, the last item is deleted. Then the label consistency processing is performed. The continuous label inserted is marked as "write" state for subsequent judgment by performing a continuous identification assignment action, and the sequence and label state of the path segment are updated in the record book. After the update is completed, the pushing writing record unit is constructed. The record content includes the path segment number, the updated label sequence, the tail segment label quantity, the capacity field, the write label quantity, and the write position index value. The write position index value is determined by the insertion order. For example, if two labels are written, the position index is {1, 2}. Finally, the pushing writing records of all path segments are sorted according to the numerical part of the path segment number, for example, P9 is prior to P10. After the sorting is completed, the overall record set is output to obtain the path label pushing update set.

[0039] The instruction field generation submodule updates the set based on the path label, extracts the transportation task identification field and path node field associated with each label, and corresponds the fields with the path segment number according to the task number to obtain the multimodal transport task path coordination instruction set. First, the label field extraction operation is performed on each record in the update set, the content of each inserted or updated label in the label sequence is read, and the corresponding path segment number of the label in the record is extracted, then the corresponding transportation task identification field is retrieved in the path segment attribute table with the path segment number as the index, the field is a string type, indicating the transportation task number to which the path segment belongs, such as "T301", "T305", etc., the retrieval action is matched by comparing the path segment number with the records in the attribute table one by one, after successful matching, the task number of the path segment is read, and the start node number and end node number fields are read synchronously as the path node field, which is used to describe the upstream and downstream information of the operation node during instruction execution, such as start node "N5" and end node "N6", after the field extraction is completed, the field triple is constructed, the format is {path segment number, transportation task number, node field group}, the node field group records the ordered combination of the start node number and the end node number, and the above triple records are classified and archived with the transportation task number as the primary key, the archiving action is to aggregate multiple path segment triplets under the same transportation task number into a task path field set, the set content is arranged in the path segment promotion order, for example, the triple records under task T305 are {P501, T305, N2→N3}, {P502, T305, N3→N4}, the set order is [P501→N2→N3, P502→N3→N4], the sorting order is realized according to the promotion order field of each path segment in the update set, after sorting, the field combination action is performed in each task path field set, the field combination method is to construct each triple into a scheduling instruction format, the format is: "task number: path segment number, start→end", for example, "T305: P501, N2→N3", all the combined instructions are classified and arranged according to the task number to form multiple independent scheduling instruction groups, the path segment number is arranged in ascending order in the group, then all the instructions are combined into a unified instruction set, the duplicate path segment number records are processed to remove the remaining entries, ensuring that each path segment only appears in one task number instruction, finally, the complete field encapsulation is completed, the scheduling execution instruction record with consistent format, complete content field and clear path promotion order is generated, and the multimodal transport task path coordination instruction set is obtained.

[0040] The above merely illustrates the specific embodiments of the present application, but the protection scope of the present application is not limited thereto, any person skilled in the art can easily think of the changes or replacements within the technical range disclosed by the present application, which should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A multimodal transport logistics collaborative management and control system, characterized in that the system... include: The task triggering coordination module obtains the list of transportation task path segments, task initiation time and node departure registration time, compares the time sequence with the corresponding task number and path segment number and analyzes the scheduling synchronization, extracts unfinished scheduling items, and obtains the node task waiting list. Based on the node task waiting list, the handover sequence constraint module compares the execution order and status of the current task with the previous task, and stops the handover of the current task if the status of the previous task is not updated, thus obtaining a task handover suspension record. Based on the task handover and suspension records, the transportation rhythm monitoring module compares the path segment sequence, arrival and departure times with the progress time sequence to identify discontinuous path segments and obtains a path segment rhythm anomaly identification table. The status gap completion module identifies time gaps in the status label time field and the placeholder label field based on the path segment rhythm anomaly identifier table, writes the placeholder label into the blank time period, and obtains the status placeholder mark record book. The tag advance adjustment module compares the number of tail tags with the path segment capacity field based on the status placeholder mark record book. Where the number is inconsistent, it writes the tail tag to the next path segment to obtain the multimodal transport task path coordination instruction set.

2. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The node task waiting list includes the task number of the unmatched scheduling, the path segment number of the unmatched scheduling, the node number, and the departure time sequence information. The task handover suspension record includes the current task number, the corresponding intermodal node number, the preceding task number, and the unfinished status marker. The path segment rhythm anomaly identifier table includes the path segment number of repeated progress and time skipping, the associated task segment number, and the progress anomaly type identifier. The status placeholder marker logbook includes the path segment number, status label order, anomaly interval area, and inserted placeholder label field. The multimodal transport task path coordination instruction set includes the tail status label sequence, the path segment capacity field, the starting node path segment combination, and the transport task identifier field.

3. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The incomplete scheduling items refer to the task numbers and path segment numbers that have not yet been responded to in the current scheduling instructions; The preceding task status refers to the completion status of tasks preceding the current task in the task handover sequence, determining whether the current task can continue to be executed.

4. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The discontinuous path segment refers to a path segment in which the progress rhythm is discontinuous due to abnormal status label time field during the task path advancement process; The blank time period refers to the gap in the time field in the task path caused by missing progress time or incomplete status labels.

5. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The task triggering coordination module includes: The path segment sequence parsing submodule obtains the list of path segments, task initiation time and node departure registration time of the current batch of transportation tasks, reads the task number corresponding to each path segment, and matches the task number and path segment number according to the time sequence to obtain the result corresponding to the task path segment number. The scheduling instruction synchronization discrimination submodule, based on the result corresponding to the task path segment number, compares the path segment number included in the scheduling instruction with the result of the result, analyzes whether the path segment number corresponding to the task number appears in the scheduling instruction, and obtains a set of non-responding scheduling tasks. The node task list extraction submodule, based on the set of unresponsive scheduling tasks, registers the start time of the path segment number node, associates the task number with the path segment number information according to the node number, and obtains the node task waiting list.

6. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The handover sequence constraint module includes: The node field extraction submodule extracts the intermodal node number, task handover sequence field and previous task status parameter based on the node task waiting list. It reads the field content corresponding to each task number and matches the task numbers under the same node number with the sequence field and status parameter to obtain the task sequence status correspondence set. The preceding task screening submodule identifies the position of the sequence field corresponding to the current task number based on the task sequence status correspondence set, analyzes the completion status of the sequence field under the same node number, and obtains the set of incomplete preceding numbers. The handover delay verification submodule, based on the set of unfinished preceding sequence numbers, matches the data entries associated with the current task number, postpones the handover action, and extracts the corresponding path segment and task number data to obtain the task handover suspension record.

7. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The transportation rhythm monitoring module includes: The task path extraction submodule extracts the path segment sequence of the corresponding task based on the task number in the task handover and suspension record, collects the arrival time, departure time and status label content associated with each path segment number, and maps the path segment number to the associated time parameter and status label in the order of time progression to obtain the path segment status time mapping table. The time series scanning submodule, based on the path segment status time mapping table, compares the advancement interval according to the time parameters corresponding to adjacent status labels, and filters the path segment numbers that have repeated advancement and advancement skipping in the advancement interval to obtain the set of abnormal positions in the advancement sequence. The rhythm anomaly labeling submodule locates the abnormal path segment number task segment based on the set of abnormal locations in the advancement sequence, matches the corresponding information according to the association between the path segment number and the task number, and obtains the path segment rhythm anomaly identification table.

8. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The state gap completion module includes: The time field extraction submodule extracts the time field of adjacent status labels and node placeholder label fields in the advancement sequence based on the path segment number in the path segment rhythm anomaly identifier table. It aligns the time content of the status labels under the same path segment number according to the advancement order, and then synchronizes the node placeholder label fields to obtain the status time placeholder correspondence table. The advance time blank segment positioning submodule, based on the state time occupancy correspondence table, compares the time field of each group of state tags according to the advance order, filters the skipped and repeated parts in the time field, and locates the position in the tag sequence to obtain the advance time blank segment set; The placeholder label insertion submodule extracts the node placeholder label field at the corresponding position based on the set of blank segments in the advancement time, fills the placeholder labels into the time field column in order according to the position of the blank segment, and updates the continuous status label content under the corresponding path segment to obtain the status placeholder mark record book.

9. The multimodal transport logistics collaborative management and control system according to claim 8, characterized in that, During the process of the time field of each group of status labels in the status time placeholder table, the time fields of adjacent status labels under the same path segment number are compared in time order to locate the discontinuous position as the content of the advancement time blank segment. During the process of setting up the node placeholder label field for each position in the time blank segment, the node placeholder label field that matches the path segment number is located in the status time placeholder correspondence table by indexing the path segment number. During the process of filling in the time field column, the node placeholder label fields are written into the corresponding blank positions in the time field column in the order of advancement. After writing, the status label content in the status time placeholder corresponding table is updated synchronously, and the updated content is saved to the status placeholder mark record book.

10. The multimodal transport logistics collaborative management and control system according to claim 1, characterized in that, The label propulsion adjustment module includes: The tail tag extraction submodule extracts the number of tags at the tail of the state tag sequence in each path segment based on the state placeholder mark record book, and collects the capacity field of the corresponding path segment. The tag number and capacity field are respectively mapped to the path segment number to obtain the tag capacity corresponding list. The advance position writing submodule, based on the tag capacity corresponding list, filters the path segment numbers where the number of tail tags does not match the capacity field, extracts the corresponding tail tag content, and writes the first and second tag sequences of the next path segment in the advance order to obtain the path tag advance update set; The instruction field generation submodule advances the update set based on the path tags, extracts the transportation task identifier field and path node field associated with each tag, and matches the fields with the path segment numbers according to the task number to obtain the multimodal transport task path coordination instruction set.

Images