Unloading path searching method and system

Abstract

The invention provides an unloading path searching method and system, and the method comprises the steps: collecting a scheduling plan selected by a user and a mobile service identification code of a target ship through a human-computer interaction interface, obtaining the port data of the target ship under the scheduling plan, automatically judging whether all unloading ports of the target ship belong to the same region or not, and if yes, executing the step 1; if yes, all unloading ports of the target ship are subjected to de-weighting, all the unloading ports left after de-weighting are sequenced by adopting a permutation and combination method, a plurality of unloading schemes are obtained, then all navigation paths of each unloading scheme are constructed based on the last loading port and all the unloading ports in each unloading scheme, and all the navigation paths of each unloading scheme are constructed based on the last loading port and all the unloading ports in each unloading scheme; according to the technical scheme, the total navigation mileage of each unloading scheme is obtained, the unloading scheme with the shortest total navigation mileage is used as the current unloading scheme, the cargo capacity limiting condition is judged under the current unloading scheme, then the optimal unloading path is accurately calculated, and the selection efficiency of the unloading path is effectively improved.

Description

Technical Field

[0001] The present invention relates to the technical field of logistics management and information construction, and in particular to a method and system for searching a cargo unloading path. Background Art

[0003] Scheduling of operation plan refers to arranging and planning the transport capacity in a certain time sequence according to the information of the goods and the release time of the transport capacity. It is mainly the arrangement of tasks such as loading and unloading, so as to efficiently utilize the transport capacity and increase the company's profits. Therefore, how to schedule economically and scientifically is crucial to the efficient operation of transportation companies. The selection of unloading path is an important part of scheduling plan, and its importance is self-evident.

[0004] At present, the unloading path selection of the scheduling plan of many transportation companies relies on manual planning by scheduling personnel. However, the manual selection of unloading paths is inefficient and there is a problem of repeated work. With the advent of the big data era, companies are accelerating digital transformation, making data acquisition more convenient and faster. At present, a large number of artificial intelligence-related technologies have been applied to the transportation industry, saving a lot of manpower and material resources and promoting the rapid development of the transportation industry. Summary of the invention

[0005] In order to solve the problems of low efficiency and repeated work in the existing unloading path selection process, the present invention provides a unloading path search method, which can accurately calculate the optimal unloading path, effectively improve the selection efficiency of the unloading path, save a lot of manpower and material resources, and promote the rapid development of the transportation industry. The present invention also relates to a unloading path search system.

[0006] The technical solution of the present invention is as follows:

[0007] A method for searching a cargo unloading path, comprising the following steps:

[0008] Information collection and data acquisition steps: collecting the schedule plan selected by the user and the mobile service identification code of the target ship through the human-computer interaction interface, and obtaining the port data of the target ship under the schedule plan, wherein the port data includes the unloading port, the loading port and the unloading volume at each unloading port;

[0009] Unloading plan calculation steps: automatically determine whether all unloading ports of the target ship belong to the same area. If not, reselect the scheduling plan and the mobile service identification code of the target ship; if so, remove duplicates from all unloading ports of the target ship, and sort all remaining unloading ports after removal of duplicates by permutation and combination method to obtain multiple unloading plans;

[0010] Steps for constructing the navigation path and calculating the total navigation mileage: construct all the navigation paths of each unloading plan based on the last loading port and each unloading port in each unloading plan, and then obtain the total navigation mileage of all the navigation paths in each unloading plan, and take the unloading plan with the shortest total navigation mileage as the current unloading plan;

[0011] Cargo capacity restriction step: under the current unloading plan, the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port. If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, the current unloading plan meets the cargo capacity restriction principle; if the cargo capacity of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo capacity, the unloading plan with the second shortest total voyage mileage is used as the new current unloading plan, and the judgment of the cargo capacity restriction condition is repeated based on the new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and then the new current unloading plan meets the cargo capacity restriction principle;

[0012] Optimal unloading path search steps: For the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, calculate the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point, and then load the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point into the scheduling plan to form the optimal unloading path for the ship.

[0013] Preferably, in the cargo capacity limitation step, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limitation table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limitation principle.

[0014] Preferably, the cargo capacity limitation step is further inserted into / includes a manual correction step, and the manual correction step is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation step repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and the new current unloading plan satisfies the cargo capacity limitation principle.

