Group-by-group multi-task combined intelligent site reshipment method

Through the intelligent site backhaul method of multi-task combination of teams, combined with the re-default re-return algorithm and dispatch model, the problems of inefficiency and uneven resource allocation in site backhaul management are solved, and the optimized configuration and cost optimization of multi-tasks are achieved , significantly improves transportation efficiency and cost-effectiveness.

CN118982218APending Publication Date: 2024-11-19HAIBOTAI TECH (QINGDAO) CO LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202411469104.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-21
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The prior art has problems such as inefficiency, uneven resource allocation, and the inability to reduce costs and increase efficiency in site backward management, especially in the case of multi-tasks, which are difficult to achieve overall coordination and cost optimization.

Method used

Using the intelligent field back-of-the-spot method of multi-task combination of teams, the average cost calculation and sorting is achieved by obtaining planning data, combining the dispatch model and branch bounding algorithm to achieve the optimal binding between vehicles and plans and Resource configuration, establish a mixed integer planning model to achieve the optimal dispatch plan.

Benefits of technology

It significantly improves transportation efficiency and cost-effectiveness. Through the lowest average distance cost and maximum vehicle utilization, it realizes the optimized configuration of multi-tasks and efficient utilization of resources, reducing transportation costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982218A_ABST
    Figure CN118982218A_ABST
Patent Text Reader

Abstract

The invention discloses a team-by-team multi-task combined smart site reshipment method, which relates to the technical field of smart site reshipment and comprises the following steps: S1, acquiring plan data; and S2, according to the obtained plan data, carrying out average cost calculation on any plan combination scheme, sorting the average cost of different schemes by adopting a'deduplication and return 'thought, and selecting a combination mode with the minimum cost to bind the plan. The method for optimizing the port plans and the teams by using the deduplication and deduplication algorithm comprises but is not limited to selection of a deduplication and deduplication transportation mode, a binding mode between plans, a standard for unifying average distance cost and the like; specific implementation modes of the port loader and the tilting cart by using the dispatching model include but are not limited to model structures, plans, standards directly matched with teams and groups, constraints related to the tilting cart and the loader and the like.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of smart site transportation technology, and in particular to a smart site transportation method with a multi-task combination of shifts and groups. Background Art

[0002] With the continuous development of various industries, especially in the fields of manufacturing, construction, service, and transportation, the demand for efficient and accurate dispatch management is growing. Traditional dispatch methods often have problems such as low efficiency and uneven resource allocation, and have gradually failed to meet the management needs of modern enterprises. With the rapid development of technologies such as artificial intelligence, big data, and cloud computing, strong technical support has been provided for smart dispatch. These high-tech technologies have made dispatch management automated and intelligent. The system will be able to more accurately predict customer needs and service resources, automatically generate more scientific and reasonable dispatch plans, and more efficient and accurate dispatch management services.

[0003] In logistics and transportation, the traditional transportation mode is "heavy out and light back", that is, after the goods are transported from one place to another, the return vehicles are often empty or loaded with less goods, which largely causes unnecessary waste of resources and increases transportation costs. With the rapid development of the logistics industry and the extensive research and application of intelligent technologies, companies are paying more and more attention to reducing logistics costs and improving transportation efficiency. Therefore, the "heavy out and heavy back" mode came into being, that is, the return vehicles are also loaded with goods as much as possible to optimize resource utilization and reduce transportation costs.

[0004] As a key link in the industrial production process, the current operation mode of site transfer relies on the immediate judgment of on-site workers, manually arranging the handling plan and allocating the operating equipment through the transfer management system. However, this mode often fails to achieve the optimal allocation of resources and collaborative operations efficiently, and cannot achieve the goal of reducing costs and increasing efficiency. To this end, it is urgent to introduce intelligent and automated optimization strategies to form an optimal transfer plan that coordinates the overall situation and is collaborative and efficient, thereby significantly improving operating efficiency and increasing cost-effectiveness. At the same time, a highly intelligent, data-driven optimization algorithm is needed, which can accurately analyze the needs of the dispatched tasks and the real-time status of transportation resources (such as vehicles, drivers, etc.). In particular, it can effectively combine the transportation mode of going and returning, accurately match the starting point and end point of cargo transportation, maximize the loading rate of return vehicles, and reduce the empty driving rate, thereby significantly improving transportation efficiency and reducing logistics costs in the entire transportation operation process.

