A logistics vehicle drop and pull scheduling method

Abstract

Embodiments of the present application relate to a logistics vehicle drop and pull scheduling method, comprising: obtaining the current state of each electric vehicle in the transfer field and the oil vehicle queuing queue corresponding to each gantry, and the oil vehicles in each oil vehicle queuing queue are arranged according to the time of entering the queue; selecting a target electric vehicle in an idle state from the electric vehicles; for each target electric vehicle, in all oil vehicle queuing queues, based on the time stamp recorded when the oil vehicle enters the queue, determine the target oil vehicle with the smallest time stamp; match the target electric vehicle with the target oil vehicle, and determine the gantry to which the target oil vehicle belongs as the working position to generate a drop and pull scheduling instruction. The original local queue allocation is changed to global unified selection, thereby avoiding the problem of uneven waiting time between different queues; the matching is triggered by the electric vehicle, so that the scheduling process can be executed immediately when the electric vehicle is idle, the idle time of the electric vehicle is reduced, and the collaborative scheduling between the oil vehicles, electric vehicles and gantries is realized.

Description

Technical Field

[0001] This application relates to the field of logistics scheduling and transportation management technology, and in particular to a method for scheduling logistics vehicles by swapping trailers. Background Technology

[0002] In the logistics transportation process, transshipment yards serve as crucial nodes connecting trunk line transportation and regional distribution. They typically require the swapping of fuel trucks and trolleybuses to achieve efficient cargo transfer. In actual operation, transshipment yards are usually equipped with multiple gantry cranes as operating positions, with multiple fuel trucks and trolleybuses working together simultaneously.

[0003] In existing technologies, after fuel trucks enter the transfer station, they are usually allocated based on manual experience or local queuing rules. The matching between trolley trucks and fuel trucks largely depends on the dispatcher's manual judgment or simple queue order. This method has the following problems: First, since the queues corresponding to each gantry are independent, the dispatching process is often based on a single queue, which can easily lead to some queues having long waiting times while other queues are not fully utilized, resulting in uneven overall resource allocation. Second, in the case of multiple trolley trucks operating concurrently, the lack of a unified matching mechanism can easily lead to duplicate allocations or dispatching conflicts, thereby affecting operational efficiency.

[0004] Furthermore, existing scheduling methods typically make decisions based on the current queue state, lacking a unified consideration of the overall system state and the ability to predict future queue changes, making it difficult to adapt to the dynamic environment of constantly changing vehicle and equipment states in transfer stations. At the same time, the scheduling process often focuses only on operational efficiency, neglecting the energy consumption of fuel trucks while they wait, which can easily lead to prolonged idling and increased energy consumption.

[0005] Therefore, how to achieve a reasonable match between fuel trucks, electric trucks and work positions in complex scenarios with multiple gantry cranes and multiple vehicles, improve overall scheduling efficiency while ensuring fairness, and take into account the stability of system operation and energy consumption control, has become a technical problem that urgently needs to be solved in this field. Summary of the Invention

[0006] One objective of this application is to provide a method for dispatching logistics vehicles by swapping trailers, which at least solves the above-mentioned problems.

[0007] To achieve the above objectives, some embodiments of this application provide a method for scheduling logistics vehicles by swapping trailers, including:

[0008] Obtain the current status of each electric vehicle in the transfer yard and the oil truck queue corresponding to each gantry, wherein the oil trucks in each oil truck queue are arranged according to the order of their entry into the queue;

[0009] Select target trams that are currently idle from the trams;

[0010] For each target electric vehicle, among all the oil vehicle queues, the target oil vehicle with the smallest timestamp is determined based on the timestamp recorded when the oil vehicle enters the queue.

[0011] The target electric vehicle is matched with the target oil truck, and the gantry to which the target oil truck belongs is determined as the working position to generate a trailer swapping dispatch instruction.

[0012] Compared with related technologies, the solution provided in this application obtains the status of each trolley in the transfer yard and the queuing queues of multiple gantry cranes. Idle trolleys then globally select from all queuing queues based on timestamps, allowing them to directly match the trolley with the earliest entry time. Since the timestamp corresponds to the actual time the trolley entered the queue, the determined target trolley is the one with the longest waiting time globally. This method transforms the original local queue allocation into a globally unified selection, thereby avoiding uneven waiting times between different queues, balancing the waiting time of each trolley, and significantly reducing the ineffective waiting caused by long queues.

[0013] Meanwhile, this scheduling method is triggered by the trolley itself, enabling the scheduling process to be executed immediately when the trolley is idle, thereby reducing trolley idle time and improving operational continuity, ultimately achieving coordinated scheduling between the oil tanker, trolley, and gantry.

[0014] This embodiment is not a simple optimization of scheduling rules, but rather a system-level improvement that addresses the problems of uneven waiting times for fuel vehicles and unbalanced resource utilization by constructing a timestamp-based global queue selection mechanism and a matching method for trolley-driven systems. Attached Figure Description

[0015] One or more embodiments are illustrated by way of example with reference numerals in the accompanying drawings. These illustrations do not constitute a limitation on the embodiments. Elements with the same reference numerals in the drawings are denoted as similar elements. Unless otherwise stated, the figures in the drawings are not to be limited by scale.

[0016] Figure 1 This is a flowchart of the method provided in the embodiments of this disclosure;

[0017] Figure 2 This is a flowchart of the target fuel vehicle determination process provided in the embodiments of this disclosure;

[0018] Figure 3 This is a partial flowchart of the tram dispatching process provided in the embodiments of this disclosure. Detailed Implementation

[0019] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0020] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this disclosure are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate for the embodiments of this disclosure described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0021] In this disclosure, the terms "upper," "lower," "inner," "middle," "outer," "front," and "rear," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. These terms are primarily for better description of the embodiments of this disclosure and their implementations, and are not intended to limit the indicated devices, elements, or components to having a specific orientation, or to require them to be constructed and operated in a specific orientation. Furthermore, some of the aforementioned terms may be used to indicate other meanings besides orientation or positional relationship; for example, the term "upper" may in some cases indicate a dependency or connection relationship. Those skilled in the art can understand the specific meaning of these terms in the embodiments of this disclosure according to the specific circumstances.