[0015] Preferably, in the information collection and data acquisition step, after obtaining the port data of the target ship, the port data is preprocessed to remove missing data of the loading port and the unloading port, data of unknown ports, and data where the loading port and the unloading port are the same port.

[0016] Preferably, in the information collection and data acquisition steps, the pre-processed data is also cached, and a redis memory database is used for high-speed caching to speed up data query and reduce the amount of calculation.

[0017] Preferably, in the navigation path construction and total navigation mileage calculation steps, after all navigation paths of each unloading plan are constructed, the distances between the unloading destinations of each section of each unloading plan are queried respectively through the associated port spacing table and the query results are summed up to obtain the total navigation mileage of all navigation paths in each unloading plan.

[0018] A cargo unloading path search system, characterized in that it comprises an information collection and data acquisition module, a cargo unloading plan calculation module, a navigation path construction and total navigation mileage calculation module, a cargo capacity restriction module and an optimal cargo unloading path search module which are connected in sequence.

[0019] The information collection and data acquisition module collects the schedule plan selected by the user and the mobile service identification code of the target ship through the human-computer interaction interface, and obtains the port data of the target ship under the schedule plan, wherein the port data includes the unloading port, the loading port and the unloading volume at each unloading port;

[0020] The unloading plan calculation module automatically determines whether all the unloading ports of the target ship belong to the same area. If not, the scheduling plan and the mobile service identification code of the target ship are reselected; if so, all the unloading ports of the target ship are deduplicated, and all the remaining unloading ports after deduplication are sorted by a permutation and combination method to obtain multiple unloading plans;

[0021] The navigation path construction and total navigation mileage calculation module constructs all navigation paths of each unloading plan based on the last loading port and each unloading port in each unloading plan, and then obtains the total navigation mileage of all navigation paths in each unloading plan, and takes the unloading plan with the shortest total navigation mileage as the current unloading plan;

[0022] The cargo capacity restriction module, under the current unloading plan, compares the cargo capacity of the target ship entering and leaving each unloading port with the maximum cargo capacity of the unloading port. If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, the current unloading plan meets the cargo capacity restriction principle; if the cargo capacity of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo capacity, the unloading plan with the second shortest total sailing mileage is used as the new current unloading plan, and the judgment of the cargo capacity restriction condition is repeated based on the new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and then the new current unloading plan meets the cargo capacity restriction principle;

[0023] The optimal unloading path search module calculates the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point for the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, and then loads the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point into the scheduling plan to form the optimal unloading path for the ship.

[0024] Preferably, in the cargo capacity limitation module, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limitation table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limitation principle.

[0025] Preferably, it also includes a manual correction module, which is connected to the cargo capacity limitation module and is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation module then repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, so that the new current unloading plan meets the cargo capacity limitation principle.

[0026] Preferably, in the navigation path construction and total navigation mileage calculation module, after all navigation paths of each unloading plan are constructed, the distances between the unloading destinations of each section of each unloading plan are queried respectively through the associated port spacing table and the query results are summed up to obtain the total navigation mileage of all navigation paths in each unloading plan.

[0027] The technical effects of the present invention are as follows:

[0028] The present invention provides a method for searching a discharge path. First, the scheduling plan selected by the user and the mobile service identification code of the target ship are collected, and the port data of the target ship under the scheduling plan are obtained. Then, it is automatically determined whether all the discharge ports of the target ship belong to the same area. If so, all the discharge ports of the target ship are deduplicated, and all the remaining discharge ports after deduplication are sorted by using a permutation and combination method to obtain multiple discharge plans. By fully considering all possible discharge orders, more possibilities are provided for the subsequent selection of the optimal path, and the accuracy of the path search is effectively improved; then, based on the last loading port and each discharge port in each discharge plan, the optimal path is selected. All navigation paths of each unloading plan are constructed, and then the total navigation mileage of all navigation paths of each unloading plan is obtained, and the unloading plan with the shortest total navigation mileage is used as the current unloading plan; under the current unloading plan, the cargo capacity restriction condition is judged, and the optimal unloading path of the ship is accurately calculated by adopting a specific judgment method. The present invention generates all possible unloading ports (i.e., unloading destinations) by adopting an enumeration method, and combines the shortest path principle and the destination restriction principle on cargo volume to obtain the optimal unloading path. The present invention is simple, economical and practical, with good effect, effectively improves the selection efficiency of the unloading path, saves a lot of manpower and material resources, and promotes the rapid development of the transportation industry.