[0005] Implementation of existing technology: (1) Most ports and construction sites still use the model of manually going to the site to arrange work tasks, assigning teams based on the actual situation on site, and formulating specific vehicle numbers and transshipment plans.

[0006] (2) The invention patent with the patent publication number CN112052991A discloses an AGV re-entry and re-exit path planning method for an automated container terminal with a quay crane buffer zone. In port operations, a AGV re-entry and re-exit path planning method for an automated container terminal with a quay crane buffer zone is proposed. This method adds a quay crane buffer zone, and on this basis, an AGV re-entry and re-exit scheduling model is constructed to provide two-way container transportation between the quay crane and the yard, avoid the phenomenon of AGV empty load, and thus improve the efficiency of the terminal transportation link.

[0007] (3) The invention patent with the patent publication number CN114326623A discloses a scheduling method for AGV operations under automated terminal quay cranes. This method solves the problem of empty load when the same AGV performs loading and unloading operations at different quay cranes and goes to the interactive lane of the loading quay crane to deliver containers. After the delivery operation is completed, it needs to leave the operation area under the loading quay crane as soon as possible and enter the buffer zone, and then depart from the buffer zone to the unloading quay crane or yard to collect containers. A new scheduling method is provided to optimize the operation of AGV under the quay crane: after the AGV enters the operation area under the loading quay crane with a heavy load to unload, it directly enters the operation area under the unloading quay crane to load and then leaves, realizing the heavy entry and exit of AGVs under different quay cranes, thereby reducing the empty load rate of AGV and improving its efficiency in collecting containers.

[0008] Disadvantages of existing technology: Manually making plans for removal and allocating equipment is inefficient. Only some of the planned tasks can be arranged, making it difficult to achieve the planned goals of overall coordination, cost reduction and efficiency improvement. Most plans arranged by manual command are one-way plans, that is, after arranging the dump truck from point A to point B to complete the loading task, the dump truck will return to point A empty, resulting in low utilization efficiency of the dump truck and cost losses.

[0009] The existing patented technology still solves the next task after completing one task, without considering the combined transportation between plans. This makes the existing technology unable to meet the needs of multi-task situations.

[0010] Although the existing patented technology solves the empty-load problem by re-delivery and re-return, it does not follow the most cost-saving goal-oriented re-delivery and re-return transportation mode in the entire planning process. This may lead to falling into a local optimum and failing to achieve the global optimum.

[0011] The existing patented technology simply allocates all tasks together without considering the situation of working in groups. This makes the planning results impossible to apply in actual situations, resulting in poor adaptability of the existing patented technology to actual conditions. Summary of the invention

[0012] The purpose of the present invention is to solve the above-mentioned technical problems and to propose a smart site transportation method with multi-task combination of shifts and groups.

[0013] In order to achieve the above object, the present invention adopts the following technical solutions: A smart site transportation method with multi-task combination of shifts and groups, comprising the following steps: S1, obtain planning data; S2, based on the acquired plan data, calculate the average cost of any plan combination scheme and use the "remove and return" idea to sort the average costs of different schemes, and select the combination with the minimum cost to bind the plan; S3, plan combination information, which is used to combine the bound plan data with the team, dump bucket and loader information, and arrange the vehicle to execute the "re-go and re-return" transportation mode; S4, through the dispatch model, one-click assignment of plans is achieved according to job requirements and the currently executed plans and vehicle conditions. A mixed integer programming model is established and a branch and bound algorithm is used to obtain the corresponding optimal dispatch plan.

