Transport vehicle dispatching method, system, device and storage medium

Abstract

The application provides a transportation vehicle scheduling method, system, device and storage medium, the method comprises the following steps: obtaining to-be-assigned task data, wherein the to-be-assigned task data comprises task route information corresponding to a plurality of to-be-assigned transportation tasks; assigning a first number of transportation vehicles for each transportation task; calculating the time required for the transportation vehicles of the assigned tasks to perform the tasks; for each task route, respectively counting the time required for all transportation vehicles corresponding to the task route to perform the tasks; selecting a second number of task routes with the longest required time, and assigning a third number of transportation vehicles to the task routes. The scheduling algorithm is simple, easy to implement, and effectively improves the transportation operation efficiency.

Description

Technical Field

[0001] This invention relates to the field of vehicle dispatching technology, and in particular to a method, system, equipment and storage medium for dispatching transport vehicles. Background Technology

[0002] A container terminal is an operational site for loading and unloading containers, integrating berths, quay cranes, yards, horizontal transport equipment, and related auxiliary facilities. Among these, the transport efficiency of horizontal transport equipment (container transport equipment, such as unmanned trucks) significantly impacts the overall efficiency of container handling operations at the terminal. Dispatching too few unmanned trucks will slow down overall operations; dispatching too many will not only cause road congestion and affect vehicle speed, but also result in a large number of unmanned trucks waiting for quay cranes or yard cranes to operate, thus negatively impacting overall loading and unloading efficiency.

[0003] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of the present invention, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0004] In view of the problems in the prior art, the purpose of this invention is to provide a method, system, equipment and storage medium for scheduling transportation vehicles. The scheduling algorithm is simple, easy to implement and effectively improves the efficiency of transportation operations.

[0005] This invention provides a method for dispatching transport vehicles, comprising the following steps:

[0006] Obtain the task data to be assigned, which includes task route information corresponding to multiple transportation tasks to be assigned;

[0007] Assign a first number of transport vehicles to each transport task;

[0008] Calculate the time required for the assigned transport vehicles to perform their tasks;

[0009] For each task route, calculate the time required for all transport vehicles corresponding to that task route to complete the task.

[0010] Select the second-longest mission route and add a third number of transport vehicles to that route.

[0011] In some embodiments, calculating the time required for the assigned transport vehicle to perform the task includes the following steps:

[0012] Calculate the travel time of the assigned transport vehicle on the task route, the time required for loading and unloading goods, and the waiting time for loading and unloading goods, and sum them up to obtain the time required for the transport vehicle to perform the task.

[0013] In some embodiments, the travel time of the transport vehicle assigned a task on the task route is calculated using the following steps:

[0014] For a transportation task, for each round trip in the transportation task, calculate the speed v of the assigned transportation vehicle on the task route;

[0015] Obtain the round-trip path length from the starting point to the ending point in the task route;

[0016] For each round trip corresponding to this transportation task, the round trip time is calculated based on the travel speed and the path length;

[0017] The travel time of the transport vehicle on the mission route is obtained by summing up the travel times of multiple round trips in the transport mission.

[0018] In some embodiments, calculating the travel speed of the assigned transport vehicle on the task route includes the following steps:

[0019] Obtain the vehicle density and preset optimal vehicle speed on the current task route;

[0020] The speed of the transport vehicle on the mission route is calculated based on the vehicle density and the preset optimal vehicle speed. The higher the vehicle density, the lower the speed of the transport vehicle on the mission route.

[0021] In some embodiments, the task data to be assigned further includes transportation task information, which includes whether loading and unloading are carried out at the origin and destination, and the number of loadings and / or unloadings.

[0022] The time required for loading and unloading the goods is calculated using the following steps:

[0023] Based on the transportation task information, determine whether loading and unloading should be carried out at the origin and destination.

[0024] If loading is required, calculate the loading time for this transportation task based on the preset loading time for each loading.

[0025] If unloading is required, calculate the unloading time for this transportation task based on the preset unloading time for each unloading operation.

[0026] The loading and unloading times for this transportation task are summed based on the transportation task information to obtain the total loading and unloading time for this transportation task.

[0027] In some embodiments, the step of calculating the loading time required for this transportation task based on the preset loading time required for each loading includes: obtaining the preset loading time required for each loading and the number of loadings required for the loading location, and calculating the loading time required for this transportation task.

[0028] The step of calculating the unloading time required for this transportation task based on the preset unloading time for each unloading includes: obtaining the preset unloading time and the number of unloading operations required for each unloading operation corresponding to the unloading location, and calculating the unloading time required for this transportation task.

[0029] In some embodiments, the task data to be assigned further includes transportation task information, which includes whether loading and unloading are carried out at the origin and destination, and the number of loadings and / or unloadings.