[0029] The present invention also relates to a unloading path search system, which corresponds to the above-mentioned unloading path search method, and includes an information collection and data acquisition module, an unloading plan calculation module, a navigation path construction and total navigation mileage calculation module, a cargo capacity restriction module and an optimal unloading path search module which are connected in sequence. The modules work together, utilize the port data and cargo loading information of the target ship, and combine with business logic to accurately calculate the optimal unloading path and give the estimated arrival time of the cargo at the destination, which effectively improves the selection efficiency of the unloading path, saves a lot of manpower and material resources, and promotes the rapid development of the transportation industry. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is a flow chart of the unloading path searching method of the present invention. DETAILED DESCRIPTION

[0031] The present invention will be described below in conjunction with the accompanying drawings.

[0032] The present invention relates to a method for searching a cargo unloading path, which can be understood as introducing an enumeration algorithm, using cargo loading information, combined with the principle of cargo quantity restriction by the destination, to calculate the optimal cargo unloading path and give the estimated time for the cargo to arrive at the destination. The flowchart of the method is shown in FIG. Figure 1 As shown, the following steps are included in sequence:

[0033] 1. Information collection and data acquisition steps: collect the schedule selected by the user and the mobile service identification code of the target ship (such as Figure 1 The capacity number shown in the figure) and obtain the port data of the target ship under the scheduling plan, the port data including the unloading port (such as Figure 1 The capacity shown is the unloading destination), the loading port and the unloading volume at each unloading port.

[0034] Specifically, first use psycopg2 (PostgreSQL database interface of Python language) in Python language to connect to MySQL database, and use MySQL database to store scheduling information, all transport capacity, cargo information, and the time when cargo arrives at each destination for front-end crawling. Extract the scheduling plan selected by the user and the mobile service identification code MMSI of the target ship from the MySQL database, and obtain the port data of the target ship under the scheduling plan, wherein the port data includes the unloading port, the loading port and the unloading volume at each unloading port. After obtaining the above data, clean the data, remove useless interference data, and pre-process the port data to remove missing data of loading port and unloading port, data of unknown port, and data of loading port and unloading port being the same port, then cache the pre-processed data, and use redis memory database for high-speed caching to speed up data query and reduce the amount of calculation.

[0035] 2. Unloading plan calculation steps: automatically determine whether all unloading ports (i.e., unloading destinations) of the target ship belong to the same area. If not, it indicates a violation of unloading regulations, and the scheduling plan and the mobile service identification code of the target ship are reselected; if so, all unloading ports of the target ship are deduplicated, and all remaining unloading ports after deduplication are sorted using a permutation and combination method to obtain multiple unloading plans (which can also be understood as permuting and combining the unloading points to obtain all feasible solutions).

[0036] Specifically, it is first automatically determined whether all the unloading ports of the target ship belong to the same navigation area. If not, it violates the unloading regulations (that is, all the unloading ports of the target ship are generally in a fixed navigation area. If there is an unloading port that is not in the fixed navigation area, it indicates that the data is abnormal), and the scheduling plan and the mobile service identification code of the target ship are reselected; if so, all the unloading ports of the target ship are deduplicated, and all the remaining unloading ports after deduplication are sorted by using the permutation and combination method to exhaustively enumerate all possible unloading schemes. For example, as shown in Table 1, if all the unloading ports unload_port of the target ship with a mobile service identification code MMSI of 636022324 have two unloading ports left after deduplication, namely, NLVSG Port and DEBRA Port, then the two unloading ports are permuted and combined to obtain two unloading schemes for the target ship: 1. From NLVSG Port to DEBRA Port; 2. From DEBRA Port to NLVSG Port.

[0037] Table 1

[0038]

[0039] 3. Navigation route construction and total voyage mileage calculation steps: Based on the last loading port and each unloading port in each unloading plan, all navigation routes of each unloading plan are constructed, and then the total voyage mileage of all navigation routes in each unloading plan is obtained, and the unloading plan with the shortest total voyage mileage is used as the current unloading plan. That is, the total distance of each feasible solution is calculated, and according to the principle of the shortest and most economical path, the feasible solution with the shortest path is obtained.