[0022] Furthermore, the terms "set up," "connect," and "fix" should be interpreted broadly. For example, "connection" can be a fixed connection, a detachable connection, or an integral structure; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, or it can be an internal connection between two devices, components, or parts. Those skilled in the art can understand the specific meaning of the above terms in the embodiments of this disclosure according to the specific circumstances.

[0023] Unless otherwise stated, the term "multiple" means two or more.

[0024] In this embodiment of the disclosure, the character " / " indicates that the objects before and after it are in an "or" relationship. For example, A / B means: A or B.

[0025] The term "and / or" describes an association between objects, indicating that three relationships can exist. For example, A and / or B means: A or B, or A and B.

[0026] It should be noted that, unless otherwise specified, the embodiments and features described in the present disclosure can be combined with each other.

[0027] In existing technologies, logistics transfer stations typically employ scheduling methods based on a single queue or human experience. The matching of electric vehicles and gasoline vehicles relies on local information, resulting in some gasoline vehicles waiting for a long time while other queue resources are not fully utilized, leading to a significant problem of uneven resource allocation.

[0028] Combination Figures 1 to 3 As shown in the embodiments of this disclosure, a method for dispatching logistics vehicles by swapping trailers includes:

[0029] S1: Obtain the current status of each trolley in the transfer yard and the oil truck queue corresponding to each gantry. The oil trucks in each queue are arranged according to the time they entered the queue.

[0030] S2: Select target trams that are idle from the trams;

[0031] S3: For each target electric vehicle, in all the oil vehicle queues, determine the target oil vehicle with the smallest timestamp based on the timestamp recorded when the oil vehicle entered the queue.

[0032] S4: Match the target electric vehicle with the target oil truck and determine the gantry to which the target oil truck belongs as the working position to generate a trailer swapping dispatch instruction.

[0033] The logistics vehicle swapping scheduling method provided in this embodiment acquires the status of each trolley in the transfer yard and the queuing queues of fuel trucks corresponding to multiple gantry cranes. Idle trolleys then globally select from all fuel truck queues based on timestamps, allowing them to directly match the fuel truck that entered the queue earliest. Since the timestamp corresponds to the actual time the fuel truck entered the queue, the determined target fuel truck is the one with the longest waiting time globally. This method transforms the original local queue allocation into a globally unified selection, thereby avoiding uneven waiting times between different queues, balancing the waiting time of each fuel truck, and significantly reducing the ineffective waiting caused by long queue times.

[0034] Meanwhile, this scheduling method is triggered by the trolley itself, enabling the scheduling process to be executed immediately when the trolley is idle, thereby reducing trolley idle time and improving operational continuity, ultimately achieving coordinated scheduling between the oil tanker, trolley, and gantry.

[0035] This embodiment is not a simple optimization of scheduling rules, but rather a system-level improvement that addresses the problems of uneven waiting times for fuel vehicles and unbalanced resource utilization by constructing a timestamp-based global queue selection mechanism and a matching method for trolley-driven systems.

[0036] In this embodiment, the timestamp is the time parameter recorded when the oil tanker enters the oil tanker queue.

[0037] In existing scheduling systems, time parameters often come from inconsistent sources, such as entry time or manually recorded time, which can easily lead to inconsistent sorting results and thus affect scheduling accuracy.

[0038] This embodiment unifies the time base of all fuel trucks to the moment they enter the fuel truck queue by limiting the timestamp to the time recorded when the truck enters the scheduling queue. Since this time parameter directly reflects the time when the fuel truck enters the waiting state, it can accurately reflect the queuing waiting time. Comparison based on this unified timestamp avoids sorting deviations caused by different time sources, thus ensuring the certainty and consistency of the scheduling results. A smaller timestamp indicates an earlier entry time into the queue.

[0039] In this embodiment, the oil trucks in the oil truck queue are those that have not yet been matched with the electric vehicles.

[0040] By limiting the fuel truck queue to fuel trucks that have not yet been matched with trams, the objects participating in the scheduling calculation are limited to valid fuel trucks awaiting execution. This limitation avoids the duplicate allocation of matched fuel trucks, ensuring that each match corresponds to a new task, thereby improving the accuracy of the scheduling process and reducing conflicts.

[0041] In some embodiments, when determining the target oil car for each target trolley, it is done only in the oil car queue corresponding to the gantry in normal condition.

[0042] In actual transshipment operations, some gantry cranes may be unavailable due to malfunctions or maintenance. If they are still involved in scheduling, the matching results will be unexecutable. This embodiment limits the determination of target oil trucks to the oil truck queue corresponding to gantry cranes that are in normal working order. This ensures that the scheduling process is only performed on gantry cranes with operational capabilities, thereby avoiding the allocation of electric vehicles to locations where swapping operations cannot be performed. This method improves the executability of scheduling results and reduces duplicate scheduling or task rollbacks caused by equipment malfunctions.

[0043] Optionally, after matching the target electric vehicle with the target fuel vehicle, the target fuel vehicle is removed from the corresponding fuel vehicle queue.

[0044] By removing the target fuel truck from its queue after matching it with a trolley truck, the queue status can reflect the actual situation of fuel trucks awaiting dispatch in real time. This process ensures that subsequent dispatch calculations are based on the updated queue, thereby avoiding duplicate matching and improving the stability of the system.

[0045] In some embodiments, after matching the target trolley with the target oil truck, the state of the target trolley is updated to a pending swapping state, changing the trolley from a "scheduling resource" to an "execution resource". This method can prevent trolleys from being repeatedly involved in scheduling at the same time, thereby avoiding task conflicts and improving the state consistency of the scheduling system.

[0046] In some embodiments, after matching the target trolley with the target fuel truck, the matching relationship between the target trolley and the target fuel truck is recorded, enabling the scheduling results to be continuously tracked by the system and providing data for subsequent job execution, status updates, and anomaly handling. This method not only improves the traceability of the scheduling process but also provides basic data support for subsequent system optimization and analysis.

[0047] In some embodiments, after a target trolley is matched with a target fuel vehicle, rematching of the target fuel vehicle with other trolleys is restricted.

[0048] By restricting other trolleys from matching a target trolley with a target fuel car after the target trolley is matched, the fuel car immediately enters an occupied state after matching. This method effectively prevents duplicate allocation and ensures that each fuel car corresponds to only one trolley, thereby improving the consistency and reliability of the dispatching system.