[0030] Waiting time for loading and unloading goods using the following steps:

[0031] Based on the transportation task information, determine whether loading and unloading should be carried out at the origin and destination.

[0032] If loading is required, the loading waiting time is calculated based on the start time of the loading location's availability and the time the transport vehicle arrives at the loading location.

[0033] If unloading is required, the unloading waiting time is calculated based on the start time of the unloading location and the time when the transport vehicle arrives at the unloading location.

[0034] The loading waiting time and / or unloading waiting time are summed based on the transportation task information to obtain the loading and unloading waiting time for the goods.

[0035] In some embodiments, after selecting the second number of task routes with the longest required time and dispatching a third number of transport vehicles to that task route, the method further includes the following steps:

[0036] Determine whether the preset task allocation stop condition is met;

[0037] If so, then stop assigning tasks.

[0038] In some embodiments, determining whether a preset task allocation stop condition is met includes the following steps:

[0039] Determine whether all transport vehicles have been assigned transport tasks.

[0040] If so, then the preset task allocation stop condition is met.

[0041] In some embodiments, determining whether a preset task allocation stop condition is met includes the following steps:

[0042] For mission routes with additional transport vehicles, the execution time of all transport vehicles corresponding to that mission route is calculated again.

[0043] If the time required for a task route after adding transport vehicles is recalculated is greater than the time required for the same task route before adding transport vehicles, then the preset task allocation stop condition is met.

[0044] In some embodiments, after stopping task assignment, the method further includes outputting a transport vehicle operation sequence, which includes the correspondence between each transport vehicle and the transport task.

[0045] This invention also provides a transportation vehicle dispatching system for implementing the aforementioned transportation vehicle dispatching method, the system comprising:

[0046] The data acquisition module is used to acquire task data to be assigned, which includes task route information corresponding to multiple transportation tasks to be assigned.

[0047] The task allocation module is used to allocate a first number of transport vehicles to each transport task.

[0048] The time statistics module is used to calculate the time required for the assigned transport vehicles to perform their tasks, and for each task route, to calculate the time required for all transport vehicles corresponding to that task route to perform their tasks.

[0049] The vehicle dispatch module is used to select the second number of mission routes with the longest required time, and dispatch a third number of transport vehicles to that mission route.

[0050] This invention also provides a transportation vehicle dispatching device, comprising:

[0051] processor;

[0052] A memory in which executable instructions of the processor are stored;

[0053] The processor is configured to perform the steps of the transport vehicle scheduling method by executing the executable instructions.

[0054] This invention also provides a computer-readable storage medium for storing a program that, when executed by a processor, implements the steps of the transport vehicle scheduling method.

[0055] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure.

[0056] The transportation vehicle scheduling method, system, equipment, and storage medium of the present invention have the following beneficial effects:

[0057] This invention provides a task scheduling algorithm for transport vehicles to and from the origin and destination of goods. By gradually increasing the number of transport vehicles, it ensures that the tasks on each route can be completed quickly and stably. The scheduling algorithm is simple, easy to implement, highly stable, and effectively improves the efficiency of transportation operations. This solution can be applied to the allocation of container transport operations between quay cranes and container yards, but the invention is not limited to this; it can also be applied to cargo transportation in other scenarios. Attached Figure Description

[0058] Other features, objects, and advantages of the invention will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings.

[0059] Figure 1 This is a flowchart of a transportation vehicle scheduling method according to an embodiment of the present invention;

[0060] Figure 2 This is a flowchart illustrating the calculation of the travel time of a transport vehicle with assigned tasks along a task route, according to an embodiment of the present invention.

[0061] Figure 3 This is a flowchart illustrating the calculation of the time required for loading and unloading goods according to an embodiment of the present invention;

[0062] Figure 4 This is a flowchart illustrating the calculation of waiting time for loading and unloading goods according to an embodiment of the present invention;

[0063] Figure 5 This is a schematic diagram of the structure of a transport vehicle dispatching system according to an embodiment of the present invention;

[0064] Figure 6 This is a schematic diagram of the structure of a transport vehicle dispatching device according to an embodiment of the present invention;

[0065] Figure 7 This is a schematic diagram of the structure of a computer-readable storage medium according to an embodiment of the present invention. Detailed Implementation

[0066] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0067] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0068] The flowchart shown in the attached diagram is merely an illustrative example and does not necessarily include all steps. For example, some steps may be broken down, while others may be combined or partially combined. Therefore, the actual execution order may change depending on the specific circumstances.

