A Port Logistics Settlement Management Method

Abstract

This invention relates to the field of port logistics technology, specifically disclosing a port logistics settlement management method, comprising the following steps: retrieving other container transport routes from a database whose transport times overlap with the current container's transport time; calculating the route overlap degree of each current container transport route in the current container transport route set with other container transport routes based on the current container transport route set and other container transport routes, generating a total route overlap degree value corresponding to each current container transport route; matching the minimum route overlap value; and finding the current container transport route corresponding to the minimum value, thus generating the corresponding optimal route for the current container transport. This solution can solve the problem of irrational container transport routes entering the port in the prior art, improve the efficiency of container transport, and reduce congestion problems.

Description

Technical Field

[0001] This invention relates to the field of port logistics technology, and specifically to a port logistics settlement management method. Background Technology

[0002] Currently, intelligent technologies are quietly changing the way ports operate. From manual port management to simply sitting in front of a computer and clicking a mouse, from containers piling up at the port waiting to be shipped out to information-based production and allocation, shortening cargo storage time. In the wave of port transformation and upgrading, intelligent technology has become the future development direction of ports.

[0003] Existing port management systems, while achieving intelligentization, primarily focus on recording information about various materials and resources within the port, namely, recording information on incoming and outgoing goods, as well as goods stored within the port. They don't prioritize the transportation of these incoming or outgoing goods. This results in container transport at ports often relying on drivers to determine their own routes. This method is inherently unpredictable, making it difficult to guarantee efficient and timely container transport, and it also easily leads to congestion along transport routes. Of course, some port container transport navigation systems address the issue of the fluid and unpredictable movement of incoming goods and the varying availability of transport vehicles, primarily resolving the problem of vehicles failing to accurately reach unloading points.

[0004] Therefore, there is an urgent need for a port logistics settlement management method that can solve the problem of irrational container transportation routes in the existing technology, improve the efficiency of container transportation, and reduce congestion. Summary of the Invention

[0005] The present invention aims to provide a port logistics settlement management method that can solve the problem of irrational container transportation routes in the prior art, improve the efficiency of container transportation, and reduce congestion.

[0006] To achieve the above objectives, the present invention adopts the following technical solution: a port logistics settlement management method, comprising the following steps:

[0007] S1. When the current container enters the port, obtain the cargo information corresponding to the current container. The cargo information includes cargo arrival time information, cargo type, cargo departure time information, and arrival location information. Generate the storage pre-fee information for the current container based on the cargo arrival time information and cargo departure time information.

[0008] S2. Based on the cargo type and cargo departure time information, retrieve the container stacking information of the same cargo type in the current yard from the database; the container stacking information includes container stacking location information and container departure time information.

[0009] S3. Based on the container stacking location information, container departure time information, and cargo departure time, identify the current container stacking location in the yard and generate the current container stacking location information.

[0010] S4. Based on the port entry location information and the current container stacking location information, plan the transportation route from the current container to the current container stacking location information, and predict the transportation time of each route based on the cargo entry time information, generate the corresponding current container transportation route set, and the current route transportation time set corresponding to each transportation route in the container transportation route set.

[0011] S5. Retrieve other container transport routes whose transport times overlap with the current container's transport time from the database. Based on the current container transport route set and other container transport routes, calculate the path overlap degree of each current container transport route in the current container transport route set with other container transport routes, and generate the total path overlap degree value corresponding to each current container transport route. Match the minimum value of the total path overlap degree value, find the current container transport route corresponding to the minimum value, and generate the corresponding optimal route for the current container transport.

[0012] The principle and advantages of this solution are as follows: After a container arrives at the port, its cargo information is retrieved, including arrival time, cargo type, departure time, and arrival location. Based on the cargo type and departure time, the stacking information of containers of the same cargo type in the current yard can be retrieved. This stacking information includes the container's location and departure time, providing a clear understanding of the cargo's stacking status.

[0013] To more accurately determine the current stacking location of containers in the yard, information such as container stacking location, container departure time, and cargo departure time is used to identify the current container stacking location. Once the specific stacking location is known, transportation routes to the container's current location can be planned based on the arrival location information. There may be multiple transportation routes. For each planned route, the transportation time is predicted based on the cargo arrival time. This generates a set of container transportation routes and the estimated time for each route within that set.