[0040] Specifically, all the navigation paths of each unloading scheme are constructed based on the last loading port and each unloading port in each unloading scheme. As shown in Table 1, the last loading port of the target ship (i.e., the terminal port corresponding to the latest time under the "end time" field in Table 1) is UYPTP port, then all the navigation paths of the first unloading scheme are: from UYPTP port-NLVSG port-DEBRA port, and all the navigation paths of the second unloading scheme are: from UYPTP port-DEBRA port-NLVSG port. Then, the distance between each unloading destination of each unloading scheme is queried through the associated port spacing table, and the query results are summed to obtain the total navigation mileage of all navigation paths in each unloading scheme (i.e., the total distance required for each unloading scheme to travel). This embodiment obtains the distance between any two ports by querying the port spacing table, and then according to the distance between any two ports, it can be calculated that the total navigation mileage of all navigation paths in the first unloading scheme is 6663 nautical miles, and the total navigation mileage of all navigation paths in the second unloading scheme is 6909 nautical miles. According to the principle of the shortest and most economical path, the first unloading plan with the shortest total sailing mileage is selected as the current unloading plan.

[0041] 4. Cargo capacity restriction step: Under the current unloading plan, the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity restricted by the corresponding unloading port (i.e., check whether the capacity entering and leaving the unloading point meets the draft restriction). The maximum cargo capacity is obtained by querying the maximum cargo capacity restriction of the ship model corresponding to the ship with the mobile service identification code of 636022324 at NLVSG port and DEBRA port (i.e., each port has a maximum cargo capacity restriction for different ship types). If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity , that is, it meets the cargo volume restriction principle, then the current unloading plan will be used as the optimal unloading path; if the cargo volume of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo volume, that is, it does not meet the cargo volume restriction principle, then the unloading plan with the second shortest total sailing mileage (that is, the suboptimal path plan in the unloading plan) will be selected as the new current unloading plan, and the judgment of the cargo volume restriction condition will be repeated based on the new current unloading plan, until the cargo volume of the target ship entering and leaving the unloading port is less than the maximum cargo volume (that is, until the plan meets the cargo volume restriction principle), and then the new current unloading plan meets the cargo volume restriction principle. In other words, based on the comparison between the cargo volume of the target ship entering and leaving the unloading port and the maximum cargo volume, it is judged whether the cargo volume restriction principle is met, such as Figure 1 As shown, it can also be understood as checking whether the transport capacity entering and leaving the unloading point meets the draft restriction. When the draft restriction is met, the subsequent optimal unloading path search step is entered into the calculation process. When the draft restriction is not met, the suboptimal path solution in the feasible solution is selected and returned to obtain the feasible solution with the shortest path and check whether the transport capacity entering and leaving the unloading point meets the draft restriction. The judgment is repeated until the draft restriction is met.

[0042] Furthermore, the cargo capacity limitation step may also be inserted with a manual correction step, or in other words, the cargo capacity limitation step includes a manual correction step, and the manual correction step is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation step repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and the new current unloading plan satisfies the cargo capacity limitation principle.

[0043] Preferably, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limit table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limit principle.

[0044] 5. Optimal unloading path search steps: For the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, calculate the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point, and then load the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point into the scheduling plan to form the optimal unloading path for the ship.

[0045] After obtaining the optimal unloading path, the time when the target ship arrives at each unloading port and the unloading completion time under the optimal unloading path are also obtained. In addition, if the scheduling personnel believe that the optimal unloading path finally output is unreasonable, the order of unloading ports can be manually adjusted to obtain a new unloading plan, as shown in Table 2.

[0046] Table 2

[0047]

[0048] According to the adjusted order of unloading ports, the scheduling plan UUID, ship mobile service identification code, ship unloading volume at each unloading port, time of arrival at each unloading port, time of completion of unloading, time of leaving the unloading point and other information will be written into the loading and unloading schedule, thus completing the determination of the optimal unloading path for the ship after manual adjustment.

[0049] The present invention has obvious advantages over the existing general optimal unloading path search, and can accurately calculate the optimal unloading path. The data source of the present invention is real business data; the idea of ​​the present invention is simple and easy to implement.

[0050] The present invention also relates to a cargo unloading path search system, which corresponds to the above-mentioned cargo unloading path search method and can be understood as a system for implementing the above-mentioned method, including an information collection and data acquisition module, a cargo unloading plan calculation module, a navigation path construction and total navigation mileage calculation module, a cargo capacity restriction module and an optimal cargo unloading path search module connected in sequence. Specifically,

[0051] The information collection and data acquisition module collects the schedule plan selected by the user and the mobile service identification code of the target ship through the human-computer interaction interface, and obtains the port data of the target ship under the schedule plan, wherein the port data includes the unloading port, the loading port and the unloading volume at each unloading port;