[0069] To address the problems of existing technologies, embodiments of the present invention provide a method for dispatching transport vehicles. This method can be applied to the allocation of container transport operations between quay cranes and container yards, and can also be applied to cargo transport in other scenarios. The following detailed description uses container trucks as examples, with the task route being from the quay crane to the container yard or from the container yard to the quay crane.

[0070] like Figure 1 As shown, the transportation vehicle dispatching method includes the following steps:

[0071] S100: Obtain task data to be assigned. The task data to be assigned includes task route information corresponding to multiple transportation tasks to be assigned. Specifically, the task data to be assigned includes task route information corresponding to multiple transportation tasks to be assigned, specifically including the location or number of the starting point and the ending point. For example, if the starting point is a designated quay crane and the ending point is a designated yard, then the task route of a transportation task is from the designated quay crane to the designated yard.

[0072] S200: Assign a first number of transport vehicles to each transport task;

[0073] The first quantity can be set as needed. For example, if the first quantity is set to 1, then in step S200, one transport vehicle is allocated for each transport task. However, the present invention is not limited to this. In other embodiments, the first quantity can also be other values, such as allocating two or three transport vehicles for each transport task.

[0074] S300: Calculates the time required for the assigned transport vehicles to perform their tasks; the specific calculation method is described in detail below.

[0075] S400: For each task route, calculate the time required for all transport vehicles corresponding to that task route to complete the task.

[0076] The starting and ending points of the transportation tasks assigned to the transportation vehicles in each task route are the same, or the starting and ending points are interchanged. There may be multiple transportation vehicles in each task route that perform different transportation tasks. In step S400, the total time required for all transportation vehicles in each task route to perform their assigned transportation tasks is calculated.

[0077] S500: Select the task route with the longest required time (the second number), and dispatch a third number of transport vehicles to that task route. The values ​​of the second and third numbers can be selected as needed. For example, if the second and third numbers are both selected as 1, then in step S500, based on the time statistics results in step S400, the task route with the longest required time is selected, and one transport vehicle is dispatched to that task route. In other embodiments, the second and third numbers can also be selected as other values, all of which are within the scope of protection of this invention. When dispatching one transport vehicle to a task route, the dispatched transport vehicle can be assigned to perform the transport task with the longest required time on that task route.

[0078] This invention provides a task scheduling algorithm for transporting goods between a starting point and an ending point using a vehicle scheduling method. After allocating transport tasks in steps S100 and S200, steps S300 and S400 identify the task route with the longest execution time. Step S500 then adds more transport vehicles to this route. By gradually increasing the number of transport vehicles, the algorithm ensures that tasks on each route can be completed quickly and stably. The scheduling algorithm is simple, easy to implement, highly stable, and effectively improves transport operation efficiency. This vehicle scheduling method can be applied, for example, to a fleet management server at a container terminal, or it can be set up on a separate server and communicate with the fleet management server. When applied to other scenarios, this vehicle scheduling method can be applied to the corresponding vehicle management server.

[0079] In this embodiment, step S100, obtaining the task data to be assigned, includes the following steps:

[0080] The system obtains the container information of the current cargo ship, including the number of containers to be loaded / unloaded and their storage locations; the path information between the quay crane and each container yard; and sets the task routes, resulting in multiple tasks to be assigned and their corresponding routes. The relationship between transportation tasks and task routes can be one-to-one or many-to-one. Then, in step 200, a transportation vehicle is assigned to each transportation task. The transportation vehicle can be an unmanned container truck or a manned container truck. There can be one or more quay cranes and multiple container yards. The following example illustrates the scenario where the quay cranes are in the same location and the container yards are distributed in multiple locations. In this embodiment, the transportation task refers to transporting containers from the quay crane to a designated container yard, or from a designated container yard to the quay crane.

[0081] In this embodiment, step S300, calculating the time required for the assigned transport vehicle to perform the task, includes the following steps:

[0082] Calculate the travel time of the assigned transport vehicle along the task route, the time required for loading and unloading goods, and the waiting time for loading and unloading goods. Summing these times together yields the total time required for the transport vehicle to perform its task. That is, in, This represents the time required for the i-th transport vehicle to travel between the quay crane and the storage yard j, which is determined by the vehicle speed and the route length. This represents the time spent by the i-th transport vehicle loading and unloading containers at yard j and the quay crane, which is determined by the operational efficiency and task allocation of the quay crane and the yard. This represents the waiting time spent by the i-th transport vehicle at the quay crane and yard j for loading and unloading containers for the preceding vehicle.

[0083] like Figure 2 As shown, in this embodiment, in step S300, the travel time of the assigned transport vehicle on the task route is calculated using the following steps:

[0084] S311: For a transportation task, for each round trip in the transportation task, calculate the speed of the assigned transportation vehicle on the task route.