[0014] Next, other container transport routes are retrieved from the database. These routes share a common characteristic: their corresponding transport times overlap with the current container's transport time. Then, the route overlap rate of each current container transport route in the current container transport route set is calculated against each of the retrieved routes, generating a total route overlap rate value for each current container transport route. At this point, each current container transport route may correspond to multiple total route overlap rate values, forming a set of total route overlap rate values. The minimum value in this set is then identified, and the current container transport route corresponding to this minimum value is found. This allows for the identification of the route with the best transport efficiency, significantly improving container transport efficiency. Rational route planning can effectively alleviate traffic congestion problems, addressing the issue of irrational container transport routes in existing technologies, improving container transport efficiency, and reducing congestion.

[0015] Preferably, as an improvement, the method further includes the following steps:

[0016] S6. When the cargo departure time information is received, the current port status of the container is judged. If it is determined that the current container has not left the port in time, the overdue storage fee of the current container is calculated based on the overdue time, and the corresponding total storage fee information of the current container is generated.

[0017] Beneficial effects: Containers in ports cannot always leave on time. For these containers, demurrage fees will be generated to give the corresponding customers a buffer period, which is also more humane.

[0018] Preferably, as an improvement, S6 includes the following steps:

[0019] S60. When the cargo departure time information is received, the current port status of the container is judged. If the current container has not left the port in time, a message is sent to the customer corresponding to the current container and a preset time extension is given.

[0020] S61. After the container arrives at the preset time, retrieve the overdue fee table corresponding to the cargo type of the current container, and calculate the overdue time to generate the corresponding overdue time information.

[0021] S62. Based on the overdue time information and the overdue fee table, calculate the current overdue fee information for container storage, and based on the corresponding current pre-cost information for container storage, formulate the corresponding total cost information for container storage.

[0022] Beneficial Effects: In this solution, if a container fails to depart according to the scheduled cargo departure time, the system will immediately notify the container owner (customer) and grant a pre-set extension. Since delays can occur for various reasons, including unintended ones, this pre-set extension, without incurring additional fees, helps improve customer satisfaction. After the pre-set extension period, different demurrage fee schedules will be retrieved based on the type of cargo. Different cargo types have different fees, and charging higher fees for more valuable goods is reasonable. The system then calculates the demurrage fee for the container based on these fee schedules and the demurrage duration. This allows the system to quickly and accurately inform the customer of the fees to be paid or settled when they come to depart.

[0023] Preferably, as an improvement, the method further includes the following steps:

[0024] S7. Based on the generated optimal route for current container transportation, the container transport vehicle transports the current container. Upon arriving near the corresponding current container stacking location, it retrieves the stacking status of other containers at the current container stacking location from the database and determines whether the current container stacking location is saturated. If the result is that the current container stacking location is not saturated, the corresponding current container is stacked at the current container stacking location. If the result is that the current container stacking location is saturated, it is determined that the current container can no longer be stacked at that location.

[0025] S8. If the judgment result is that the current container can no longer be stacked at this location, the stacking location information of the other containers closest to the current container's stacking location information will be matched, and the departure time information of the corresponding other container stacking location information will be the same as the cargo departure time of the current container.

[0026] S9. Based on the obtained stacking location information of other containers, determine whether the stacking of the other container stacking location information is saturated. If the stacking of the other container stacking location information is not saturated, then stack the corresponding current container at the stacking location information of the other container. If the stacking of the other container stacking location information is saturated, and it is determined that the current container can no longer be stacked at that location, then continue matching and execute S8.

[0027] Beneficial effects: In this solution, there may be empty spaces at initial stacking locations of the same type before the container is transported there. When the container is transported there by a transport vehicle, the current stacking location may be full. In this case, other container stacking locations around the current container's location will be matched. Initially, the nearest location with the same departure time will be matched. This way, the container can be shipped when the departure time arrives after being stacked at another location. Of course, if the nearest location is also full, the matching process will continue until the next nearest location is not full. Then, the container can be stacked at the corresponding location, thus completing the stacking. This greatly avoids the situation where containers cannot be stacked in time when the stacking location is full, causing transport vehicles to stop and causing congestion. At the same time, this greatly improves the overall stacking efficiency and the convenience of departure. Attached Figure Description

[0028] Figure 1 This is a flowchart of the port logistics settlement management method in Embodiment 1 of the present invention. Detailed Implementation

[0029] The following detailed description illustrates the specific implementation method:

[0030] The basic implementation examples are as follows: Figure 1 As shown: A port logistics settlement management method, including the following steps:

[0031] S1. When a container enters the port, the cargo information corresponding to that container is obtained. The cargo information includes cargo arrival time, cargo type, cargo departure time, and arrival location. Based on the cargo arrival time and departure time, the pre-cost storage information for that container is generated. In this embodiment, the arrival of a container at the port indicates that the container needs to be stacked. Therefore, the cargo information corresponding to the container is obtained immediately. The cargo information includes cargo arrival time, cargo type, cargo departure time, and arrival location. The pre-cost storage after the container is stacked can be calculated immediately using the arrival time and departure time information. This is the cost of the container leaving the port according to the departure time information. Of course, it is impossible for the container to leave the port on time in all cases.

[0032] S2. Based on the cargo type and cargo departure time information, retrieve the container stacking information of the same cargo type in the current yard from the database; the container stacking information includes container stacking location information and container departure time information; in this embodiment, firstly, based on the cargo type, determine which area the current container should be placed in. For example, cargo type A is placed in area a, while cargo type B is placed in area b. This allows us to initially know which area the current container is generally placed in. Then, based on the cargo departure time information, we can know its specific location in that area. For example, within the entire area, containers departing at different times are divided into multiple locations, such as by month, with containers departing in different months placed separately.

[0033] S3. Based on the container stacking location information, container departure time information, and cargo departure time, identify the current container stacking location in the yard and generate the current container stacking location information.

[0034] S4. Based on the port entry location information and the current container stacking location information, the transportation route from the current container to the current container stacking location is planned, and the transportation time of each route is predicted based on the cargo entry time information, generating a corresponding set of current container transportation routes and a set of current route transportation times corresponding to each transportation route in the container transportation route set; In this embodiment, based on the port entry location information and the generated current container stacking location information, transportation routes can be planned based on this information, and multiple transportation routes can be generated, each with its own corresponding route transportation time.

[0035] S5. Retrieve other container transport routes whose transport times overlap with the current container's transport time from the database. Based on the current container transport route set and other container transport routes, calculate the path overlap degree of each current container transport route in the current container transport route set with other container transport routes, and generate the total path overlap degree value corresponding to each current container transport route. Match the minimum value of the total path overlap degree value, find the current container transport route corresponding to the minimum value, and generate the corresponding optimal route for the current container transport. In this embodiment, in order to match the optimal transportation route, after generating the corresponding current container transportation route set, the transportation routes of other containers are retrieved from the database. Specifically, the transportation times of the retrieved routes overlap with the transportation times of the current container's routes. This ensures that these other containers are still being transported when the current container's cargo arrival time information is obtained. It is precisely because these containers are in transit that unreasonable transportation route planning may lead to congestion problems. The specific operation involves calculating the path overlap degree between the current container's transportation routes based on the transportation routes of these other containers, and calculating the total path overlap degree value corresponding to each current container's transportation route. This yields a set of total path overlap degree values. The route with the minimum path overlap value is then matched, and the transportation route corresponding to this minimum value is the current optimal container transportation route.

[0036] S6. When the cargo departure time information is received, the current port status of the container is judged. If it is determined that the current container has not left the port in time, the overdue storage fee of the current container is calculated based on the overdue time, and the corresponding total storage fee information of the current container is generated.

[0037] S6 includes the following steps:

[0038] S60. When the cargo departure time information is received, the current port status of the container is judged. If the current container has not left the port in time, a message is sent to the customer corresponding to the current container and a preset time extension is given.

[0039] S61. After the container arrives at the preset time, retrieve the overdue fee table corresponding to the cargo type of the current container, and calculate the overdue time to generate the corresponding overdue time information.

[0040] S62. Based on the overdue time information and the overdue fee table, calculate the current container storage overdue fee information, and based on the corresponding current container storage pre-fee information, formulate the corresponding current container storage total fee information. In this embodiment, considering that the current container's cargo departure time information is a preset time, the specific cargo departure time is subject to certain variables. For example, there may be overdue storage. For this type of customer's cargo, the overdue storage fee is calculated to resolve the issue. Specifically, after the corresponding cargo departure time information arrives, if the current container's port status has not been promptly departed, a message reminder will be sent immediately. For example, "Hello, the departure time for your container stored in area b has arrived. Please depart as soon as possible, otherwise overdue fees may be incurred. Thank you." Of course, a certain timeframe will be granted. Containers transported within this timeframe will not incur overdue fees. Once the preset overdue time has elapsed, the system will retrieve the corresponding overdue fee table from the database based on the cargo type of the container. For example, cargo type BB corresponds to an overdue fee of dd yuan, while cargo type AA, due to its higher value, corresponds to an overdue fee of aa yuan, where aa is greater than dd. This allows for real-time calculation of overdue fees based on the overdue time information, enabling a quick understanding of the total storage costs for the entire storage period.