[0014] Preferably, the planning data includes transshipment type, cargo type, cargo characteristics, starting and ending locations, transportation volume, and cut-off time.

[0015] Preferably, the combination scheme in S2 is: Solution 1: Adopt the idea of ​​re-doing and re-re-doing, bind the three plans together until one of them is completed, and complete the unfinished plans independently; Solution 2: Adopt the idea of ​​re-deletion and re-return, bind the three plans until one plan is completed, and continue to bind the remaining two plans until all plans are completed; Plan 3: Adopt the idea of ​​re-deletion and re-return, and execute the three plans independently.

[0016] Preferably, the dispatch model includes a first layer of the dispatch model. Through the first layer of the dispatch model, the most evenly planned benefits, the highest execution efficiency, and the allocation of as many loaders and dump trucks as possible are optimized to achieve one-click binding of vehicles and the planned "re-go and re-return" transportation mode.

[0017] Preferably, the dispatch model also includes a second layer of the dispatch model. Through the second layer of the dispatch model, the nearest allocation of loaders and dump trucks is taken as the optimization goal, and the refined scheduling and management of transport vehicles is achieved in accordance with the principle of task fairness.

[0018] Preferably, the acquisition of plan data also includes data import and preprocessing, and the data import and preprocessing enable the input data to be tested for missing values ​​and filled, abnormal values ​​to be identified and processed, and duplicate values ​​to be eliminated.

[0019] Preferably, the first layer of the dispatch model is provided with constraints and objective functions. The constraints of the first layer of the dispatch model are planning constraints and driving constraints. The objective function of the first layer of the dispatch model is used to calculate the minimum profit variance and the highest efficiency.

[0020] Preferably, the second layer of the dispatch model is provided with constraints and objective functions. The constraints of the second layer of the dispatch model are team constraints and service constraints. The objective function of the second layer of the dispatch model is used for the nearest allocation of vehicles and task fairness.

[0021] Compared with the prior art, the present invention has the following beneficial effects: 1. Through the intelligent dispatching system and the re-entry and re-entry algorithm, the optimal assignment task is obtained with the lowest average journey cost and the maximum vehicle utilization rate as the goal.

[0022] 2. The re-go and re-return algorithm sacrifices a smaller distance in exchange for the empty running distance, and bundles multiple plans together as much as possible according to the plan requirements. Take three plans as an example. After completing the task from point A to point B, choose to go to point C to complete the task from C→D, then go from point D to point E to complete the loading task from E→F, and finally return to point A to maximize the use efficiency of the vehicle. While allocating tasks, it will ensure the average utilization rate of each vehicle.

[0023] 3. After combining multiple plans, use three different dispatching plans to calculate the average cost respectively, and select the plan with the smallest average cost. The dispatching arrangement obtained by comparing the three plans will definitely be better than the dispatching arrangement without re-stripping or simply combining two plans and re-stripping.

[0024] 4. The team allocation model allocates all work plans among the teams and calculates the number of loaders and dump trucks required for each plan. The re-de-re-re-entry algorithm calculates multiple plans in a coordinated manner to obtain the optimal task combination, thereby achieving the optimal configuration of the entire plan task.

[0025] In summary, the present invention uses the re-entry algorithm to optimize the port plan and work team, including but not limited to the selection of re-entry transportation mode, the bundling method between plans, the standard of unified average distance cost, etc.; uses the dispatch model to implement the specific implementation of port loaders and dump trucks, including but not limited to the model structure, the standard of direct matching between plans and teams, the constraints related to dump trucks and loaders, etc. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 A scheme diagram of a smart site transportation method with a multi-task combination of shifts and groups proposed by the present invention; Figure 2 This is a flow chart of a smart site transshipment method with multi-task combination divided into shifts proposed by the present invention. DETAILED DESCRIPTION

[0027] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments.