[0049] In some embodiments, selecting target trams that are in an idle state includes: acquiring trams whose current state is a preset idle state as target trams.

[0050] By selecting trolleys in a pre-defined idle state as target trolleys, all trolleys participating in the dispatching process are equipped with the ability to immediately perform tasks. This method avoids ineffective allocation, improves the efficiency of dispatching instructions, and reduces dispatching delays.

[0051] Optionally, the process of determining the target trolley and matching it can be performed independently for each of the multiple target trolleys.

[0052] When multiple trolleys participate in scheduling simultaneously, using a unified processing logic can easily lead to multiple trolleys competing for the same fuel truck, resulting in conflicts. This embodiment addresses this by independently executing the target fuel truck determination and matching process for each target trolley, ensuring that the scheduling decisions for each trolley are independent and thus avoiding concurrent conflicts. This approach guarantees the uniqueness of the matching result in multi-trolley concurrent operation scenarios, improving the system's concurrent processing capabilities.

[0053] Independent execution refers to logically independent decision-making, with multiple target trams performing the matching process sequentially according to the time they enter the idle state.

[0054] In some embodiments, the oil tanker queue is a first-in, first-out queue maintained according to the order in which the oil tankers enter the queue.

[0055] By limiting the fuel truck queue to a first-in, first-out (FIFO) queue maintained according to the order in which fuel trucks entered the queue, the order of the fuel trucks in the queue directly reflects their order of entry into the queue. Combined with a timestamp-based selection method, this ensures that the scheduling process adheres to the first-come, first-served principle, thereby avoiding problems such as disordered ordering or human intervention during scheduling, and improving the standardization and consistency of queue management.

[0056] In some embodiments, when determining the target refueling vehicle, the refueling vehicle queuing time is selected as the optimization objective.

[0057] In this embodiment, when determining the target fuel truck, the queuing time of the fuel truck is used as the optimization objective to select candidate fuel trucks. Specifically, the system calculates the time difference between the current time and the timestamp recorded when each fuel truck enters the fuel truck queue to obtain the queuing time of each fuel truck. The queuing time reflects the waiting time of the fuel truck in the queue; a longer queuing time indicates a longer wait.

[0058] During the scheduling process, the system retrieves the queuing times of candidate fuel trucks from all the fuel truck queues, compares them, and prioritizes the fuel truck with the longest queuing time as the target fuel truck. For example, in a certain scheduling cycle, if the first fuel truck has a queuing time of 20 minutes and the second fuel truck has a queuing time of 15 minutes, the system will prioritize the first fuel truck as the target fuel truck. Through this method, the scheduling process aims to shorten fuel truck waiting times, prioritizing fuel trucks with longer waiting times, thereby reducing overall waiting time and improving the fairness of the scheduling.

[0059] In a further implementation, when the queuing times of multiple oil trucks are the same or the difference is less than a preset threshold, the candidate oil trucks can be further screened in combination with the gantry load status or other constraints, so as to take into account the overall operating efficiency of the system while ensuring the principle of time priority.

[0060] Optionally, when determining the target fuel truck, if there are multiple fuel trucks with the same timestamp, one of the fuel trucks is determined as the target fuel truck according to a preset rule.

[0061] This application further filters candidate fuel trucks using preset rules when multiple fuel trucks have the same timestamp. This allows for the unique determination of the target fuel truck based on additional parameters, even when priorities cannot be distinguished by time. This approach avoids uncertain selections or duplicate allocations during scheduling, improves the stability of scheduling results, and ensures the system's executability in multi-vehicle concurrent scenarios.

[0062] In some embodiments, the preset rules are executed sequentially according to preset priorities, or at least one of them is selected for execution:

[0063] Compare the timestamps of the first fuel truck in each fuel truck queue;

[0064] Select a queuing queue for fuel vehicles within a preset range based on the location of the target trolley;

[0065] When multiple oil truck timestamps are the same or the difference is less than a preset threshold, they are compared based on the queue length of the corresponding gantry.

[0066] Prioritize selecting oil trucks whose gantry is under low load; the low load status is determined based on the queue length of the corresponding oil truck queue.

[0067] Exclude oil cars that are already occupied by other trams.

[0068] This refers to a method for dispatching logistics vehicles by swapping trailers, specifically including:

[0069] Obtain the current status of each electric vehicle in the transfer yard and the oil truck queue corresponding to each gantry, wherein the oil trucks in each oil truck queue are arranged according to the order of their entry into the queue;

[0070] Select target trams that are currently idle from the trams;

[0071] For each target electric vehicle, candidate electric vehicles are determined from all the electric vehicle queues, and compared based on the timestamps recorded when the electric vehicle enters the queue, with the electric vehicle with the smallest timestamp being selected as the candidate electric vehicle.

[0072] When multiple candidate fuel trucks have the same timestamp or the timestamp difference is less than a preset threshold, the multiple candidate fuel trucks are compared based on at least one optimization factor to determine the target fuel truck. The optimization factors include the gantry queue length, the gantry load status, and the spatial positional relationship between the target electric vehicle and the fuel truck.

[0073] When identifying target trolleys, exclude those that are already occupied by other trolleys or are in an unschedulable state;

[0074] The target electric vehicle is matched with the target oil truck, and the gantry to which the target oil truck belongs is determined as the working position to generate a trailer swapping dispatch instruction.

[0075] For example, when determining the target oil truck, selection is prioritized based on timestamp; when multiple oil trucks have the same timestamp or the timestamp difference is less than a preset threshold, selection is further based on gantry queue length or load status.

[0076] After identifying candidate fuel trucks from all the fuel truck queues, further filtering can be performed within a preset range based on the location of the target trolley.

[0077] In this embodiment, a hierarchical decision-making mechanism is used to screen candidate fuel trucks when determining the target fuel truck. First, a preliminary screening is performed based on the timestamp recorded when the fuel truck enters the fuel truck queue, prioritizing the fuel truck with the smallest timestamp to ensure the time fairness of scheduling. When multiple fuel trucks have the same timestamp or the timestamp difference is less than a preset threshold, it is considered that the waiting time difference among the fuel trucks is small, and a further optimization selection process is triggered.