[0085] S312: Obtain the round-trip path length from the starting point to the ending point in the task route; specifically, first calculate the one-way length I, then multiply the one-way length by 2 to obtain the round-trip path length 2×I;

[0086] S313: For each round trip corresponding to the transportation task, calculate the round trip time based on the driving speed and the path length;

[0087] S314: The travel times of the multiple round trips in the transportation task are added together to obtain the travel time of the transportation vehicle on the task route.

[0088] For example, if a transportation task involves 10 round trips, the time for each round trip is calculated separately, and the total travel time is obtained by summing the times of all 10 round trips.

[0089] The formula for calculating round-trip time is, for example: Among them, l j v represents the path length between the quay crane and the storage yard j. i,j This represents the speed of the i-th transport vehicle traveling between the quay crane and the storage yard j. The speed of the transport vehicle is determined by the initial optimal speed and the road congestion level; the higher the road congestion level, the lower the speed of the transport vehicle.

[0090] Specifically, for a transportation task, for each round trip corresponding to that transportation task, step S311: calculating the travel speed of the assigned transportation vehicle on the task route includes the following steps:

[0091] Obtain the vehicle density and preset optimal vehicle speed on the current task route; for each round trip, the vehicle density on the task route may be different, and the vehicle density corresponding to each round trip can be predicted based on the current progress of the transportation task on the task route and the vehicle allocation.

[0092] The speed of the transport vehicle on the mission route is calculated based on the vehicle density and the preset optimal vehicle speed. The higher the vehicle density, the lower the speed of the transport vehicle on the mission route.

[0093] In this embodiment, the relationship between vehicle speed and vehicle density can be described using a linear model. The calculation formula is as follows: Where v0 represents the optimal driving speed of the vehicle, K represents the vehicle density on the current road segment, and is derived from... It is found that when the number of vehicles is less than or equal to 1, all vehicles can travel at the optimal speed, K. max This represents the maximum safe density of vehicles, when K i,j =K max At that time, the vehicle speed was zero.

[0094] Therefore, in this embodiment, the impact of vehicle density, i.e., vehicle congestion, on vehicle speed is also considered during the scheduling of transport vehicles, which is more practical.

[0095] In this embodiment, the task data to be assigned also includes transportation task information, which includes whether loading and unloading are carried out at the origin and destination, as well as the number of loadings and / or unloadings.

[0096] like Figure 3 As shown, in step S300, the required time for loading and unloading the goods is calculated using the following steps:

[0097] S321: Determine whether loading and unloading should be carried out at the origin and destination based on the transportation task information; for example, one transportation task needs to load at the origin and unload at the destination; while another transportation task needs to load at the origin, unload at the destination and then load again, and then return to the origin to unload again, etc.

[0098] S322: If loading is required, calculate the loading time for this transportation task based on the preset loading time for each loading. Here, the preset loading time for each loading can be a uniform time, which can be determined by statistically analyzing the average loading time of each transportation vehicle in historical data. When calculating the loading time, multiply the preset loading time for each loading by the number of times loading is required in this transportation task to obtain the loading time for this transportation task.

[0099] Alternatively, different loading times can be set for different quay cranes and stacker cranes. The preset loading time for each location can be determined by the average loading time of each transport vehicle in the historical data of each location. When calculating the loading time, the loading time for each location is summed to obtain the loading time for this transport task.

[0100] S323: If unloading is required, calculate the unloading time required for this transportation task based on the preset unloading time required for each unloading. The preset unloading time required for each unloading can be a uniform time that can be determined by statistically analyzing the average unloading time of each transportation vehicle in historical data. When calculating the unloading time, multiply the preset unloading time required for each unloading by the number of times unloading is required in this transportation task to obtain the unloading time required for this transportation task.

[0101] Alternatively, different unloading times can be set for different quay cranes and stacker cranes. The preset unloading time for each location can be determined by the average unloading time of each transport vehicle in the historical data of each location. When calculating the unloading time, the unloading time corresponding to each location can be summed to obtain the unloading time required for this transport task.

[0102] S324: Based on the transportation task information, sum the loading time and / or unloading time required in this transportation task to obtain the total loading and unloading time required for the current transportation task. If only loading is required in this transportation task and unloading is not, then sum all loading times required in this transportation task to obtain the total loading and unloading time required for the current transportation task. If only unloading is required in this transportation task and loading is not, then sum all unloading times required in this transportation task to obtain the total loading and unloading time required for the current transportation task.

[0103] Therefore, in this embodiment, the time required for loading and unloading goods is calculated based on the specific loading and unloading information of each transportation task. The time for the transportation vehicle to perform the task is calculated comprehensively, which is more in line with the actual task execution situation and helps to improve the efficiency of vehicle loading and unloading transportation.