[0028] Reference Figure 1-Figure 2 , a smart site transportation method with multi-task combination of shifts and groups, comprising the following steps: S1, obtain planning data; S2, based on the acquired plan data, calculate the average cost of any plan combination scheme and use the "remove and return" idea to sort the average costs of different schemes, and select the combination with the minimum cost to bind the plan; S3, plan combination information, which is used to combine the bound plan data with the team, dump bucket and loader information, and arrange the vehicle to execute the "re-go and re-return" transportation mode; S4, through the dispatch model, one-click assignment of plans is achieved according to job requirements and the currently executed plans and vehicle conditions. A mixed integer programming model is established and a branch and bound algorithm is used to obtain the corresponding optimal dispatch plan.

[0029] In the present invention, the planning data includes transshipment type, cargo type, cargo characteristics, start and end locations, transportation volume, and cut-off time.

[0030] In the present invention, the combination scheme in S2 is: Solution 1: Adopt the idea of ​​re-doing and re-re-doing, bind the three plans together until one of them is completed, and complete the unfinished plans independently; Solution 2: Adopt the idea of ​​re-deletion and re-return, bind the three plans until one plan is completed, and continue to bind the remaining two plans until all plans are completed; Plan 3: Adopt the idea of ​​re-deletion and re-return, and execute the three plans independently.

[0031] In the present invention, the dispatch model includes a first layer of the dispatch model. Through the first layer of the dispatch model, the most evenly planned benefits, the highest execution efficiency, and the allocation of as many loaders and dump trucks as possible are optimized to achieve one-click binding of vehicles and the planned "heavy going and heavy returning" transportation mode.

[0032] In the present invention, the dispatch model also includes a second layer of the dispatch model. Through the second layer of the dispatch model, the nearest allocation of loaders and dump trucks is taken as the optimization goal, and the refined scheduling and management of transportation vehicles are achieved in accordance with the principle of task fairness.

[0033] In the present invention, the acquisition of planned data also includes data import and preprocessing, and the data import and preprocessing enable the input data to be tested for missing values ​​and filled, abnormal values ​​to be identified and processed, and duplicate values ​​to be eliminated.

[0034] In the present invention, the first layer of the dispatch model is provided with constraints and objective functions. The constraints of the first layer of the dispatch model are planning constraints and driving constraints. The objective function of the first layer of the dispatch model is used to calculate the minimum variance of the benefits and the highest efficiency.

[0035] In the present invention, the second layer of the dispatch model is provided with constraints and objective functions. The constraints of the second layer of the dispatch model are team constraints and service constraints. The objective function of the second layer of the dispatch model is used for the proximity allocation of vehicles and task fairness.

[0036] Implementation process of the overall technical solution of the present invention This model fully considers the vehicle allocation problem under the situation of divided shifts. First, the algorithm of de-reintegration is designed to obtain the planning information, and then a two-layer vehicle scheduling model is established to allocate resources for the site transshipment plan with the core goal of increasing efficiency. Through the algorithm of de-reintegration, the binding information between plans is obtained according to different plans with the goal of minimizing the average cost. The intelligent dispatching module realizes one-click assignment of plans according to the job requirements and the currently executed plans and vehicle conditions, establishes a mixed integer programming model and adopts the branch and bound algorithm to obtain the corresponding optimal dispatching plan.

[0037] The specific process is as follows: Obtain the planned task data, including transshipment type, cargo type, cargo characteristics, starting and ending locations, transportation volume, deadline, etc. According to the planned data, calculate the average cost of any plan combination scheme, sort the average costs of different schemes, and select the combination with the minimum cost to bind the plan. With the main purpose of reducing empty vehicle runs, considering factors such as stack distance, vehicle distribution and cargo types, give priority to arranging vehicles to implement the "re-go and re-return" transportation mode.