[0078] In the optimization selection process, candidate fuel trucks are compared based on multiple optimization factors. These optimization factors include at least the queue length of the gantry to which the fuel truck belongs, the load status of the gantry, and the spatial relationship between the target trolley and the fuel truck. Through comprehensive comparison, load balancing and path optimization are achieved. At the same time, before finally determining the target fuel truck, candidate fuel trucks are constrained and screened to exclude fuel trucks that have been occupied by other trolleys or are in an unschedulable state.

[0079] By adopting the above-mentioned hierarchical decision-making method, the process of determining the target fuel vehicle is expanded from a single time dimension to a multi-factor collaborative decision-making process. While ensuring time fairness, it also takes into account system load and spatial efficiency, thereby improving the overall scheduling performance.

[0080] Specifically, when identifying the target trolleybus, the target trolleybus is limited to those that are not occupied by other trolleybuses.

[0081] In existing scheduling systems, concurrent scheduling of multiple vehicles often lacks real-time constraints on resource occupancy status, easily leading to multiple trolleys simultaneously selecting the same fuel vehicle, resulting in scheduling conflicts and task rollbacks. This embodiment limits the target fuel vehicle to one not occupied by other trolleys when determining the target fuel vehicle, and introduces occupancy status constraints during the scheduling calculation phase, ensuring that each fuel vehicle can only be matched by one trolley at a time. By incorporating occupancy relationships into the matching decision process, pre-emptive conflict control of shared resources is achieved, thereby avoiding duplicate allocation problems in concurrent scheduling and improving the consistency and reliability of scheduling results.

[0082] Specifically, when identifying the target fuel truck, the timestamps of the first fuel truck in each fuel truck queue are compared.

[0083] When multiple fuel truck queues exist, directly comparing all fuel trucks increases computational complexity and may affect scheduling efficiency. This embodiment compares the timestamps of the first fuel truck in each queue, ensuring that scheduling calculations are performed only on the best candidate fuel truck in each queue. This transforms the multi-queue problem into a comparison problem with a finite set of candidates. This approach reduces computational scale and improves scheduling response speed while maintaining the time priority principle.

[0084] Specifically, when determining the target fuel truck, the fuel truck queue is selected within a preset range based on the location of the target electric vehicle.

[0085] In real-world transfer environments, the spatial distance between trolleys and fuel trucks directly impacts operational efficiency. Matching based solely on time could lead to trolleys being dispatched across regions, increasing mobility costs. This embodiment selects fuel truck queues within a preset range based on the target trolley's location, prioritizing trolley matching with fuel trucks that are spatially closer. This approach introduces spatial constraints on top of time-priority, reducing trolley travel distance and thus lowering operational time and energy consumption.

[0086] Specifically, when the timestamp difference of multiple oil trucks is less than a preset threshold, the target oil truck is determined based on the queue length of the corresponding gantry.

[0087] In this embodiment, the timestamp difference is used to characterize the degree of difference in the time when different fuel trucks enter the fuel truck queue. Specifically, for any two fuel trucks, the difference between them is calculated based on the timestamps recorded when they enter the queue, and the difference is the absolute difference between the two timestamps.

[0088] When the timestamp difference is less than the preset threshold, it indicates that the corresponding oil trucks entered the queue at similar times and their waiting times are relatively similar. In this case, it is difficult to determine the priority based solely on the time dimension, and additional rules need to be introduced for further selection.

[0089] In this embodiment, when comparing multiple fuel trucks, the system first calculates the time difference based on the timestamps recorded when each fuel truck enters the fuel truck queue. When the timestamp difference of multiple fuel trucks is less than a preset threshold, it indicates that the fuel trucks entered the queue at similar times. If selection is based solely on the time dimension, it is difficult to further distinguish priorities. In this case, the system introduces the queue length of the fuel truck queue corresponding to the gantry as an additional comparison criterion. Specifically, the system obtains the number of fuel trucks currently in the queue corresponding to the gantry to which each candidate fuel truck belongs, compares the queue lengths, and prioritizes the fuel truck corresponding to the gantry with the shorter queue length as the target fuel truck.

[0090] For example, within a certain scheduling cycle, if the timestamp difference between the first and second refueling trucks is less than a preset threshold, corresponding to the first and second gantry respectively, where the queue length for the first gantry is 5 and the queue length for the second gantry is 2, then the system prioritizes the second refueling truck corresponding to the second gantry as the target refueling truck. By introducing load balancing constraints on top of time priority, the system ensures that tasks are rationally distributed across multiple gantry structures, thereby avoiding local congestion and improving overall scheduling efficiency.

[0091] In this embodiment, gantry cranes with short queues are selected first, so that the current gantry cranes can play a good role in diverting traffic, balancing the load, and improving the overall throughput.

[0092] Specifically, when determining the target oil tanker, priority should be given to oil tankers whose gantry is under low load.

[0093] In this embodiment, when determining the target fuel truck, the system, in addition to initial screening based on timestamps, introduces the gantry load status as an additional selection criterion. Specifically, the system obtains the current load information of the fuel truck queue corresponding to the gantry to which each candidate fuel truck belongs. The load information can be characterized by the queue length; that is, the more fuel trucks in the queue, the higher the load, and the fewer the number, the lower the load. When multiple candidate fuel trucks meet the time priority condition, the queue lengths of the gantry to which each candidate fuel truck belongs are compared, and the fuel truck corresponding to the gantry with the shorter queue length is preferentially selected as the target fuel truck.

[0094] For example, within a certain scheduling cycle, if the timestamps of the first and second refueling trucks meet the priority condition, corresponding to the first and second gantry respectively, and the queue length for the first gantry is 6, while the queue length for the second gantry is 3, then the system prioritizes selecting the second refueling truck corresponding to the second gantry as the target refueling truck. This method ensures that the scheduling process, while maintaining time fairness, prioritizes the allocation of tasks to gantry with lower loads, thereby preventing some gantry from being under high load for extended periods. This helps improve overall operational efficiency and achieve balanced resource utilization.

[0095] In some embodiments, the target fuel truck is a fuel truck that has not been marked as unschedulable.

[0096] In actual scheduling, some fuel trucks may be marked as unschedulable due to abnormal status or restrictions. If they still participate in the matching calculation, the scheduling result will be unexecutable. This embodiment limits the target fuel trucks to those not marked as unschedulable, ensuring that all fuel trucks participating in the matching have the conditions to perform swap-and-load operations. By excluding unschedulable fuel trucks during the scheduling calculation stage, invalid matching can be avoided, the executability of the scheduling result can be improved, and the need for subsequent task rollback or reallocation can be reduced.