[0104] In this embodiment, step S222, calculating the loading time for this transportation task based on the preset loading time for each loading, includes: obtaining the preset loading time and the number of loadings required for each loading at the loading location, and calculating the loading time for this transportation task. For example, if loading only occurs at the starting location, the preset loading time for each loading at the starting location is multiplied by the number of loadings required to obtain the loading time for this transportation task; if loading occurs at both the starting and ending locations, the preset loading time for each loading at the starting location is multiplied by the number of loadings required at the starting location, and the preset loading time for each loading at the ending location is multiplied by the number of loadings required at the starting location, and then summed to obtain the unloading time for this transportation task.

[0105] Step S323: Calculate the unloading time required for this transportation task based on the preset unloading time required for each unloading, including: obtaining the preset unloading time and the number of unloading operations required for each unloading location, and calculating the unloading time required for this transportation task. For example, if unloading only occurs at the starting point, the preset unloading time required for each unloading at the starting point is multiplied by the number of unloading operations required to obtain the unloading time required for this transportation task; if unloading occurs at both the starting and ending points, the preset unloading time required for each unloading at the starting point is calculated separately multiplied by the number of unloading operations required at the starting point, and the preset unloading time required for each unloading at the ending point is calculated separately multiplied by the number of unloading operations required at the starting point, and then summed to obtain the unloading time required for this transportation task.

[0106] like Figure 4 As shown, in step S300, the waiting time for loading and unloading goods is as follows:

[0107] S331: Determine whether loading and unloading should be carried out at the origin and destination based on the transportation task information;

[0108] S332: If loading is required, the loading waiting time shall be calculated based on the start time of the loading location's availability and the time the transport vehicle arrives at the loading location; for example, if loading is required at the origin and / or destination, the waiting time for loading at one location shall be calculated as follows: in, This indicates the time when the i-th transport vehicle arrives at the loading location (quay crane or yard j). This indicates the idle time at the current loading location (quay crane or yard j), i.e., the end time of the previous transport task loading at this location;

[0109] S333: If unloading is required, the unloading waiting time shall be calculated based on the start time of the unloading location and the time the transport vehicle arrives at the unloading location; for example, if unloading is required at the origin and / or termination location, the waiting time for unloading at one location shall be calculated as follows: in, This indicates the time when the i-th transport vehicle arrives at the unloading location (quay crane or yard j). This indicates the idle time at the current unloading location (quay crane or yard j), i.e., the end time of the previous transport task unloading here;

[0110] S334: The loading waiting time and / or unloading waiting time are summed according to the transportation task information to obtain the waiting time for loading and unloading the goods. If only loading is required in this transportation task and unloading is not, then the waiting time for loading in this transportation task is summed to obtain the waiting time for loading and unloading the goods in this transportation task. If only unloading is required in this transportation task and loading is not, then the waiting time for unloading in this transportation task is summed to obtain the waiting time for loading and unloading the goods in this transportation task.

[0111] In this embodiment, after step S500—selecting the second number of task routes with the longest required time and dispatching a third number of transport vehicles to that task route—the following steps are also included:

[0112] Determine whether the preset task allocation stop condition is met;

[0113] If so, stop assigning tasks, maintain the current task assignment status, and wait until all transport vehicles have completed their assigned transport tasks before the total transport task is completed.

[0114] If not, the time required for the assigned transport vehicles to perform their tasks is recalculated. For each task route, the time required for all transport vehicles corresponding to that route is recalculated. The second-longest task route with the longest required time is reselected, and a third-longest number of transport vehicles are added to the reselected route. That is, the process returns to steps S300 to S500. In other words, the second-longest task route with the longest required time is reselected, and a third-longest number of vehicles are added, until the preset task assignment stop condition is met.

[0115] Furthermore, in this embodiment, before re-executing step S300: calculating the time required for the transport vehicles with assigned tasks to perform their tasks, the execution status of each transport task is also obtained. In step S300, the amount of unexecuted tasks for each transport task is determined based on the execution status of each transport task, and the time required for the corresponding transport vehicles to perform their tasks is calculated based on the amount of unexecuted tasks.

[0116] In one approach, there are two scenarios for stopping task allocation: one is that all transport vehicles have been dispatched and no other vehicles are available; the other is that the maximum operating time increases, meaning that continuing to dispatch more vehicles would actually reduce task execution efficiency. Specifically, determining whether the preset task allocation stopping conditions are met includes the following steps:

[0117] Determine whether all transport vehicles have been assigned transport tasks, meaning that no other transport vehicles can be assigned tasks;

[0118] If so, the preset task allocation stop condition is met, and there is no need to continue dispatching transport vehicles.

[0119] In another approach, determining whether a preset task allocation stop condition is met includes the following steps:

[0120] For mission routes with additional transport vehicles, the execution time of all transport vehicles corresponding to that mission route is calculated again.

[0121] If the time required for a task route after adding transport vehicles is recalculated is greater than the time required for the same task route before adding transport vehicles, then the preset task allocation stop condition is met.

[0122] Adding transport vehicles to a task route might increase vehicle density due to the increased number of vehicles, leading to longer travel times for each vehicle on that route. It could also increase loading / unloading waiting times for each vehicle, resulting in a total time increase for the task route after adding transport vehicles compared to before. In this case, the task route is saturated and there is no need to add more vehicles, thus eliminating the need for further vehicle dispatching.

[0123] These two methods can be used in combination. When it is determined that all transport vehicles have been assigned tasks, or when the required time for the task route increases after additional vehicles are dispatched, the dispatching of transport vehicles should be stopped. If there are still unassigned transport vehicles, and the required time for the task route is effectively controlled and reduced after additional vehicles are dispatched, then steps S300 to S500 can be continued to dispatch more vehicles.

[0124] In this embodiment, after stopping task allocation, the process further includes outputting a transport vehicle operation sequence, which includes the correspondence between each transport vehicle and each transport task. This transport vehicle operation sequence can be viewed by the administrator and can be recorded for later retrieval.

[0125] The following simulation experiment illustrates the technical effects that can be achieved by using the transportation vehicle scheduling method of this embodiment:

[0126] In a single container handling operation, six quay cranes operate for one cargo ship, with an average operation time of approximately 120 seconds per container handling trip. The terminal has 12 yards, each with only one yard crane operating, and each yard crane's average operation time is approximately 180 seconds. A maximum of 80 unmanned container trucks can be deployed simultaneously. To verify the effectiveness of this method, a set of container operation information was randomly generated, as shown in Table 1 below. This indicates that there are [missing information] in this mission. The boxes need to be transported to the J storage yard for storage. This indicates that there are [missing information] in this mission. The container was retrieved from yard J and transported to the cargo ship. j This represents the round-trip path length from the quay crane to yard j.

[0127]

[0128]

[0129] By adopting the transportation vehicle scheduling method of this embodiment, and setting the first quantity, second quantity, and third quantity to 1, the vehicle task arrangement is shown in Table 2 below.

[0130]

[0131] According to the task allocation in Table 2, 11 container yards were assigned tasks, with a total of 66 container trucks scheduled for operations. The operation time for each yard was over 6.3 hours, with yard 6 having the longest operation time at 8.4209 hours. For yards with many tasks, such as yards 5, 6, and 9, this method allowed for more truck operations. For yards with fewer tasks and closer proximity, such as yard 5, this method only required 2 unmanned container trucks. For yards with no tasks, such as yard 8, no trucks were assigned. This outcome aligns with expected operational conditions and is within a reasonable range. Furthermore, the overall operation time is significantly reduced compared to existing scheduling methods, effectively solving the container truck scheduling problem at the container terminal.

[0132] like Figure 5 As shown, this embodiment of the invention also provides a transportation vehicle dispatching system for implementing the transportation vehicle dispatching method described above. The system includes:

[0133] The data acquisition module M100 is used to acquire task data to be assigned, which includes task route information corresponding to multiple transportation tasks to be assigned.

[0134] The task allocation module M200 is used to allocate a first number of transport vehicles to each transport task.

[0135] The time statistics module M300 is used to calculate the time required for the transport vehicles to perform the assigned tasks, and for each task route, to calculate the time required for all transport vehicles corresponding to that task route to perform the tasks.

[0136] The vehicle dispatch module M400 is used to select the second number of mission routes with the longest required time and dispatch a third number of transport vehicles to that mission route.

[0137] In the transportation vehicle dispatching system of the present invention, the functions of each module can be implemented using the specific implementation methods of the transportation vehicle dispatching method described above, which will not be elaborated here. For example, the data acquisition module M100 acquires task data using the specific implementation method of step S100 described above, the task allocation module M200 allocates tasks for the first time using the specific implementation method of step S200 described above, and the specific value of the first quantity can be set as needed. The time statistics module M300 calculates the required time for each transportation task and counts the required time for each task route using the methods of steps S300 and S400 described above, and selects the task route with the longest time to dispatch additional vehicles through step S400. The specific values ​​of the second and third quantities can be set as needed.