[0038] The dispatch model obtains the "return and return" binding results, obtains the mechanical resources of the team and their location distribution information, and through the first layer of the dispatch model, takes the most evenly planned benefits, the highest execution efficiency, and the allocation of loaders and dump trucks as much as possible as the optimization goal, so as to achieve one-click binding between vehicles and plans. Next, the planner confirms the assignment results and issues instructions. Through the second layer of the dispatch model, the nearest allocation of loaders and dump trucks is taken as the optimization goal, and in accordance with the principle of task fairness, the refined scheduling and management of transportation vehicles is achieved. According to the types and quantities of terminal vehicles and loading and unloading equipment, the vehicles are dynamically supervised through real-time positioning to improve the efficiency of handling and effectively control the cost of transshipment.

[0039] Data acquisition and preprocessing Data acquisition: record and store planning information, port and terminal stacking positions, vehicles, yards and other data.

[0040] Data import and preprocessing: detect and fill missing values ​​in input data, identify and process outliers, and eliminate duplicate values.

[0041] Re-entry algorithm Solution design: Solution 1: First, go back and forth on multiple plans until a plan is completed, and then complete the unfinished plans independently.

[0042] Option 2: Continue to implement the strategy of going back and forth until all plans are completed.

[0043] Option 3: The three plans are carried out independently.

[0044] enter: The planned distance, workload, starting and ending positions and other information.

[0045] Combining the three plans, there are a total of possible combinations, and The average cost of the three possible combinations is calculated.

[0046] The above three plans are combined and the calculated average costs are sorted, and the plan combination with the smallest average path cost is selected using the greedy strategy.

[0047] Repeat the above process until the plan is completed.

[0048] All plans are arranged and the grouping information between plans is obtained.

[0049] The first level of the dispatch model Variable parameter setting: Total number of plans , Number of teams , the number of dump trucks and loaders in each team.

[0050] Decision variables:

[0051]

[0052]

[0053] Objective function and constraints Objective function: The planned benefits are most evenly distributed, that is, the team's planned benefits are the smallest

[0054] Highest efficiency in plan execution

[0055] As many distribution plans as possible

[0056] Assign as many loaders as possible

[0057] in, Display items The value of Display items The priority coefficient of .

[0058] Constraints: The total number of dump trucks required by each team cannot exceed the total number of dump trucks of the team

[0059] Each plan can be assigned to at most one team

[0060]

[0061]

[0062] Loader allocation restrictions are the same as dump trucks

[0063] Meet the needs of dump trucks as much as possible

[0064]

[0065]

[0066] Restrict the relationship between decision variables yij and xij

[0067]

[0068] Relationship between the minimum number of dump trucks and loaders

[0069] Loader meets safety distance

[0070] The number of dump trucks in each plan shall not be less than the number of loaders

[0071] in, represents a sufficiently large number, Indicates team The number of loaders in Indicates the minimum number of dump trucks, Indicates The time spent on the planned journey, Indicates The time it takes to load a plan once, Indicates The length of the plan, Indicates the loader safety distance.

[0072] Model solving and result saving The results are: the matching between each plan and the team, and how many loaders and dump trucks are allocated to each plan matched by the team.

[0073] Second level of the dispatch model Variable parameter setting, total number of plans , Total number of dump trucks , total number of loaders .

[0074] Decision variables:

[0075]

[0076] Objective function and constraints Objective Function Loaders are assigned to the nearest location (with minimal allocation time consumption)

[0077] Trucks are assigned to the nearest location (with minimal time consumption)

[0078] Task fairness principle

[0079] in, Indicates loader Go to plan from current location Time spent, Dump truck Go to plan from current location Time spent, Indicates The historical mission volume of dump trucks, Indicates A planned amount of tasks.

[0080] Constraints Each plan only dispatches vehicles within the team

[0081] If the plan Assigned to Team, then responsible for planning Dump truck and Loader Must also belong to the team , ensuring that tasks within the same plan can only be completed by the same team that matches the plan.

[0082] The number of dump trucks allocated in the plan can only be reduced or increased on the original basis, and cannot be replaced (dynamic adjustments are made to the vehicles within the team taking into account the new tasks and the current plan progress)

[0083]

[0084]

[0085] Ensure that a dump truck intelligently serves a plan