[0097] In some embodiments, the oil tanker queues are divided according to gantry frames, with each oil tanker queue corresponding to one gantry frame.

[0098] In existing dispatching systems, without zoned management of fuel trucks, all fuel trucks are mixed in a single queue, which can easily lead to inaccurate location of the corresponding work position during dispatching. This embodiment divides the fuel truck queues according to gantry cranes, ensuring a one-to-one correspondence between each fuel truck queue and a specific gantry crane. This method establishes a direct link between the fuel truck's queue status and its actual work position, allowing for direct determination of the corresponding work gantry crane upon matching, reducing additional allocation steps, and improving the clarity and efficiency of the dispatching process.

[0099] Optionally, after the fuel truck enters the transfer station, it is added to the corresponding gantry queue. By adding the fuel truck to the corresponding gantry queue upon entering the transfer station, all fuel trucks entering the transfer station are included in a unified dispatch system. This method ensures that the dispatch system can fully grasp the status of the fuel trucks, providing a complete data foundation for subsequent matching, thereby improving dispatch coverage and overall coordination capabilities.

[0100] Optionally, adding the oil truck to the oil truck queue includes: determining the corresponding gantry based on the material type corresponding to the oil truck.

[0101] By determining the corresponding gantry based on the material type of the oil tanker, the oil tanker is matched with the operational resources as soon as it enters the queue. Since there is a correspondence between the gantry and the material type, this method ensures that the queue the oil tanker enters matches its subsequent operational needs, thereby reducing the need for subsequent reallocation and improving scheduling efficiency.

[0102] In some embodiments, when multiple gantry cranes meet the material type matching requirement, the oil truck is added to the oil truck queue with the shortest queue length. By adding the oil truck to the oil truck queue with the shortest queue length when multiple gantry cranes meet the requirements, load balancing is achieved from the initial stage of the oil truck entering the system. This method avoids local congestion and balances the operating load of each gantry crane, thereby improving overall operating efficiency.

[0103] In some embodiments, the queuing of oil trucks is updated when the state of the gantry to which the target oil truck belongs changes.

[0104] During operation at the transfer station, the status of the gantry may change, such as from normal to abnormal or back to normal. If the fuel truck queue is not updated accordingly, the scheduling data will be distorted. This embodiment updates the fuel truck queue when the status of the gantry to which the target fuel truck belongs changes, ensuring that the queue information is consistent with the actual equipment status. This method avoids the scheduling system making decisions based on outdated status data, thereby improving the accuracy of scheduling results and reducing duplicate scheduling or task interruptions caused by changes in equipment status.

[0105] In some embodiments, when the gantry is in an abnormal state, adding fuel trucks to the corresponding fuel truck queue is suspended, preventing newly arriving fuel trucks from being assigned to unavailable work positions. This method can avoid the generation of invalid queues from the source, thereby reducing subsequent scheduling adjustments.

[0106] In some embodiments, after the gantry's status is restored, the oil truck is allowed to join the corresponding oil truck queue, enabling the gantry to re-participate in scheduling. This approach ensures the system's responsiveness to changes in equipment status, allowing resources to be dynamically restored for use, thereby improving overall equipment utilization.

[0107] Optionally, the matching process is triggered when there is at least one idle trolley and at least one trolley queue is not empty.

[0108] During scheduling, the lack of explicit triggering conditions may lead to scheduling logic being triggered even when execution conditions are not met, resulting in invalid calculations or incorrect allocations. This embodiment limits the matching process to triggering only when there is at least one idle tram and at least one non-empty queue of diesel vehicles, thus providing clear preconditions for scheduling execution. This approach avoids invalid calculations when resources are insufficient or there are no scheduling targets, thereby reducing system load and ensuring that each triggered scheduling process has practical significance.

[0109] In some embodiments, before determining the target fuel truck, the validity of each fuel truck queue is verified to exclude fuel trucks that do not meet the preset conditions.

[0110] This embodiment verifies the validity of each fuel truck queue before determining the target fuel truck, excluding fuel trucks that do not meet the preset conditions, thus ensuring that the matching targets are valid data. This method reduces the interference of abnormal data on the scheduling results, improving the accuracy and reliability of scheduling calculations.

[0111] Specifically, validity verification includes checking the status information, matching status, and gantry status of the fuel trucks: First, it determines whether the fuel truck is in a dispatchable state, excluding fuel trucks that have completed their work, are in an abnormal state, or are marked as undispatchable; second, it determines whether the fuel truck has established a matching relationship with the trolley, excluding fuel trucks that are already occupied or performing work; third, based on the status information of the gantry to which the fuel truck belongs, fuel trucks whose corresponding gantry is in an abnormal state are excluded. In addition, consistency verification can be performed on the basic data of the fuel trucks, such as determining whether the fuel truck has a valid queue timestamp and whether its queue information is complete. Through the above validity verification, the candidates for selecting target fuel trucks are limited to valid fuel trucks that meet the dispatching conditions, thereby avoiding the impact of abnormal data or invalid states on the dispatching results and improving the accuracy and executability of the dispatching process.

[0112] Optionally, the process of determining the target oil tanker is performed periodically within a preset time interval.

[0113] By setting the process of identifying target fuel trucks to be executed periodically at preset time intervals, the system can continuously scan the fuel truck queue and the status of trolleybuses. This approach avoids the response lag problem caused by relying on a single triggering event, thereby improving the real-time performance of the scheduling system and enabling trolleybuses to be assigned tasks in a shorter time after they become idle, reducing resource idleness.

[0114] In some implementations, the process of identifying target refueling vehicles is executed periodically within a preset time interval. Specifically, the system sets up a timed trigger mechanism to cyclically execute the scheduling process at fixed time intervals, such as seconds or minutes. At the end of each scheduling cycle, the system automatically acquires the status of each trolley in the current transfer yard and the latest data of each refueling vehicle queue, and then executes the process of identifying and matching target refueling vehicles based on this data. During this process, the system prioritizes selecting trolleys that are idle, and performs a global selection across all refueling vehicle queues for each target trolley to determine the target refueling vehicle that meets the criteria. This periodic execution method allows the scheduling process to continuously respond to changes in system status, enabling timely scheduling decisions even without explicit trigger events, thereby reducing trolley idle waiting time and improving the real-time performance of scheduling. Furthermore, the preset time interval can be adjusted according to the size of the transfer yard, the number of vehicles, or the operating frequency to achieve a balance between scheduling response speed and system computational load.