[0052] The unloading plan calculation module automatically determines whether all the unloading ports of the target ship belong to the same area. If not, the scheduling plan and the mobile service identification code of the target ship are reselected; if so, all the unloading ports of the target ship are deduplicated, and all the remaining unloading ports after deduplication are sorted by a permutation and combination method to obtain multiple unloading plans;

[0053] The navigation path construction and total navigation mileage calculation module constructs all navigation paths of each unloading plan based on the last loading port and each unloading port in each unloading plan, and then obtains the total navigation mileage of all navigation paths in each unloading plan, and takes the unloading plan with the shortest total navigation mileage as the current unloading plan;

[0054] The cargo capacity restriction module, under the current unloading plan, compares the cargo capacity of the target ship entering and leaving each unloading port with the maximum cargo capacity of the unloading port. If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, the current unloading plan meets the cargo capacity restriction principle; if the cargo capacity of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo capacity, the unloading plan with the second shortest total sailing mileage is used as the new current unloading plan, and the judgment of the cargo capacity restriction condition is repeated based on the new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and then the new current unloading plan meets the cargo capacity restriction principle;

[0055] The optimal unloading path search module calculates the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point for the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, and then loads the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point into the scheduling plan to form the optimal unloading path for the ship.

[0056] Preferably, in the cargo capacity limitation module, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limitation table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limitation principle.

[0057] Preferably, it also includes a manual correction module, which is connected to the cargo capacity limitation module and is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation module then repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, so that the new current unloading plan meets the cargo capacity limitation principle.

[0058] Preferably, in the navigation path construction and total navigation mileage calculation module, after all navigation paths of each unloading plan are constructed, the distances between the unloading destinations of each section of each unloading plan are queried respectively through the associated port spacing table and the query results are summed up to obtain the total navigation mileage of all navigation paths in each unloading plan.

[0059] The present invention provides an objective and scientific unloading path search method and system, which sequentially performs data query, feasible solution generation, optimal solution that satisfies the cargo quantity restriction principle, manual correction and data storage, and utilizes the port data and cargo loading information of the target ship in combination with business logic to accurately calculate the optimal unloading path, effectively improving the selection efficiency of the unloading path, saving a lot of manpower and material resources, and promoting the rapid development of the transportation industry.

[0060] It should be noted that the above-described specific implementations can enable those skilled in the art to more fully understand the invention, but do not limit the invention in any way. Therefore, although this specification has described the invention in detail with reference to the drawings and embodiments, those skilled in the art should understand that the invention can still be modified or replaced by equivalents. In short, all technical solutions and improvements that do not deviate from the spirit and scope of the invention should be included in the protection scope of the patent for the invention.

Claims

1. A method for searching a loading path, characterized in that: The following steps are involved: Information collection and data acquisition steps: collecting the schedule plan selected by the user and the mobile service identification code of the target ship through the human-computer interaction interface, and obtaining the port data of the target ship under the schedule plan, the port data including the unloading port, the loading port and the unloading volume at each unloading port; Unloading plan calculation steps: automatically determine whether all unloading ports of the target ship belong to the same area. If not, reselect the scheduling plan and the mobile service identification code of the target ship; if so, remove duplicates from all unloading ports of the target ship, and sort all remaining unloading ports after removal of duplicates by permutation and combination method to obtain multiple unloading plans; Steps for constructing the navigation path and calculating the total navigation mileage: construct all the navigation paths of each unloading plan based on the last loading port and each unloading port in each unloading plan, and then obtain the total navigation mileage of all the navigation paths in each unloading plan, and take the unloading plan with the shortest total navigation mileage as the current unloading plan; Cargo capacity restriction step: under the current unloading plan, the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port. If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, the current unloading plan meets the cargo capacity restriction principle; if the cargo capacity of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo capacity, the unloading plan with the second shortest total voyage mileage is used as the new current unloading plan, and the judgment of the cargo capacity restriction condition is repeated based on the new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and then the new current unloading plan meets the cargo capacity restriction principle; Optimal unloading path search steps: For the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, calculate the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point, and then load the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time when the target ship arrives at each unloading port, completes unloading, and leaves the unloading point into the scheduling plan to form the optimal unloading path for the ship.

2. The method for searching a loading path according to claim 1, characterized in that: In the cargo capacity limitation step, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limitation table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limitation principle.