[0086] Ensure that one loader can only serve one project

[0087] in, Indicates the original Does the dump truck serve the plan? 0 or 1 variable, Indicates the original Does the loader serve the plan? 0 or 1 variable, Indicates the original Does the dump truck serve the plan? 0 or 1 variable, Indicates The number of dump trucks required for each plan.

[0088] Model solving and result saving The result is: the planned allocation of dump trucks and loaders.

[0089] Combination Figure 2 , describing the detailed implementation process of the technical solution of the embodiment.

[0090] (1) The operating system sends planning information to the device control system.

[0091] (2) The equipment control system checks the task category and determines whether relocation is required.

[0092] (3) The plans that need to be transported are bound to the teams through the team allocation model, and loaders and dump trucks are allocated to each plan.

[0093] (4) The tasks within each team are combined according to the average distance cost, and dump trucks and loaders are arranged to go to the starting stack to carry out preparation work.

[0094] (5) According to the allocation, the dump truck and loader start working. The staff determines the location of the dump truck and loader through sensors, monitors the progress of the work through on-site images, and makes adjustments to various situations that may arise.

[0095] (6) Complete the entire operation process.

[0096] The technical solution proposed by the present invention has the following beneficial effects: Intelligent scheduling, efficient collaboration: By adopting advanced dispatching models, we can accurately calculate the optimal configuration of dump trucks and loaders required for each plan, thereby ensuring efficient use of resources. Furthermore, by using the de-re-return algorithm to subtly connect multiple work plans, we have achieved seamless docking of the work process and optimal scheduling of resources, which not only significantly improved the efficiency of on-site operations, but also promoted the coordination and fluency of the overall work process.

[0097] Accurate matching and cost optimization: By applying the dispatch model and the algorithm of re-deletion and re-return, we can accurately match the teams and plans based on detailed data analysis, achieve the optimal allocation of human resources, and thus significantly reduce the labor cost of on-site operations. In addition, the algorithm aims to minimize vehicle idle driving, intelligently plans vehicle routes, ensures that vehicle resources are fully utilized, and further achieves effective cost savings.

[0098] The core technology of the present invention is: 1. The concept of average cost and the method of plan selection. First of all, in reality, the number of plans and the amount of information they contain are generally very large. If integer programming is performed entirely using integer programming solvers, it will exceed the computing power of the computer. In addition, integer programming solvers are not universal and cannot guarantee stable calculation results. Therefore, the concept of average cost is proposed. The concept of average cost can unify the standards for the combination of different routes and different workloads, and combine with the greedy algorithm to effectively select plans.

[0099] 2. Effectively avoid the disadvantages of re-entry. First of all, the re-entry strategy has stable benefits. In the algorithm, multiple plans are combined, and the average cost is calculated according to three different dispatching plans, and the plan with the smallest average cost is selected. The dispatch arrangement obtained by comparing the three plans will definitely be better than the dispatch arrangement without re-entry or simply combining two plans and re-entry. Because the essence of re-entry is to sacrifice the distance from the end of one plan to the starting point of another plan in exchange for the empty running volume from the end point to the starting point in one plan, but once the two plans are very far apart, then this sacrifice is unnecessary, so blindly re-entry is not feasible. Therefore, the measure of comparing the three plans (including implementing re-entry, partially re-entry, and not re-entry) can ensure that re-entry can definitely reduce the distance cost and avoid the disadvantages of re-entry.

[0100] 3. The proposal and application of group work. In the fields of manufacturing, construction and transportation, due to various practical constraints, there are often multiple contractors or teams responsible for transshipment. Different contractors or teams need to meet certain conditions when allocating tasks. If they are simply mixed together for calculation, it may cause uneven distribution, leading to adverse consequences. Therefore, a team allocation model is proposed. This model will fully consider various practical situations and reasonably allocate tasks to various contractors or teams according to the set rules, so that the allocation results can be accepted by all parties.