[0115] In some embodiments, the current state of the trolley includes at least an idle state, a state awaiting coupling, a state that has been coupled, and a state awaiting uncoupling.

[0116] In this embodiment, the current state of the trolley is used to characterize the operational stage of the trolley during the swapping operation, specifically including the idle state, the waiting-to-swap state, the swapped-to-hap state, and the waiting-to-unswap state. The idle state refers to the state where the trolley has not yet established a matching relationship with any oil tanker and has the capability to immediately perform the swapping operation; in this state, the trolley can participate in the matching of target oil tankers as a dispatching object. The waiting-to-swap state refers to the state where the trolley has established a matching relationship with a target oil tanker and has received the corresponding swapping dispatch instruction, but has not yet completed the actual swapping operation; in this stage, the trolley is usually in the process of heading to the designated gantry or waiting for operation. The swapped-to-hap state refers to the state where the trolley and the corresponding oil tanker have completed the swapping operation at the target gantry, completing the cargo transfer or coupling operation; in this state, the trolley has completed the current dispatching task. The waiting-to-unswap state refers to the transitional state where the trolley, after completing the swapping operation, is waiting for subsequent unswap operations or preparing to leave the transfer yard; in this state, the trolley does not participate in new dispatching until the unswap operation is completed and it returns to the idle state. By classifying the status as described above, the trolley has a clear status identifier at different stages of operation, thus providing a basis for the dispatching system to make status judgments and assign tasks.

[0117] In some embodiments, after the trolley completes the uncoupling, the trolley's status is updated to idle, and the corresponding time information is recorded.

[0118] Optionally, a warning message may be generated when the tram remains idle for more than a preset time threshold.

[0119] In this embodiment, after the trolley completes the coupling / uncoupling operation, the system updates the trolley's operational status using operation confirmation information, changing the trolley from a pending coupling / uncoupling state to an idle state. Simultaneously, the system records the corresponding time information, which is the moment the trolley completes the coupling / uncoupling operation and enters the idle state. This time information serves as the basis for subsequently determining the trolley's idle time.

[0120] While a trolley is idle, the system continuously monitors the idle duration and compares the current time with the recorded time to calculate the idle time. When the idle time exceeds a preset threshold, the system determines that the trolley is in an abnormal idle state and generates an early warning message. This warning message can be used to alert the dispatching system or dispatchers to the trolley's unassigned status and can trigger corresponding intervention measures, such as prioritizing the inclusion of the trolley in subsequent dispatch calculations or manually adjusting its dispatch. Through this method, the idle status of trolleys is continuously tracked, and situations where they have not participated in operations for extended periods can be detected promptly, thereby reducing resource idleness and improving dispatching efficiency.

[0121] In some embodiments, the availability of the target trolley is verified before matching the target trolley with the target fuel vehicle.

[0122] In this embodiment, before matching the target trolley with the target oil truck, an availability check is performed on the target trolley to ensure that it has the conditions to perform the swapping operation. Specifically, the availability check includes checking the trolley's current status, operating status, and basic information related to scheduling: First, it is determined whether the trolley is idle, excluding trolleys that are in a state of waiting to swap, have already swapped, or are waiting to detach; second, it is determined whether the trolley is in normal operating condition, excluding trolleys with malfunctions, communication abnormalities, or marked as unschedulable; third, it is determined whether the trolley has been assigned other scheduling tasks, excluding trolleys that are already participating in other matching processes or are in the process of executing tasks. In addition, the location information of the trolley and the basic matching conditions with the target oil truck can also be checked to ensure that the trolley can complete the corresponding operation within a reasonable range. Through the above availability check, the trolleys participating in the matching are limited to effective resources with actual execution capabilities, thereby avoiding ineffective scheduling and improving the reliability and efficiency of scheduling results.

[0123] In some embodiments, the queue length information of the corresponding fuel truck queue is updated after matching is completed, enabling the system to monitor the current load status of each queue in real time. Since subsequent scheduling processes may involve comparisons or optimization decisions based on queue lengths, this method ensures that the data used is up-to-date, thereby improving the accuracy of scheduling results and avoiding uneven resource allocation due to data lag.

[0124] In some embodiments, when multiple target trams are matched simultaneously, the matching is performed sequentially according to the time order in which they enter the idle state.

[0125] In this embodiment, when multiple trolleys are idle in the transfer area, the system first records the time information of each trolley entering the idle state, and then sorts the multiple target trolleys based on this time information. Specifically, the trolley that entered the idle state earlier is identified as the trolley that participates in the scheduling first, and the matching process is performed sequentially according to the time order. During the matching process, for the target trolley that is ranked higher, the corresponding target oil car is first identified in all oil car queues, and the matching and status update are completed; subsequently, for the target trolley that is ranked lower, the matching process continues based on the updated oil car queue and occupancy status.

[0126] For example, within a certain scheduling cycle, the first tram departs at time... Once the train enters idle mode, the second tram will depart at the designated time. Entering an idle state, and Earlier The system first performs the target fuel car determination and matching operation for the first trolley, and updates the occupancy status and queue information of the corresponding fuel car after the matching is completed. Then, it performs the matching process for the second trolley, excluding fuel cars already occupied by the first trolley when selecting a target fuel car. In this way, multiple trolleys are processed in an orderly manner according to time sequence in a concurrent scheduling scenario, thereby avoiding multiple trolleys competing for the same fuel car at the same time and ensuring the uniqueness and stability of the scheduling result.

[0127] Optionally, when generating the swapping dispatch instruction, route guidance information corresponding to the target trolley is also generated.

[0128] In this embodiment, while generating the swap dispatch command, the system generates path guidance information corresponding to the target trolley based on the current location of the target trolley and the working position of the gantry to which the target oil truck belongs. Specifically, the system acquires the road layout information within the transfer yard and the position coordinates of each gantry, and calculates the travel path from the current location to the target gantry based on the real-time location information of the target trolley. The path guidance information may include the travel path, turning points, and arrival sequence, etc., to guide the trolley to travel along the predetermined route to the corresponding working position.