[0138] This invention provides a task scheduling algorithm for transporting goods between origin and destination using a transport vehicle scheduling system. After transport tasks are assigned by the data acquisition module M100 and the task allocation module M200, the time statistics module M300 identifies the route with the longest execution time. The vehicle dispatch module M400 then dispatches additional transport vehicles to this route. By gradually increasing the number of transport vehicles, the algorithm ensures that tasks on each route can be completed quickly and stably. The scheduling algorithm is simple, easy to implement, highly stable, and effectively improves transport operation efficiency. This transport vehicle scheduling system can be applied, for example, to a fleet management server at a container terminal, or it can be set up on a separate server and communicate with the fleet management server. When applied to other scenarios, this transport vehicle scheduling method can be applied to the corresponding vehicle management server.

[0139] This invention also provides a transport vehicle scheduling device, including a processor; a memory storing executable instructions of the processor; wherein the processor is configured to perform the steps of the transport vehicle scheduling method by executing the executable instructions.

[0140] Those skilled in the art will understand that various aspects of the present invention can be implemented as systems, methods, or program products. Therefore, various aspects of the present invention can be specifically implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software aspects, collectively referred to herein as a "circuit," "module," or "platform."

[0141] The following reference Figure 6 To describe an electronic device 600 according to this embodiment of the present invention. Figure 6 The electronic device 600 shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.

[0142] like Figure 6 As shown, the electronic device 600 is presented in the form of a general-purpose computing device. The components of the electronic device 600 may include, but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 connecting different system components (including storage unit 620 and processing unit 610), a display unit 640, etc.

[0143] The storage unit stores program code that can be executed by the processing unit 610, causing the processing unit 610 to perform the steps described in the above-described transport vehicle scheduling method section of this specification, according to various exemplary embodiments of the present invention. For example, the processing unit 610 can perform actions such as... Figure 1The steps are shown in the figure.

[0144] The storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 6201 and / or a cache storage unit 6202, and may further include a read-only memory unit (ROM) 6203.

[0145] The storage unit 620 may also include a program / utility 6204 having a set (at least one) program module 6205, such program module 6205 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0146] Bus 630 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0147] Electronic device 600 can also communicate with one or more external devices 700 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 600, and / or with any device that enables electronic device 600 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 650. Furthermore, electronic device 600 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 660. Network adapter 660 can communicate with other modules of electronic device 600 via bus 630. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0148] In the transport vehicle scheduling device, when the program in the memory is executed by the processor, it implements the steps of the transport vehicle scheduling method. Therefore, the device can also achieve the technical effects of the transport vehicle scheduling method.

[0149] This invention also provides a computer-readable storage medium for storing a program that, when executed by a processor, implements the steps of the transport vehicle scheduling method. In some possible implementations, various aspects of the invention can also be implemented as a program product comprising program code that, when executed on a terminal device, causes the terminal device to perform the steps described in the transport vehicle scheduling method section of this specification according to various exemplary embodiments of the invention.

[0150] refer to Figure 7 As shown, a program product 800 for implementing the above-described method according to an embodiment of the present invention is described. It may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may be executed on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto. In this document, the readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, apparatus, or device.

[0151] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0152] The computer-readable storage medium may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The readable storage medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0153] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0154] When the program in the computer storage medium is executed by the processor, it implements the steps of the transportation vehicle scheduling method. Therefore, the computer storage medium can also achieve the technical effects of the transportation vehicle scheduling method.

[0155] The above description, in conjunction with specific preferred embodiments, provides a further detailed explanation of the present invention. It should not be construed that the specific implementation of the present invention is limited to these descriptions. For those skilled in the art, various simple deductions or substitutions can be made without departing from the concept of the present invention, and all such modifications and substitutions should be considered within the scope of protection of the present invention.

Claims

1. A method for dispatching transport vehicles, characterized in that, Includes the following steps: Obtain the task data to be assigned, which includes task route information corresponding to multiple transportation tasks to be assigned; Assign a first number of transport vehicles to each transport task; Calculate the time required for the assigned transport vehicle to perform the task, including: calculating the travel time of the assigned transport vehicle on the task route, the time required for loading and unloading goods, and the waiting time for loading and unloading goods, and summing them to obtain the time required for the transport vehicle to perform the task. For each task route, calculate the time required for all transport vehicles corresponding to that task route to complete the task. Select the second-longest mission route and add a third number of transport vehicles to that route. The following steps are used to calculate the travel time of the assigned transport vehicles on the task route: For a transportation task, for each round trip corresponding to that task, the travel speed *v* of the assigned transportation vehicle on the task route is calculated, including: obtaining the vehicle density and preset optimal vehicle speed on the current task route; and calculating the travel speed of the transportation vehicle on the task route using a linear model based on the vehicle density and preset optimal vehicle speed, using the following formula: ,in, This represents the speed of the i-th transport vehicle traveling between the quay crane and the storage yard j. Indicates the maximum safe density of vehicles. Indicates the vehicle's optimal driving speed. This indicates the vehicle density on the current road segment. Based on the progress of the transportation tasks on the current route and the vehicle allocation, the vehicle density corresponding to each round trip is predicted. Obtain the round-trip path length from the starting point to the ending point in the task route; For each round trip corresponding to this transportation task, the round trip time is calculated based on the travel speed and the path length; The travel time of the transport vehicle on the mission route is obtained by summing up the travel times of the multiple round trips in the transport mission.