[0041] S7. Based on the generated optimal route for current container transportation, the container transport vehicle transports the current container. After arriving near the corresponding current container stacking location information, it retrieves the stacking status of other containers at the current container stacking location information from the database and determines whether the current container stacking location information is saturated. If the determination result is that the current container stacking location information is not saturated, the corresponding current container is stacked at the current container stacking location information; if the determination result is that the current container stacking location information is saturated, it is determined that the current container can no longer be stacked at that location. In this embodiment, arriving near the corresponding current container stacking location information is mainly concentrated at a location 50 meters away from the container.

[0042] S8. If the judgment result is that the current container can no longer be stacked at this position, the stacking position information of other containers closest to the current container stacking position information will be matched, and the departure time information of the corresponding other container stacking position information is the same as the cargo departure time of the current container. In this embodiment, the closest to the current container stacking position information is mainly the other container stacking position closest to the current container stacking position information in the four directions, i.e., the adjacent position.

[0043] S9. Based on the obtained stacking location information of other containers, determine whether the stacking of the other container stacking location information is saturated. If the stacking of the other container stacking location information is not saturated, then stack the corresponding current container at the stacking location information of the other container. If the stacking of the other container stacking location information is saturated, and it is determined that the current container can no longer be stacked at that location, then continue matching and execute S8.

[0044] In this embodiment, considering that the amount of space that can be stacked in the yard is limited, there may be a stacking location available for the container before it is transported to the yard. However, due to the distance of the transportation route, the corresponding stacking location may be saturated by the time the container arrives. This would prevent the container from being stacked at the pre-determined current container stacking location. Of course, it is also impossible to have the transport vehicle stop there at this time. A new storage location needs to be provided for the container. Therefore, when the stacking location corresponding to the current container is saturated, the stacking location information of other containers around the container will be matched. The nearest matching location will be selected, and the departure time information corresponding to the matched stacking location information must be consistent with that of the current container. This is to ensure that the current container can depart normally.

[0045] Example 2

[0046] Compared with Example 1, the difference in this example is that: after matching the minimum value of the total path overlap, a corresponding overall threshold is generated, and the minimum value is compared with the overall threshold at the first time to generate the corresponding initial comparison result. The initial comparison result is: if the minimum value of the total path overlap is less than the overall threshold, it means that it is the best route; otherwise, it is determined that there is still a risk of congestion.

[0047] Then, based on the type of cargo corresponding to the current container, the importance of the current container is determined, and a corresponding importance level is generated;

[0048] After matching the minimum value of the total path overlap, the arrival time of other containers whose path transportation time overlaps with the current container's transportation time is obtained, and it is determined whether these other containers arrive on time, and the corresponding on-time arrival rate of other containers is generated.

[0049] Then, based on the importance level and the on-time arrival rate of other containers, the overall threshold is dynamically adjusted. The adjusted overall threshold is then compared with the minimum total overlap value of the corresponding path. If the minimum total overlap value of the path is greater than or equal to the adjusted overall threshold, it is determined that there is still a risk of congestion, and an alert is immediately issued to the operators. The operators can then manually adjust the path to eliminate the risk of congestion for the path corresponding to the minimum value.

[0050] For example, during the initial comparison, the minimum value for a particular container might be lower than the overall threshold. However, for some goods within these containers, faster delivery might be required, and the minimum value might not adequately meet the transportation needs. Therefore, if the cargo type is later determined to be critical (e.g., the most important category), but other factors such as other containers arriving on time are also considered, the overall threshold will be dynamically adjusted, decreasing. If the minimum value is then found to be greater than the decreased overall threshold, operators will be notified and reminded. Based on this notification, operators can implement manual controls, such as delaying the arrival time of some containers, to reduce congestion along the corresponding routes.

[0051] By dynamically adjusting the overall threshold, the feasibility of the corresponding route for each container can be dynamically assessed, thereby achieving dynamic management of container transportation routes. Multiple assessments significantly improve the accuracy of these assessments. Furthermore, if a congestion risk is still detected, operators are informed, allowing them to make appropriate adjustments based on the information, ensuring that the transportation route meets its requirements and greatly improving the efficiency of transportation.