[0101] The present invention protects a method for optimizing port plans and shifts using a de-re-return algorithm, including but not limited to the selection of de-re-return transport modes, bundling methods between plans, and a standard for unifying average journey costs.

[0102] The present invention protects specific implementation methods of using a dispatch model for port loaders and dump trucks, including but not limited to model structure, standards for direct matching of plans and teams, constraints related to dump trucks and loaders, etc.

[0103] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can make equivalent replacements or changes according to the technical scheme and inventive concept of the present invention within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A smart site transportation method with multi-task combination of shifts and groups, characterized in that: The following steps are involved: S1, obtain planning data; S2, based on the acquired plan data, calculate the average cost of any plan combination scheme and use the "remove and return" idea to sort the average costs of different schemes, and select the combination with the minimum cost to bind the plan; S3, plan combination information, which is used to combine the bound plan data with the team, dump bucket and loader information, and arrange the vehicle to execute the "re-go and re-return" transportation mode; S4, through the dispatch model, one-click assignment of plans is achieved according to job requirements and the currently executed plans and vehicle conditions. A mixed integer programming model is established and a branch and bound algorithm is used to obtain the corresponding optimal dispatch plan.

2. According to claim 1, a smart site transportation method with multi-task combination of shifts and groups, characterized in that: The planning data includes transshipment type, cargo type, cargo characteristics, starting and ending locations, transportation volume, and cut-off time.

3. According to claim 1, a smart site transportation method with multi-task combination of shifts and groups, characterized in that: The combination scheme in S2 is: Solution 1: Adopt the idea of ​​re-doing and re-re-doing, bind the three plans together until one of them is completed, and complete the unfinished plans independently; Solution 2: Adopt the idea of ​​re-deletion and re-return, bind the three plans until one plan is completed, and continue to bind the remaining two plans until all plans are completed; Plan 3: Adopt the idea of ​​re-deletion and re-return, and execute the three plans independently.

4. According to claim 1, a smart site transportation method with multi-task combination of shifts and groups, characterized in that: The dispatch model includes a first layer of the dispatch model. Through the first layer of the dispatch model, the most evenly planned benefits, the highest execution efficiency, and the allocation of as many loaders and dump trucks as possible are optimized to achieve one-click binding of vehicles and the planned "heavy going and heavy returning" transportation mode.

5. According to claim 1, a smart site transportation method with multi-task combination of shifts and groups, characterized in that: The dispatch model also includes a second layer of the dispatch model. Through the second layer of the dispatch model, the nearest allocation of loaders and dump trucks is taken as the optimization goal, and the refined scheduling and management of transportation vehicles is achieved in accordance with the principle of task fairness.

6. The intelligent site transportation method with multi-task combination of shifts and groups according to claim 1 is characterized in that: The acquisition of planned data also includes data import and preprocessing, wherein the data import and preprocessing detect and fill missing values, identify and process abnormal values, and eliminate duplicate values ​​for the input data.

7. The intelligent site transportation method with multi-task combination of shifts and groups according to claim 4 is characterized in that: The first layer of the dispatch model is provided with constraints and objective functions. The constraints of the first layer of the dispatch model are planning constraints and driving constraints. The objective function of the first layer of the dispatch model is used to calculate the minimum variance of the benefits and the highest efficiency.

8. The intelligent site transportation method with multi-task combination of shifts and groups according to claim 5 is characterized in that: The second layer of the dispatch model is provided with constraints and objective functions. The constraints of the second layer of the dispatch model are team constraints and service constraints. The objective function of the second layer of the dispatch model is used for the nearest allocation of vehicles and task fairness.

Citation Information

Patent Citations

  • Method and system for improving use efficiency of container based on big data application

    CN113902197A

  • Method and device for determining cargo transportation scheme, equipment and medium

    CN114781972A

  • Multi-task joint scheduling method based on graph model

    CN115018185A

  • Emergency material scheduling method considering road traffic constraint

    CN115796418A

  • Port collecting and distributing vehicle dispatching matching method and system

    CN116402309A