[0129] For example, in a certain dispatching process, the target trolley is located at the entrance area of ​​the transfer station, while the gantry of the target oil truck is located on the other side of the transfer station. The system calculates an optimal driving route based on the current road conditions and path length, and sends this route as route guidance information to the trolley terminal along with the trailer swapping dispatching command. The trolley travels according to the route guidance information, thereby avoiding time waste caused by disorderly driving or improper route selection.

[0130] By using the above methods, the dispatch instructions include not only the information of the task object, but also the information of the execution path, thereby reducing the path decision time of the trolley during the execution process, improving the efficiency of dispatch execution, and reducing the operating costs caused by unreasonable path selection.

[0131] In some alternative embodiments, when determining the target fuel truck, a comprehensive evaluation parameter is constructed based on the fuel truck queuing time and the gantry queuing length.

[0132] In this embodiment, when determining the target fuel truck, the system constructs a comprehensive evaluation parameter based on the fuel truck's queuing time and the queuing length of its corresponding gantry, which is used to sort and select candidate fuel trucks. Specifically, firstly, the queuing time of each fuel truck is calculated based on the timestamp recorded when it enters the fuel truck queuing queue, and the queuing length of the current corresponding fuel truck queuing queue of each fuel truck's gantry is obtained; then, the queuing time and queuing length are uniformly quantified, for example, by constructing a comprehensive evaluation parameter through weighted calculation, where the queuing time is used to characterize the waiting cost, and the queuing length is used to characterize the gantry load level.

[0133] In one specific implementation, the comprehensive evaluation parameters can be expressed as: Here, α and β are preset weight parameters used to adjust the trade-off between time priority and load balancing. The system compares candidate fuel trucks based on comprehensive evaluation parameters, prioritizing the fuel truck with the larger comprehensive evaluation parameters as the target fuel truck. For example, when the first fuel truck has a longer queuing time but a higher load on its gantry, while the second fuel truck has a slightly shorter queuing time but a lower load on its gantry, the aforementioned comprehensive evaluation parameters can achieve a balanced selection between the two.

[0134] By adopting the above approach, the scheduling decision-making process is expanded from a single time dimension to a multi-factor comprehensive evaluation process, thereby ensuring the fairness of waiting for fuel trucks while taking into account the load balance of the gantry, and improving the overall scheduling efficiency and system operation stability.

[0135] In some alternative embodiments, after matching the target tram with the target fuel truck, scheduling data containing information about the tram, fuel truck, and gantry is generated, transforming the scheduling result from a temporary instruction into a structured data object. This approach uniformly encapsulates the key elements in the scheduling process, enabling the scheduling result to be further processed, stored, and retrieved by the system, thereby providing a data foundation for subsequent execution, monitoring, and optimization.

[0136] In some optional embodiments, scheduling data is sent to the terminal devices of the corresponding trams and fuel vehicles, enabling the vehicles participating in the scheduling to obtain matching results and work locations in real time. This method achieves direct information connection between the scheduling decision-making and execution entities, reducing intermediate transmission links, thereby shortening response time and improving the timeliness and accuracy of scheduling execution.

[0137] In some alternative embodiments, the queuing time of the fuel truck is predicted before the target fuel truck is determined, and the target fuel truck is determined based on the prediction results.

[0138] In this embodiment, before identifying the target refueling truck, the system predicts the queuing time in each refueling truck queue to reflect the waiting trend of refueling trucks over a future period. Specifically, the system calculates the estimated waiting time for each refueling truck based on historical scheduling data, the current length of the refueling truck queue, and the trolleybus operation rhythm. The estimated waiting time can include the currently incurred queuing time and the waiting time that may be added during subsequent operations. By predicting future waiting conditions, refueling trucks that are about to experience queue growth or a significant increase in waiting time can be identified.

[0139] Based on this, the system sorts candidate fuel trucks according to the predicted queuing time and prioritizes the fuel truck with the longer predicted queuing time as the target fuel truck. For example, at the current moment, the actual queuing times of the first and second fuel trucks are similar, but according to the prediction, the queue of the first fuel truck will have a significantly longer waiting time due to fewer subsequent trolleybus dispatches, while the queue of the second fuel truck can be processed faster. In this way, the system prioritizes the first fuel truck as the target fuel truck. Through this method, the scheduling decision is not only based on the current state but also takes into account future trends, thereby reducing scheduling repetitions caused by short-term judgments and improving the foresight and overall stability of the scheduling.

[0140] In some alternative embodiments, when a target oil truck is identified, the matching strategy is dynamically adjusted based on the real-time status within the transfer station.

[0141] In this embodiment, when identifying a target refueling truck, the system dynamically adjusts the matching strategy based on the real-time operating status within the transfer station. Specifically, the real-time status includes at least the number and distribution of trolleybuses, the load status of each gantry, the length of the refueling truck queue, and the equipment operating status. The system acquires the aforementioned real-time status within each scheduling cycle and adjusts the matching strategy according to different combinations of statuses.

[0142] For example, when the overall load of the transfer station is low and the queue of fuel trucks is short, the system prioritizes matching based on the queuing time of the fuel trucks to ensure time fairness; when the queue length of some gantry lines increases significantly, the system increases the weight of load balancing on the basis of time priority, and prioritizes the fuel trucks corresponding to the gantry lines with lower loads; when the distribution of trolleybuses is concentrated in certain areas, the system can introduce spatial constraints to prioritize matching fuel trucks that are closer to each other to reduce travel distance; when some gantry lines are in an abnormal state or in the process of recovery, the system automatically adjusts the matching range, excluding or re-including the corresponding queues.

[0143] By employing the above methods, the matching strategy can be adaptively adjusted according to the real-time operation of the transfer station, thereby balancing scheduling efficiency, resource utilization, and operational stability in different operating scenarios, and improving the flexibility and adaptability of the overall scheduling system.

[0144] In some alternative embodiments, when determining the target fuel truck, constraints are applied based on the energy consumption parameters during the fuel truck's waiting process.

[0145] In this embodiment, when determining the target fuel truck, the energy consumption parameters of the fuel truck during the queuing process are incorporated as constraints into the scheduling decision. Specifically, the system calculates the waiting time of the fuel truck based on the timestamp recorded when it enters the fuel truck queue and the current time, and estimates the energy consumption of the fuel truck during the waiting process using a preset energy consumption model. The energy consumption can be positively correlated with the idling time of the fuel truck. For each candidate fuel truck, the system obtains its corresponding energy consumption parameters and compares the candidate fuel trucks under the premise of meeting the basic scheduling conditions, prioritizing the fuel trucks with higher energy consumption or a faster energy consumption growth trend as the target fuel truck.

