Port transport vehicle dynamic scheduling management method and system
By using the A-Star algorithm to optimize the transportation path and unloading location in port transportation, the problem of failure to effectively consider the unloading location and transportation path selection in the prior art is solved, which improves transportation efficiency and reduces the risk of congestion.
Patent Information
- Application Number
- CN202410928162.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-11
- Publication Date
- 2024-11-15
AI Technical Summary
The prior art fails to effectively consider the comprehensive choice of unloading location and transportation path in port unloading transportation, resulting in inefficient transportation and operating efficiency.
The A-star algorithm is used to search for predicted paths in the road network diagram, and the estimated cost is determined based on the path length, congestion degree and unloading position status, and the target transportation path with the smallest overlap in the total path is selected to optimize the dispatch of transport vehicles.
By optimizing the selection of transportation paths and unloading locations, the mutual influence and intersection between driving vehicles is reduced, the risk of congestion is reduced, and transportation efficiency is improved.
Smart Images

Figure CN118966604A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of port vehicle dispatching planning, and in particular to a method and system for dynamic dispatching management of port transport vehicles. Background Art
[0002] Smart ports are the main direction of port renewal and transformation. They use emerging information technologies such as the Internet, big data, and artificial intelligence to innovate and integrate port-related businesses and management, thereby optimizing port production and operation processes. This innovation transforms port development from relying mainly on increasing resource input in the past to relying mainly on scientific and technological progress and management innovation, thereby systematically improving port operating efficiency and service value-added. In the construction of smart ports, port unloading and transportation is an important component. Through scientific scheduling management and reasonable assignment of transportation vehicles' operating tasks and driving routes, the efficiency of unloading and transportation can be improved and the operating cost of the unloading and transportation fleet can be reduced.
[0003] Normally, for large quantities of cargo distribution, ports need to assign a large number of transport vehicles to transport cargo cabinets such as containers unloaded from cargo ships to multiple designated storage locations for unloading. In order to make full use of the free space in the port area, the distribution of multiple unloading locations in the port area is not concentrated enough. In the prior art, in order to facilitate scheduling and make full use of the unloading location, the goods are usually directly transported to an unloading location according to a fixed route for storage, so that one location is filled first. However, this traditional scheduling method does not take into account the impact of the busy and congested roads in the port on the efficiency of cargo transportation. The transport vehicles that are delayed due to congestion will also affect the unloading rhythm of the vehicle and subsequent transport vehicles at the unloading location, which will affect the port's operating efficiency. Therefore, how to comprehensively consider the choice of unloading location and the choice of transportation route for the transport vehicle to schedule the transport vehicle is an urgent problem to be solved. Summary of the invention
[0004] The present invention provides a method and system for dynamic dispatch management of port transport vehicles, which are used to solve the defect in the prior art that it is difficult to consider the unloading position for path planning, and achieve the effect of improving the transport efficiency.
[0005] The present invention provides a method for dynamic dispatching and managing port transport vehicles, comprising:
[0006] Upon receiving an instruction that the cargo loading of the target transport vehicle is complete, determining the current transport starting point position of the target transport vehicle and available unloading positions;
[0007] Determine the starting node corresponding to the transport starting point of the target transport vehicle in the road network diagram, and the ending nodes corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is drawn based on the road status of the port area;
[0008] Using the A-star algorithm, starting from the starting node, searching for nodes corresponding to each road section in the road network graph until each terminating node is obtained, and obtaining each predicted path from the starting node to each terminating node and an estimated cost corresponding to each predicted path; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level, and the unloading state of the unloading location;
[0009] Based on the road network graph, determining the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation;
[0010] Based on the estimated costs corresponding to the predicted paths and the total path overlap, a target transport path sent to the target transport vehicle is determined from the predicted paths, and an actual unloading location is determined based on the target transport path.
[0011] According to a method for dynamic dispatching management of port transport vehicles provided by the present invention, the A-star algorithm is used to search for nodes corresponding to each road section in the road network graph from the starting node until each terminal node is obtained, and each predicted path from the starting node to each terminal node and the estimated cost corresponding to each predicted path are obtained, including:
[0012] Using the A-star algorithm, the nodes adjacent to the starting node are put into an open list, and the known cost between the starting node and the nodes put into the open list is obtained;
[0013] Based on the nodes in the open list, the adjacent nodes are continuously searched and put into the open list, and based on the straight-line distance between the nodes in the open list and the starting node, the abandoned nodes are screened and put into the closed list from the open list; the abandoned nodes are used to represent the nodes far away from the unloading location during the search process;
[0014] Continuously updating new nodes put into the open list and known costs between the nodes in the open list and the start node until the node put into the open list becomes the end node;
[0015] The end node is traced back to the start node, and a predicted path is obtained based on the nodes between the start node and the end node, and the known cost between the end node and the start node is used as the estimated cost corresponding to the predicted path.
[0016] According to a method for dynamic dispatching and management of port transport vehicles provided by the present invention, the estimated cost corresponding to the predicted path is determined by:
[0017] Determining the known costs between the nodes based on the distances between the nodes between the starting node and the ending node and the degree of congestion; the degree of congestion is determined based on the number of transport vehicles and the width of the road between the nodes;
[0018] Sum the known costs between the nodes to obtain the total known cost between the starting node and the ending node;
[0019] Based on the total known cost and the unloading status of the unloading location corresponding to the terminal node, the estimated cost corresponding to the predicted path is obtained; the unloading status includes the remaining cargo storage volume at the unloading location and the cargo volume to be unloaded.
[0020] According to a method for dynamic dispatching and management of port transport vehicles provided by the present invention, the estimated cost corresponding to the predicted path is determined by the following formula:
[0021]
[0022] Among them, C total is the total estimated cost of the predicted path; n is the total number of nodes on the path, d i is the length of the i-th road segment, v i is the average speed of vehicles on the i-th road, wi is the weight coefficient of the congestion degree of the i-th road, C unload is the cost associated with the unloading state of the unloading location corresponding to the terminal node.
[0023] According to a method for dynamic scheduling management of port transport vehicles provided by the present invention, the method of screening abandoned nodes based on the straight-line distance between the nodes in the open list and the starting node comprises:
[0024] Determine the straight-line distance between the current node in the open list and the starting node;
[0025] When the straight-line distance is less than a distance threshold, the current node is determined as the abandoned node; the distance threshold is determined based on the number of nodes between the current node and the starting node.
[0026] According to a method for dynamic dispatching management of port transport vehicles provided by the present invention, the target transport path sent to the target transport vehicle is determined from each predicted path based on the estimated cost corresponding to each predicted path and the total path overlap, including:
[0027] Based on the cost threshold and the estimated cost corresponding to each predicted path, an initial target transportation path is selected from each predicted path;
[0028] The path with the smallest total path overlap among the initial target transportation paths is used as the target transportation path.
[0029] According to a method for dynamic dispatching management of port transport vehicles provided by the present invention, the total path overlap between each predicted path and the path of the transport vehicle to which the path allocation has been completed currently is determined based on the road network diagram, including:
[0030] Determine the nodes covered by each predicted path in the road network graph, and determine the nodes covered by the path of the transport vehicle that has currently completed the path allocation in the road network graph;
[0031] Determine respectively the first road section between the nodes covered by each predicted path and the second road section between the nodes covered by the path of the transport vehicle that has currently completed the path allocation;
[0032] respectively determining the total length of the overlapping sections between the first sections covered by each predicted path and each second section;
[0033] Based on the total length of the overlapping road sections corresponding to the predicted paths, the total path overlap between the predicted paths and the paths of the transport vehicles that have currently completed the path allocation is determined.
[0034] According to a method for dynamic dispatching and managing port transport vehicles provided by the present invention, the road network diagram is determined by:
[0035] Based on the road status of the port area, determine the distribution positions of the roads in the port area and the distribution positions of the intersections set in the roads, and divide the roads in the port area into sections according to the intersections;
[0036] Based on the positions of various road sections, cargo ship unloading positions, transport vehicle unloading positions and transport vehicle parking positions, road nodes are set and the road network diagram is obtained.
[0037] The present invention also provides a port transport vehicle dynamic dispatching and management system, comprising:
[0038] A response module, for determining the current transport starting point position and available unloading positions of the target transport vehicle upon receiving an instruction that the cargo loading of the target transport vehicle is completed;
[0039] A node confirmation module is used to determine the starting node corresponding to the transport starting point of the target transport vehicle in the road network diagram, and the ending nodes corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is drawn based on the road status of the port area;
[0040] A path planning module, configured to use the A-star algorithm to search for nodes corresponding to each road section in the road network diagram starting from the starting node until each terminating node is obtained, and obtain each predicted path from the starting node to each terminating node and an estimated cost corresponding to each predicted path; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level, and the unloading state of the unloading location;
[0041] A processing module, for determining, based on the road network diagram, each total path overlap between each predicted path and the path of the transport vehicle to which the path allocation has been completed;
[0042] The scheduling module is used to determine a target transport path sent to the target transport vehicle from each predicted path based on the estimated cost corresponding to each predicted path and the total path overlap, and determine an actual unloading location based on the target transport path.
[0043] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method for dynamic scheduling and management of port transport vehicles as described above is implemented.
[0044] The present invention also provides a non-transitory computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the method for dynamic scheduling and management of port transport vehicles as described in any one of the above is implemented.
[0045] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method for dynamic scheduling and management of port transport vehicles as described above is implemented.
[0046] The present invention provides a method and system for dynamic dispatching management of port transport vehicles. The method and system use the A-star algorithm to perform path planning, find multiple predicted paths and estimated costs, consider factors such as predicted path length, congestion level and unloading location to obtain the estimated cost of the predicted path, and then combine the estimated cost with the total path overlap to further screen the target transport path from the predicted path. On the basis of selecting appropriate transport paths and unloading locations, the mutual influence and intersection between traveling vehicles can be further reduced, thereby reducing the risk of congestion and further improving transport efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0047] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0048] Figure 1 This is one of the flow charts of a method for dynamic dispatching management of port transport vehicles provided by the present invention;
[0049] Figure 2 This is the second flow chart of a method for dynamic dispatching management of port transport vehicles provided by the present invention;
[0050] Figure 3 It is a structural schematic diagram of a dynamic dispatching management system for port transport vehicles provided by the present invention;
[0051] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION
[0052] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0053] Combine the following Figure 1-Figure 4 The present invention describes a method and system for dynamic dispatch management of port transport vehicles.
[0054] The method for dynamic dispatching and managing port transport vehicles of the present invention can be applied to a terminal operating system (TOS), which is a software system specifically used to manage and control seaport or terminal operations. TOS plays a vital role in port operations. It usually includes multiple modules and functions for managing various terminal activities and resources, improving operational efficiency, optimizing operation processes, and providing data analysis and reporting functions.
[0055] like Figure 1 As shown, a method for dynamic scheduling management of port transportation vehicles according to an embodiment of the present invention mainly includes step 110, step 120, step 130, step 140 and step 150.
[0056] Step 110, upon receiving an instruction that the cargo loading of the target transport vehicle is complete, determining the current transport starting point position of the target transport vehicle and available unloading positions.
[0057] It is understandable that it is necessary to confirm receipt of the cargo loading completion instruction of the target transport vehicle, which can be determined by receiving the cargo loading completion instruction input by the driver on the target transport vehicle or receiving the unloading completion instruction sent by the terminal unloading device.
[0058] The current location of the target transport vehicle can be determined based on real-time positioning information or vehicle sensor data. On this basis, the available unloading location information can be queried, including the status and availability of each cargo stacking area or container unloading area, such as the idle status of each location, cargo type and quantity, etc.
[0059] Step 120, determining the starting node corresponding to the transport starting point position of the target transport vehicle in the road network graph, and the ending node corresponding to each unloading position of the target transport vehicle in the road network graph.
[0060] It should be noted that a road network diagram can be constructed based on the road status of the port area, and the road network diagram includes information on each road segment, intersection, start node and end node, and the connection relationship between them.
[0061] That is, the road network diagram is drawn based on the road conditions of the port area. In some embodiments, the road network diagram can be determined in the following manner.
[0062] Based on the road status of the port area, the distribution positions of roads in the port area and the distribution positions of intersections set on the roads can be determined, and the roads in the port area can be divided into various sections according to the intersections; then, based on the positions of various sections, cargo ship unloading positions, transport vehicle unloading positions and transport vehicle berthing positions, road nodes are set to obtain a road network map.
[0063] It should be noted that it is necessary to collect road status data of the port area in advance, including road layout, intersection distribution, road length, road width, vehicle traffic conditions, etc. The above information can be obtained through on-site investigation, map data, drone aerial photography, etc.
[0064] Based on the collected road data, determine the distribution of roads in the port area, such as main roads, branch roads, parking lanes, loading and unloading areas and other types of roads. Based on the distribution of roads, determine the distribution of intersections set on the roads. Intersections can be in the form of T-junctions, crossroads, roundabouts, etc.
[0065] According to the distribution of roads and intersections, the roads are divided into sections. Each section should have a unique identifier to facilitate the subsequent construction of the road network map and path planning. According to the collected information such as the unloading location of cargo ships, the unloading location of transport vehicles and the berthing location, road nodes are set in the road network map. Nodes can be intersections, unloading points of cargo ships, unloading points of transport vehicles and berthing points, etc.
[0066] On this basis, the road network diagram is constructed according to the road distribution location, intersection distribution location, road section information and road node information. The road network diagram should include the topological structure of roads, intersections and nodes, as well as the connection relationship between them.
[0067] It is understandable that the transport starting point position of the target transport vehicle and the actual coordinate information of each unloading location can be associated with the road network map, for example, by means of a geographic information system (GIS) or other location recognition technology.
[0068] On this basis, a path planning algorithm is used to find a feasible driving path. In the process of path planning, the starting node corresponding to the transportation starting point of the target transport vehicle and the ending node corresponding to each unloading location can be identified. These nodes should have unique identifiers in the road network diagram to facilitate subsequent path navigation and vehicle scheduling.
[0069] During the actual transportation process, the road status may change, such as road closures, traffic control, etc. Therefore, it is necessary to update the road network diagram and node information in real time to ensure the accuracy and practicality of path planning.
[0070] Step 130, using the A-star algorithm to search for nodes corresponding to each road section in the road network graph starting from the starting node until each end node is obtained, and obtain each predicted path from the starting node to each end node and the estimated cost corresponding to each predicted path.
[0071] The estimated cost is determined based on the length of the corresponding predicted path, the congestion level, and the unloading status of the unloading location.
[0072] It is understandable that in a road network diagram, each road section corresponds to a node, and the connection relationship between road sections forms a path. The attributes of the node can be defined to include location coordinates, connected paths, road section length, congestion level and other information.
[0073] In this embodiment, a heuristic function may be designed to evaluate the estimated cost of each node to reach the target node. The heuristic function may be determined based on factors such as the length of the predicted path, the degree of congestion, and the unloading state of the unloading location.
[0074] When using the A-star algorithm again, the data structures required for the search can be initialized, including the open list and the closed list. The open list is used to store the nodes to be evaluated, and the closed list is used to store the nodes that have been evaluated and need to be discarded.
[0075] In the prior art, the starting node is added to the open list, and the actual cost of the starting node is set to 0, and the heuristic evaluation cost is the estimated cost calculated by the heuristic function. The node with the highest priority is selected from the open list for expansion, that is, the node with the smallest estimated cost is selected. The neighbor nodes of the selected node are expanded, the actual cost and heuristic evaluation cost of the expanded node are calculated, and then added to the open list. Repeat the above steps until the target node is found or the open list is empty. If the target node is found, the predicted path from the starting node to the target node is obtained by backtracking the path.
[0076] However, in this application, Figure 2 As shown, the A-star algorithm is used to search the nodes corresponding to each road section in the road network graph starting from the starting node until each terminal node is obtained, and each predicted path from the starting node to each terminal node and the estimated cost corresponding to each predicted path are obtained, including step 131, step 132, step 133 and step 134.
[0077] Step 131, using the A-star algorithm to put the nodes adjacent to the start node into an open list, and obtain the known cost between the start node and the nodes put into the open list.
[0078] Step 132, based on the nodes in the open list, continue to search for adjacent nodes and put them into the open list, and based on the straight-line distance between the nodes in the open list and the start node, filter out abandoned nodes and put the abandoned nodes from the open list into the closed list.
[0079] Step 133 , continuously updating new nodes put into the open list and known costs between the nodes in the open list and the start node until the node put into the open list becomes the end node.
[0080] Step 134, backtracking from the end node to the start node, and obtaining a predicted path based on the nodes between the start node and the end node, and using the known cost between the end node and the start node as the estimated cost corresponding to the predicted path.
[0081] In this embodiment, the algorithm starts searching for adjacent nodes from the starting node, and does not screen the next adjacent node according to the optimal heuristic evaluation cost in the prior art, but retains adjacent nodes as much as possible, and only screens abandoned nodes based on the straight-line distance between the nodes in the open list and the starting node, and puts the abandoned nodes from the open list into the closed list, thereby realizing the screening of subsequent nodes.
[0082] It should be noted that the abandoned nodes are determined based on the straight-line distance between the nodes in the open list and the starting node, and the abandoned nodes are used to represent the nodes far away from the unloading location during the search process. Since the selection of multiple unloading locations needs to be comprehensively considered during path planning, in this embodiment, the abandoned nodes are only put from the open list to the closed list to maximize the number of searched paths, thereby obtaining a predicted path that can cover multiple unloading locations.
[0083] In some embodiments, discarded nodes are screened based on the straight-line distance between the nodes in the open list and the starting node, including: determining the straight-line distance between the current node in the open list and the starting node; when the straight-line distance is less than a distance threshold, determining the current node as a discarded node; the distance threshold is determined based on the number of nodes between the current node and the starting node.
[0084] For each current node in the open list, calculate the straight-line distance between it and the starting node.
[0085] A distance threshold is determined according to the number of nodes between the current node and the starting node. It is understandable that the number of nodes between the current node and the starting node can be obtained by tracing back from the current node to the starting node.
[0086] It should be noted that the more nodes there are between the current node and the starting node, the larger the value of the distance threshold is, thereby avoiding searching in a direction away from the unloading location.
[0087] For each current node, determine whether the straight-line distance between it and the starting node is less than the set distance threshold. If the condition is met, the current node is determined as an abandoned node, removed from the open list and placed in the closed list.
[0088] In this embodiment, abandoned nodes can be screened according to the straight-line distances between nodes during the search process, thereby optimizing the path search process, reducing unnecessary node expansion and calculation, and improving search efficiency and speed.
[0089] Step 140, based on the road network graph, determining the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation.
[0090] Extract the routes of transport vehicles assigned to each predicted route and completed route from the road network graph. For each predicted route and completed route, calculate the route overlap between them. The overlap can be measured using the following indicators, such as the number of overlapping sections in the predicted route and the completed route, the ratio of the number of overlapping sections divided by the total number of sections in the predicted route or the completed route, and the total length of the overlapping sections in the predicted route and the completed route.
[0091] Through the above steps, the path overlap between the predicted path and the actual execution path can be comprehensively analyzed and evaluated, providing reference and guidance for optimizing the path planning and scheduling of transport vehicles.
[0092] In some embodiments, based on the road network graph, determining each total path overlap between each predicted path and the path of the transport vehicle that has currently completed path allocation includes the following process.
[0093] The nodes covered by each predicted path in the road network graph can be determined respectively, and the nodes covered by the path of the transport vehicle that has currently completed the path allocation in the road network graph can be determined.
[0094] On this basis, the first road sections between the nodes covered by each predicted path and the second road sections between the nodes covered by the path of the transport vehicle that has currently completed the path allocation are determined respectively.
[0095] Then, the total lengths of the overlapping sections between the first sections covered by each predicted path and each second section are determined respectively.
[0096] Finally, the total path overlap between each predicted path and the path of the transport vehicle that has currently completed path allocation can be determined based on the total length of the overlapped road sections corresponding to each predicted path.
[0097] It can be understood that determining the overlap between the predicted path and the currently completed path can help predict the possible degree of congestion. By comparing the overlap between the predicted path and the paths of the transport vehicles assigned to the currently completed paths, it can be inferred which sections of the road are prone to congestion when the target transport vehicle is running in real time, which can facilitate adjustment of path planning, optimization of transportation strategies, and prevention of traffic congestion.
[0098] Step 150 , based on the estimated costs corresponding to the predicted paths and the total path overlap, a target transport path sent to the target transport vehicle is determined from the predicted paths, and an actual unloading location is determined based on the target transport path.
[0099] In some embodiments, for each predicted path, its estimated cost and the total path overlap are comprehensively considered. According to the estimated cost and the total path overlap, the predicted paths can be evaluated and sorted to determine the optimal target transportation path candidate list. The optimal target transportation path is selected from the candidate list, that is, a path with a reasonable estimated cost and a low overlap with the total path.
[0100] It is understandable that the priority selection can be sorted according to the estimated cost and the total path overlap, and weights can be set for the estimated costs and total path overlaps of different predicted paths, so as to obtain the optimal predicted path.
[0101] After the target transport path is determined, it can be used as the path sent to the target transport vehicle. Applying the determined target transport path and the actual unloading location to the path planning and scheduling of the transport vehicle can ensure that the transport process is carried out efficiently.
[0102] According to a method for dynamic dispatching and management of port transport vehicles provided by an embodiment of the present invention, a plurality of predicted paths and estimated costs are found by using the A-star algorithm for path planning, and the estimated cost of the predicted path is obtained by considering factors such as the predicted path length, the degree of congestion and the unloading location. Then, the target transport path is further screened from the predicted path by combining the estimated cost and the total path overlap. On the basis of selecting a suitable transport path and unloading location, the mutual influence and intersection between traveling vehicles can be further reduced, thereby reducing the risk of congestion and further improving the transport efficiency.
[0103] In some embodiments, the estimated cost corresponding to the predicted path is determined in the following manner.
[0104] The known costs between nodes can be determined based on the distances between nodes and the degree of congestion between the start node and the end node. The degree of congestion is determined based on the number of transport vehicles and the width of the road between nodes. On this basis, the known costs between nodes are summed to obtain the total known cost between the start node and the end node. Finally, based on the total known cost and the unloading status of the unloading location corresponding to the end node, the estimated cost corresponding to the predicted path is obtained; the unloading status includes the remaining cargo storage at the unloading location and the amount of cargo to be unloaded.
[0105] It is understandable that the known costs between the nodes may be determined based on the distances between the nodes and the congestion levels between the start node and the end node.
[0106] The estimated travel time can be used as a known cost to evaluate the quality of the predicted path. First, the average travel speed of the transport vehicle on the road needs to be determined, which can be determined based on factors such as vehicle type, road conditions, and traffic conditions. It can also be calculated using vehicle location information collected by RFID on the road.
[0107] For adjacent nodes on the predicted path, the actual distance between them can be obtained through road network maps or GPS data, and the distance between nodes can be divided by the average driving speed of the vehicle to get the travel time between the two nodes. If there are multiple nodes forming a path, the travel time of each segment can be added to get the travel time of the entire path.
[0108] For example, assuming that the average speed of vehicles is 60 km / h and the distance between node A and node B is 10 km, the travel time is 10 km / 60 km / h=0.167 hours, or 10 minutes.
[0109] The effect of congestion can be thought of as a reduction in speed. For example, if the speed of a road is reduced to half due to congestion, the travel time will double accordingly.
[0110] Specifically, the degree of congestion can be quantified, and the degree of congestion can be evaluated based on factors such as the number of transport vehicles and the width of the road. The degree of congestion can be the ratio of the number of vehicles on the current road to the road width, and the degree of congestion can be quantified as a numerical indicator or level, for example, from low to high values, it can be divided into normal, mild congestion, moderate congestion and severe congestion. Such a quantitative evaluation can more objectively reflect the traffic conditions of the road section, which is helpful for calculating the estimated cost and performing route planning.
[0111] On this basis, different levels of congestion are corresponded to different weight coefficients, and then the product of this weight coefficient and the travel time is used as the known cost between each node.
[0112] Furthermore, the total known cost can be calculated. The known costs between the nodes can be summed to obtain the total known cost between the start node and the end node. According to the total known cost and the unloading state of the unloading location corresponding to the end node, the estimated cost corresponding to the predicted path is determined.
[0113] The unloading status includes the remaining cargo storage at the unloading location and the amount of cargo to be unloaded. This information can affect the calculation of the estimated cost. For example, a small amount of remaining cargo storage may lead to a lower estimated cost, while a large amount of cargo to be unloaded may lead to a higher estimated cost. Similarly, the weight can be set in a quantitative way similar to the congestion level to obtain the impact value of the unloading status.
[0114] Specifically, the estimated cost corresponding to the predicted path is determined by the following formula:
[0115]
[0116] Among them, C total is the total estimated cost of the predicted path; n is the total number of nodes on the path, d i is the length of the i-th road segment, v i is the average speed of vehicles on the i-th road, wi is the weight coefficient of the congestion degree of the i-th road, C unload is the cost associated with the unloading state of the unloading location corresponding to the terminal node.
[0117] The degree of congestion is quantified based on the ratio of the current number of vehicles on the road to the road width, and is divided into different levels (such as normal, light congestion, moderate congestion, and severe congestion), and each level corresponds to a weight coefficient.
[0118] According to the remaining cargo storage capacity at the unloading location and the amount of cargo to be unloaded, a quantitative method similar to the degree of congestion is used to set weights and calculate costs.
[0119] It can be understood that by considering the distance between each node, the actual length of the transport route can be reflected, ensuring the rationality of the path planning. By considering the average driving speed, the transport time can be more realistically reflected, taking into account the road conditions and traffic conditions of different sections. By quantifying the degree of congestion and applying the corresponding weight coefficient, the impact of traffic conditions can be accurately reflected, improving the accuracy of path selection. Finally, by considering the unloading status of the unloading location, the processing capacity and actual needs of the terminal can be comprehensively considered in the path planning to optimize the transportation efficiency.
[0120] In this way, factors such as the distance between nodes, the degree of congestion, and the unloading status can be comprehensively considered to obtain the estimated cost of the predicted path, which can more comprehensively reflect the actual situation of the path and help to more accurately select the optimal target transportation path.
[0121] In some embodiments, based on the estimated cost corresponding to each predicted path and the total path overlap, a target transport path sent to a target transport vehicle is determined from each predicted path, including: based on a cost threshold and the estimated cost corresponding to each predicted path, an initial target transport path is screened from each predicted path; and the path with the smallest total path overlap among the initial target transport paths is used as the target transport path.
[0122] A cost threshold can be set, which can be determined according to actual conditions and needs, and is used to select predicted paths with estimated costs lower than the threshold as the initial target transportation paths. For example, when time is used as the cost for evaluation, the cost threshold can be the time limit required for the current target transportation vehicle to transport the goods.
[0123] For each predicted path, the estimated cost is compared with the cost threshold, and the path with an estimated cost lower than the threshold is selected as the initial target transportation path.
[0124] Finally, the path with the smallest total path overlap is selected from the initial target transport paths as the final target transport path. The path with the smallest total path overlap means that the target transport vehicle has the smallest overlap with the paths of other current transport vehicles when it is in the driving state after departure, and is less likely to cause traffic congestion or other problems.
[0125] A dynamic dispatching management system for port transport vehicles provided by the present invention is described below. The dynamic dispatching management system for port transport vehicles described below and the dynamic dispatching management method for port transport vehicles described above can be referred to each other.
[0126] like Figure 3 As shown, a dynamic dispatching and management system for port transport vehicles according to an embodiment of the present invention mainly includes a response module 310 , a node confirmation module 320 , a path planning module 330 , a processing module 340 and a dispatching module 350 .
[0127] The response module 310 is used to determine the current transport starting point position and available unloading positions of the target transport vehicle when receiving the instruction that the cargo loading of the target transport vehicle is completed;
[0128] The node confirmation module 320 is used to determine the starting node corresponding to the transport starting point of the target transport vehicle in the road network map, and the ending node corresponding to each unloading position of the target transport vehicle in the road network map; the road network map is drawn based on the road status of the port area;
[0129] The path planning module 330 is used to use the A-star algorithm to search for nodes corresponding to each road section in the road network graph starting from the starting node until each end node is obtained, and obtain each predicted path from the starting node to each end node and the estimated cost corresponding to each predicted path; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level and the unloading state of the unloading location;
[0130] The processing module 340 is used to determine the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation based on the road network graph;
[0131] The scheduling module 350 is used to determine a target transport path sent to a target transport vehicle from each predicted path based on the estimated cost corresponding to each predicted path and the total path overlap, and determine an actual unloading location based on the target transport path.
[0132] According to an embodiment of the present invention, a dynamic dispatching and management system for port transport vehicles is provided. By using the A-star algorithm for path planning, multiple predicted paths and estimated costs are found. The estimated cost of the predicted path is obtained by considering factors such as the predicted path length, congestion level and unloading location. Then, the estimated cost and the total path overlap are combined to further screen the target transport path from the predicted path. On the basis of selecting appropriate transport paths and unloading locations, the mutual influence and intersection between traveling vehicles can be further reduced, thereby reducing the risk of congestion and further improving transport efficiency.
[0133] Figure 4 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 4As shown, the electronic device may include: a processor (processor) 410, a communication interface (Communications Interface) 420, a memory (memory) 430 and a communication bus 440, wherein the processor 410, the communication interface 420, and the memory 430 communicate with each other through the communication bus 440. The processor 410 can call the logic instructions in the memory 430 to execute the dynamic scheduling management method for port transport vehicles, which includes: upon receiving an instruction that the cargo loading of the target transport vehicle is completed, determining the current transport starting point position of the target transport vehicle and the available unloading positions; determining the starting node corresponding to the transport starting point position of the target transport vehicle in the road network map, and the ending nodes corresponding to the unloading positions of the target transport vehicle in the road network map; the road network map is drawn based on the road status of the port area; using the A star algorithm to search the nodes corresponding to each road section in the road network map from the starting node until each ending node is obtained, and obtaining each predicted path from the starting node to each ending node and the estimated cost corresponding to each predicted path; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level and the unloading status of the unloading position; based on the road network map, determining each total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation; based on the estimated cost corresponding to each predicted path and the total path overlap, determining the target transport path sent to the target transport vehicle from each predicted path, and determining the actual unloading position based on the target transport path.
[0134] In addition, the logic instructions in the above-mentioned memory 430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.
[0135] On the other hand, the present invention also provides a computer program product, which includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the port transport vehicle dynamic scheduling management method provided by the above methods, the method comprising: upon receiving an instruction that the cargo loading of the target transport vehicle is completed, determining the current transport starting point position and available unloading positions of the target transport vehicle; determining the starting node corresponding to the transport starting point position of the target transport vehicle in the road network diagram, and the ending node corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is based on the port The road status of the area is drawn; the A-star algorithm is used to search the nodes corresponding to each road section in the road network map from the starting node until the end nodes are obtained, and the predicted paths from the starting node to each end node and the estimated cost corresponding to each predicted path are obtained; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level and the unloading status of the unloading location; based on the road network map, the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation is determined; based on the estimated cost corresponding to each predicted path and the total path overlap, the target transport path sent to the target transport vehicle is determined from each predicted path, and the actual unloading location is determined based on the target transport path.
[0136] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the port transport vehicle dynamic scheduling management method provided by the above methods, the method comprising: upon receiving an instruction that cargo loading of a target transport vehicle is completed, determining the current transport starting point position of the target transport vehicle and available unloading positions; determining the starting node corresponding to the transport starting point position of the target transport vehicle in a road network diagram, and the ending node corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is drawn based on the road status of the port area; utilizing Use the A-star algorithm to search the nodes corresponding to each road section in the road network graph from the starting node until each terminal node is obtained, and obtain each predicted path from the starting node to each terminal node and the estimated cost corresponding to each predicted path; the estimated cost is determined based on the length of the corresponding predicted path, the congestion level and the unloading status of the unloading location; based on the road network graph, determine the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation; based on the estimated cost corresponding to each predicted path and the total path overlap, determine the target transport path sent to the target transport vehicle from each predicted path, and determine the actual unloading location based on the target transport path.
[0137] The system embodiment described above is merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art may understand and implement it without creative work.
[0138] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0139] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for dynamic dispatching and management of port transport vehicles, characterized in that: include: Upon receiving an instruction that the cargo loading of the target transport vehicle is complete, determining the current transport starting point position of the target transport vehicle and available unloading positions; Determine the starting node corresponding to the transport starting point of the target transport vehicle in the road network diagram, and the ending nodes corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is drawn based on the road status of the port area; Using the A-star algorithm, starting from the starting node, searching for nodes corresponding to each road section in the road network graph until each terminating node is obtained, and obtaining each predicted path from the starting node to each terminating node and the estimated cost corresponding to each predicted path; The estimated cost is determined based on the length of the corresponding predicted path, the congestion level, and the unloading status of the unloading location; Based on the road network graph, determining the total path overlap between each predicted path and the path of the transport vehicle that has currently completed the path allocation; Based on the estimated costs corresponding to the predicted paths and the total path overlap, a target transport path sent to the target transport vehicle is determined from the predicted paths, and an actual unloading location is determined based on the target transport path.
2. The method for dynamic dispatching and management of port transport vehicles according to claim 1, characterized in that: The method of using the A-star algorithm to search nodes corresponding to each road section in the road network graph from the starting node until each terminating node is obtained, and obtaining each predicted path from the starting node to each terminating node and the estimated cost corresponding to each predicted path, includes: Using the A-star algorithm, the nodes adjacent to the starting node are put into an open list, and the known cost between the starting node and the nodes put into the open list is obtained; Based on the nodes in the open list, the adjacent nodes are continuously searched and put into the open list, and based on the straight-line distance between the nodes in the open list and the starting node, the abandoned nodes are screened and put into the closed list from the open list; the abandoned nodes are used to represent the nodes far away from the unloading location during the search process; Continuously updating new nodes put into the open list and known costs between the nodes in the open list and the start node until the node put into the open list becomes the end node; The end node is traced back to the start node, and a predicted path is obtained based on the nodes between the start node and the end node, and the known cost between the end node and the start node is used as the estimated cost corresponding to the predicted path.
3. The method for dynamic dispatching and management of port transport vehicles according to claim 2, characterized in that: The estimated cost corresponding to the predicted path is determined by: Determining the known costs between the nodes based on the distances between the nodes between the starting node and the ending node and the degree of congestion; the degree of congestion is determined based on the number of transport vehicles and the width of the road between the nodes; Sum the known costs between the nodes to obtain the total known cost between the starting node and the ending node; Based on the total known cost and the unloading status of the unloading location corresponding to the terminal node, the estimated cost corresponding to the predicted path is obtained; the unloading status includes the remaining cargo storage volume at the unloading location and the cargo volume to be unloaded.
4. The method for dynamic dispatching and management of port transport vehicles according to claim 3, characterized in that: The estimated cost corresponding to the predicted path is determined by the following formula: Among them, C total is the total estimated cost of the predicted path; n is the total number of nodes on the path, di is the distance of the i-th road section, vi is the average speed of vehicles on the i-th road section, wi is the congestion weight coefficient of the i-th road section, and Cunload is the cost related to the unloading state of the unloading location corresponding to the terminal node.
5. The method for dynamic dispatching and management of port transport vehicles according to claim 2, characterized in that: The filtering of discarded nodes based on the straight-line distance between the nodes in the open list and the start node includes: Determine the straight-line distance between the current node in the open list and the starting node; When the straight-line distance is less than a distance threshold, the current node is determined as the abandoned node; the distance threshold is determined based on the number of nodes between the current node and the starting node.
6. The method for dynamic dispatching and management of port transport vehicles according to claim 1, characterized in that: The step of determining a target transport path sent to the target transport vehicle from each predicted path based on the estimated cost corresponding to each predicted path and the total path overlap, comprises: Based on the cost threshold and the estimated cost corresponding to each predicted path, an initial target transportation path is selected from each predicted path; The path with the smallest total path overlap among the initial target transportation paths is used as the target transportation path.
7. The method for dynamic dispatching and management of port transport vehicles according to claim 1, characterized in that: The determining, based on the road network graph, the total path overlap between each predicted path and the path of the transport vehicle that has currently completed path allocation comprises: Determine the nodes covered by each predicted path in the road network graph, and determine the nodes covered by the path of the transport vehicle that has currently completed the path allocation in the road network graph; Determine respectively the first road section between the nodes covered by each predicted path and the second road section between the nodes covered by the path of the transport vehicle that has currently completed the path allocation; respectively determining the total length of the overlapping sections between the first sections covered by each predicted path and each second section; Based on the total length of the overlapping road sections corresponding to the predicted paths, the total path overlap between the predicted paths and the paths of the transport vehicles that have currently completed the path allocation is determined.
8. The method for dynamic dispatching and management of port transport vehicles according to claim 1, characterized in that: The road network diagram is determined by: Based on the road status of the port area, determine the distribution positions of the roads in the port area and the distribution positions of the intersections set in the roads, and divide the roads in the port area into sections according to the intersections; Based on the positions of various road sections, cargo ship unloading positions, transport vehicle unloading positions and transport vehicle parking positions, road nodes are set and the road network diagram is obtained.
9. A dynamic dispatching and management system for port transport vehicles, characterized in that: include: A response module, for determining the current transport starting point position and available unloading positions of the target transport vehicle upon receiving an instruction that the cargo loading of the target transport vehicle is completed; A node confirmation module is used to determine the starting node corresponding to the transport starting point of the target transport vehicle in the road network diagram, and the ending nodes corresponding to each unloading position of the target transport vehicle in the road network diagram; the road network diagram is drawn based on the road status of the port area; A path planning module, used to use the A-star algorithm to search for nodes corresponding to each road section in the road network graph starting from the starting node until each end node is obtained, and obtain each predicted path from the starting node to each end node and the estimated cost corresponding to each predicted path; The estimated cost is determined based on the length of the corresponding predicted path, the congestion level, and the unloading status of the unloading location; A processing module, for determining, based on the road network diagram, each total path overlap between each predicted path and the path of the transport vehicle to which the path allocation has been completed; The scheduling module is used to determine a target transport path sent to the target transport vehicle from each predicted path based on the estimated cost corresponding to each predicted path and the total path overlap, and determine an actual unloading location based on the target transport path.
10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the port transport vehicle dynamic scheduling management method as described in any one of claims 1 to 8 is implemented.
Citation Information
Cited By
Transportation route recommendation method, system and equipment based on satellite positioning
CN119394325A
Vehicle driving wisdom cooperation method and system for wisdom port
CN120598153A