[0052] The above descriptions are merely embodiments of the present invention, and common knowledge such as specific technical solutions and / or characteristics are not described in detail here. It should be noted that those skilled in the art can make various modifications and improvements without departing from the technical solutions of the present invention, and these should also be considered within the scope of protection of the present invention. These modifications and improvements will not affect the effectiveness of the implementation of the present invention or the practicality of the patent. The scope of protection claimed in this application should be determined by the content of its claims, and the specific embodiments described in the specification can be used to interpret the content of the claims.

Claims

1. A port logistics settlement management method, characterized in that: Includes the following steps: S1. When the current container enters the port, obtain the cargo information corresponding to the current container. The cargo information includes cargo arrival time information, cargo type, cargo departure time information, and arrival location information. Generate the storage pre-fee information for the current container based on the cargo arrival time information and cargo departure time information. S2. Based on the cargo type and cargo departure time information, retrieve the container stacking information of the same cargo type in the current yard from the database; the container stacking information includes container stacking location information and container departure time information. S3. Based on the container stacking location information, container departure time information, and cargo departure time, identify the current container stacking location in the yard and generate the current container stacking location information. S4. Based on the port entry location information and the current container stacking location information, plan the transportation route from the current container to the current container stacking location information, and predict the transportation time of each route based on the cargo entry time information, generate the corresponding current container transportation route set, and the current route transportation time set corresponding to each transportation route in the container transportation route set. S5. Retrieve other container transport routes from the database whose transport time overlaps with the current container's transport time. Based on the current container transport route set and other container transport routes, calculate the path overlap degree of each current container transport route in the current container transport route set with other container transport routes, generate the total path overlap degree value corresponding to each current container transport route, match the minimum value of the total path overlap degree value, find the current container transport route corresponding to the minimum value, and generate the corresponding optimal route for the current container transport. After matching the minimum value of the total path overlap, a corresponding overall threshold is generated, and the minimum value is immediately compared with the overall threshold to generate an initial comparison result. The initial comparison result is as follows: if the minimum value of the total path overlap is less than the overall threshold, it indicates that it is the best route; otherwise, it is determined that there is still a risk of congestion. Then, based on the type of cargo corresponding to the current container, the importance of the current container is determined, and a corresponding importance level is generated; After matching the minimum value of the total path overlap, the arrival time of other containers whose path transportation time overlaps with the current container's transportation time is obtained, and it is determined whether these other containers arrive on time, and the corresponding on-time arrival rate of other containers is generated. Then, based on the importance level and the on-time arrival rate of other containers, the overall threshold is dynamically adjusted. Then, the adjusted overall threshold is compared with the minimum value of the corresponding path overlap. If the minimum value of the path overlap is greater than or equal to the adjusted overall threshold, it is determined that there is still a risk of congestion, and an alarm is immediately issued to the operators. It also includes the following steps: S7. Based on the generated optimal route for current container transportation, the container transport vehicle transports the current container. Upon arriving near the corresponding current container stacking location, it retrieves the stacking status of other containers at the current container stacking location from the database and determines whether the current container stacking location is saturated. If the result is that the current container stacking location is not saturated, the corresponding current container is stacked at the current container stacking location. If the result is that the current container stacking location is saturated, it is determined that the current container can no longer be stacked at that location. S8. If the judgment result is that the current container can no longer be stacked at this location, the stacking location information of the other containers closest to the current container's stacking location information will be matched, and the departure time information of the corresponding other container stacking location information will be the same as the cargo departure time of the current container. S9. Based on the obtained stacking location information of other containers, determine whether the stacking of the other container stacking location information is saturated. If the stacking of the other container stacking location information is not saturated, then stack the corresponding current container at the stacking location information of the other container. If the stacking of the other container stacking location information is saturated, and it is determined that the current container can no longer be stacked at that location, then continue matching and execute S8.

2. The port logistics settlement management method according to claim 1, characterized in that: It also includes the following steps: S6. When the cargo departure time information is received, the current port status of the container is judged. If it is determined that the current container has not left the port in time, the overdue storage fee of the current container is calculated based on the overdue time, and the corresponding total storage fee information of the current container is generated.

3. The port logistics settlement management method according to claim 2, characterized in that: S6 includes the following steps: S60. When the cargo departure time information is received, the current port status of the container is judged. If the current container has not left the port in time, a message is sent to the customer corresponding to the current container and a preset time extension is given. S61. After the container arrives at the preset time, retrieve the overdue fee table corresponding to the cargo type of the current container, and calculate the overdue time to generate the corresponding overdue time information. S62. Based on the overdue time information and the overdue fee table, calculate the current overdue fee information for container storage, and based on the corresponding current pre-cost information for container storage, formulate the corresponding total cost information for container storage.

Images