[0146] For example, if the queuing times of the first and second fuel trucks are similar within a certain scheduling cycle, but the first fuel truck's waiting environment or operating condition results in higher energy consumption, the system will prioritize matching the first fuel truck to reduce the duration of high energy consumption. Through this method, the scheduling process ensures operational efficiency while also considering energy consumption control, thereby reducing energy waste caused by prolonged idling of fuel trucks and improving the overall energy utilization efficiency of the transfer station.

[0147] In a typical implementation scenario, multiple gantries are set up in the transfer yard, each corresponding to a queue of oil tankers. Different gantries can handle different types of materials. The system performs unified scheduling and management of trolleys and oil tankers in the transfer yard. The current status of a trolley includes at least the following states: idle, waiting to be coupled, coupled, and waiting to be uncoupled.

[0148] When a fuel truck enters the transfer station, the system adds it to the fuel truck queue corresponding to the appropriate gantry based on the material type. If multiple gantry queues match the material type, the system prioritizes adding the fuel truck to the queue with the fewest available slots. The system records the timestamp of each fuel truck entering the queue, and all fuel truck queues are maintained in timestamp order.

[0149] During the scheduling process, the system obtains the current status of each trolley in the transfer yard and selects trolleys that are idle as target trolleys. The scheduling process is triggered when there is at least one target trolley and at least one oil truck queue is not empty.

[0150] For each target electric vehicle, the system performs a global selection across all fuel vehicle queues, determining the target fuel vehicle with the smallest timestamp based on the timestamp recorded when it entered the queue. If multiple fuel vehicles have the same timestamp or a difference less than a preset threshold, the system further compares them based on the queue length of the corresponding gantry to determine the final target fuel vehicle.

[0151] After identifying the target trolley, the system verifies its availability and confirms that it is not occupied by other trolleys. Then, it matches the target trolley with the target trolley, determines the gantry to which the target trolley belongs as the work location, and generates a trailer-swapping dispatch instruction.

[0152] After matching is complete, the target oil tanker is removed from the corresponding oil tanker queue, the queue length is updated, the target trolley's status is updated to "awaiting swapping," and the matching relationship between the trolley and oil tanker is recorded. The system then sends the generated scheduling data to the terminal devices of the corresponding trolley and oil tanker to guide on-site operations.

[0153] The above implementation method achieves time-priority global scheduling, enabling fuel trucks to receive services according to the order in which they enter the queue, while avoiding local queue congestion and improving overall scheduling efficiency.

[0154] In another implementation scenario, there are multiple idle trolleys in the transfer yard at the same time, and the system needs to perform concurrent scheduling of multiple trolleys.

[0155] In this scenario, the system sequentially determines the target fuel vehicle from multiple target trolleys according to the order in which they enter the idle state. For each target trolley, it is independently selected from all fuel vehicle queues, and the occupancy status of the target fuel vehicle is marked in real time during the matching process.

[0156] Once a fuel car is matched with the first trolley, the fuel car is marked as occupied. Subsequent trolleys will exclude the fuel car during the selection process, thus avoiding the situation where multiple trolleys match the same fuel car at the same time.

[0157] Through the above methods, sequential processing and occupancy control are combined in the concurrent scheduling of multiple trolleys, which not only ensures the uniqueness of the scheduling results, but also improves the stability of the system in high-concurrency scenarios.

[0158] The foregoing description and accompanying drawings fully illustrate embodiments of the present disclosure to enable those skilled in the art to practice them. Other embodiments may include structural and other changes. The embodiments represent only possible variations. Individual components and functions are optional unless explicitly required, and the order of operation may vary. Parts and features of some embodiments may be included or substituted for parts and features of other embodiments. Embodiments of the present disclosure are not limited to the structures described above and shown in the accompanying drawings, and various modifications and changes may be made without departing from its scope. The scope of the present disclosure is limited only by the appended claims, and the foregoing embodiments should be considered exemplary and non-limiting.

Claims

1. A method for dispatching logistics vehicles by swapping trailers, characterized in that, include: Obtain the current status of each electric vehicle in the transfer yard and the oil truck queue corresponding to each gantry, wherein the oil trucks in each oil truck queue are arranged according to the order of their entry into the queue; Select target trams that are currently idle from the trams; For each target electric vehicle, among all the oil vehicle queues, the target oil vehicle with the smallest timestamp is determined based on the timestamp recorded when the oil vehicle enters the queue. The target electric vehicle is matched with the target oil truck, and the gantry to which the target oil truck belongs is determined as the working position to generate a trailer swapping dispatch instruction. When determining the target fuel truck, if multiple fuel trucks have the same timestamp, one of them is selected as the target fuel truck according to a preset rule; the preset rule is executed sequentially according to a preset priority, or at least one of them is selected for execution: Select a queuing queue for fuel vehicles within a preset range based on the location of the target trolley; Compare based on the queue length of the corresponding gantry; Select the oil truck whose gantry is under low load.

2. The method according to claim 1, characterized in that, After matching the target electric vehicle with the target fuel vehicle, the target fuel vehicle is removed from the corresponding fuel vehicle queue.

3. The method according to claim 1, characterized in that, The process of determining the target trolley and matching it is performed independently for each of the multiple target trolleys.

4. The method according to claim 1, characterized in that, The matching is triggered when there is at least one idle tram and at least one queue of gasoline vehicles that is not empty.

5. The method according to claim 1, characterized in that, The process of identifying the target oil tanker is performed periodically within a preset time interval.

6. The method according to claim 1, characterized in that, After the oil truck enters the transfer station, the oil truck is added to the oil truck queue of the corresponding gantry. Adding the oil truck to the oil truck queue includes: The corresponding gantry is determined based on the type of material being processed by the oil truck.

7. The method according to claim 1, characterized in that, A warning message is generated when the tram remains idle for more than a preset time threshold.

8. The method according to claim 1, characterized in that, When generating the trailer swapping dispatch instruction, route guidance information corresponding to the target trolley is also generated.

Images