3. The method for searching a loading path according to claim 1 or 2, characterized in that: The cargo capacity limitation step also inserts / includes a manual correction step, which is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation step repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, so that the new current unloading plan meets the cargo capacity limitation principle.

4. The method for searching a loading path according to claim 1 or 2, characterized in that: In the information collection and data acquisition step, after obtaining the port data of the target ship, the port data is preprocessed to remove missing data of the loading port and the unloading port, data of unknown ports, and data of the loading port and the unloading port being the same port.

5. The method for searching a loading path according to claim 4, characterized in that: In the information collection and data acquisition steps, the pre-processed data is also cached, and a redis memory database is used for high-speed caching to speed up data query and reduce the amount of calculation.

6. The method for searching a loading path according to claim 1 or 2, characterized in that: In the navigation path construction and total navigation mileage calculation steps, after all navigation paths for each unloading plan are constructed, the distances between the unloading destinations of each section of each unloading plan are queried respectively through the associated port spacing table and the query results are summed up to obtain the total navigation mileage of all navigation paths in each unloading plan.

7. A cargo unloading route search system, characterized in that: It includes an information collection and data acquisition module, a cargo unloading plan calculation module, a navigation path construction and total navigation mileage calculation module, a cargo capacity restriction module and an optimal unloading path search module, which are connected in sequence. The information collection and data acquisition module collects the schedule plan selected by the user and the mobile service identification code of the target ship through the human-computer interaction interface, and obtains the port data of the target ship under the schedule plan, wherein the port data includes the unloading port, the loading port and the unloading volume at each unloading port; The unloading plan calculation module automatically determines whether all the unloading ports of the target ship belong to the same area. If not, the scheduling plan and the mobile service identification code of the target ship are reselected; if so, all the unloading ports of the target ship are deduplicated, and all the remaining unloading ports after deduplication are sorted by a permutation and combination method to obtain multiple unloading plans; The navigation path construction and total navigation mileage calculation module constructs all navigation paths of each unloading plan based on the last loading port and each unloading port in each unloading plan, and then obtains the total navigation mileage of all navigation paths in each unloading plan, and takes the unloading plan with the shortest total navigation mileage as the current unloading plan; The cargo capacity restriction module, under the current unloading plan, compares the cargo capacity of the target ship entering and leaving each unloading port with the maximum cargo capacity of the unloading port. If the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, the current unloading plan meets the cargo capacity restriction principle; if the cargo capacity of the target ship entering and leaving a certain unloading port is greater than or equal to the maximum cargo capacity, the unloading plan with the second shortest total sailing mileage is used as the new current unloading plan, and the judgment of the cargo capacity restriction condition is repeated based on the new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, and then the new current unloading plan meets the cargo capacity restriction principle; The optimal unloading path search module calculates the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point for the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, and then loads the current unloading plan / new current unloading plan that meets the principle of cargo quantity restriction, the unloading quantity of each unloading port, the time for the target ship to arrive at each unloading port, complete unloading and leave the unloading point into the scheduling plan to form the optimal unloading path for the ship.

8. The unloading route search system according to claim 7, characterized in that: In the cargo capacity limitation module, under the current unloading plan, the cargo capacity of the unloading plan entering and leaving each unloading port is calculated, and the maximum cargo capacity of the capacity entering and leaving each unloading port is obtained by querying the unloading point cargo capacity limitation table, and then the cargo capacity of the target ship entering and leaving each unloading port is compared with the maximum cargo capacity of the unloading port to determine whether the current unloading plan meets the cargo capacity limitation principle.

9. The unloading route search system according to claim 7 or 8, characterized in that: It also includes a manual correction module, which is connected to the cargo capacity limitation module and is used to manually adjust the unloading port sequence of the current unloading plan to obtain a new current unloading plan. The cargo capacity limitation module then repeats the judgment of the cargo capacity limitation condition based on the manually adjusted new current unloading plan until the cargo capacity of the target ship entering and leaving the unloading port is less than the maximum cargo capacity, so that the new current unloading plan meets the cargo capacity limitation principle.

10. The unloading route search system according to claim 7 or 8, characterized in that: In the navigation path construction and total navigation mileage calculation module, after all navigation paths of each unloading plan are constructed, the distances between the unloading destinations of each section of each unloading plan are queried respectively through the associated port spacing table and the query results are summed up to obtain the total navigation mileage of all navigation paths in each unloading plan.

Images