2. The method for dispatching transport vehicles according to claim 1, characterized in that, The data to be assigned also includes transportation task information, which includes whether loading and unloading are carried out at the origin and destination, as well as the number of loadings and / or unloadings. The time required for loading and unloading the goods is calculated using the following steps: Based on the transportation task information, determine whether loading and unloading should be carried out at the origin and destination. If loading is required, calculate the loading time for this transportation task based on the preset loading time for each loading. If unloading is required, calculate the unloading time required for this transportation task based on the preset unloading time for each unloading operation; The loading and unloading times for this transportation task are summed based on the transportation task information to obtain the total loading and unloading time for this transportation task.

3. The method for dispatching transport vehicles according to claim 2, characterized in that, The step of calculating the loading time required for this transportation task based on the preset loading time required for each loading includes: obtaining the preset loading time required for each loading and the number of loadings required for the loading location, and calculating the loading time required for this transportation task. The step of calculating the unloading time required for this transportation task based on the preset unloading time for each unloading includes: obtaining the preset unloading time and the number of unloading operations required for each unloading operation corresponding to the unloading location, and calculating the unloading time required for this transportation task.

4. The method for dispatching transport vehicles according to claim 1, characterized in that, The data to be assigned also includes transportation task information, which includes whether loading and unloading are carried out at the origin and destination, as well as the number of loadings and / or unloadings. The following steps are used to calculate the waiting time for loading and unloading goods: Based on the transportation task information, determine whether loading and unloading should be carried out at the origin and destination. If loading is required, the loading waiting time is calculated based on the start time of the loading location's availability and the time the transport vehicle arrives at the loading location. If unloading is required, the unloading waiting time is calculated based on the start time of the unloading site's availability and the time the transport vehicle arrives at the unloading site. The loading waiting time and / or unloading waiting time are summed based on the transportation task information to obtain the loading and unloading waiting time for the goods.

5. The method for dispatching transport vehicles according to claim 1, characterized in that, After selecting the second number of task routes with the longest required time and dispatching a third number of transport vehicles to that route, the process further includes the following steps: Determine whether the preset task allocation stop condition is met; If so, stop assigning tasks; If not, the time required for the assigned transport vehicles to perform their tasks is recalculated. For each task route, the time required for all transport vehicles corresponding to that task route is recalculated. The second-longest task route with the longest required time is selected again, and a third-longest number of transport vehicles are added to the selected task route.

6. The method for dispatching transport vehicles according to claim 5, characterized in that, The determination of whether the preset task allocation stop condition is met includes the following steps: Determine whether all transport vehicles have been assigned transport tasks. If so, then the preset task allocation stop condition is met.

7. The method for dispatching transport vehicles according to claim 5, characterized in that, The determination of whether the preset task allocation stop condition is met includes the following steps: For mission routes with additional transport vehicles, the execution time of all transport vehicles corresponding to that mission route is calculated again. If the time required for a task route after adding transport vehicles is recalculated is greater than the time required for the same task route before adding transport vehicles, then the preset task allocation stop condition is met.

8. The method for dispatching transport vehicles according to claim 5, characterized in that, After stopping the task allocation, the method further includes outputting a transport vehicle operation sequence, which includes the correspondence between each transport vehicle and the transport task.

9. A transportation vehicle dispatching system, characterized in that, The system for implementing the vehicle dispatching method according to any one of claims 1 to 8, the system comprising: The data acquisition module is used to acquire task data to be assigned, which includes task route information corresponding to multiple transportation tasks to be assigned. The task allocation module is used to allocate a first number of transport vehicles to each transport task. The time statistics module is used to calculate the time required for the assigned transport vehicles to perform their tasks, and for each task route, to calculate the time required for all transport vehicles corresponding to that task route to perform their tasks. The vehicle dispatch module is used to select the second number of mission routes with the longest required time, and dispatch a third number of transport vehicles to that mission route.

10. A vehicle dispatching device, characterized in that, include: processor; A memory in which executable instructions of the processor are stored; The processor is configured to execute the steps of the transport vehicle scheduling method according to any one of claims 1 to 8 by executing the executable instructions.

11. A computer-readable storage medium for storing a program, characterized in that, When the program is executed by the processor, it implements the steps of the transportation vehicle scheduling method according to any one of claims 1 to 8.

Images