CN116843261A - Method and system for calculating shortest path of port transported grains - Google Patents

Method and system for calculating shortest path of port transported grains Download PDF

Info

Publication number
CN116843261A
CN116843261A CN202310678577.7A CN202310678577A CN116843261A CN 116843261 A CN116843261 A CN 116843261A CN 202310678577 A CN202310678577 A CN 202310678577A CN 116843261 A CN116843261 A CN 116843261A
Authority
CN
China
Prior art keywords
grain
bulk
port
grains
storage
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310678577.7A
Other languages
Chinese (zh)
Inventor
潘英豪
李涛
张华�
卢宁
杨承志
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Waterborne Transport Research Institute
Original Assignee
China Waterborne Transport Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Waterborne Transport Research Institute filed Critical China Waterborne Transport Research Institute
Priority to CN202310678577.7A priority Critical patent/CN116843261A/en
Publication of CN116843261A publication Critical patent/CN116843261A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

The invention discloses a method and a system for calculating the shortest path of port transportation grains, wherein the method comprises the following steps: acquiring all transit grain storages and mutual transportation paths which are near the port grain storages and can transport bulk grain for the port grain storages, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, traversing the bulk grain transportation directed graph to find out all paths from each transit grain storages to the port grain storage, wherein the top point of the bulk grain transportation directed graph is the port grain storages; the method comprises the steps of obtaining the quantity of bulk grains required by port grain storage, the quantity of bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains in each of the transit grain storage, setting a transportation path searching model, taking the quantity of the transit bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains as parameters, and combining all paths to find out the actual shortest path for transporting the required quantity of the bulk grains from the transit grain storage to the port grain storage.

Description

Method and system for calculating shortest path of port transported grains
Technical Field
The invention belongs to the technical field of port bulk grain transportation, and particularly relates to a method and a system for calculating the shortest path of port transported grains.
Background
Bulk grain: in the operations of loading, unloading, transporting, storing and the like in the grain circulation process, granular raw grains appear in a bulk form.
In the process of loading, unloading, transferring and storing bulk grain in ports, the amount of bulk grain is reduced directly or indirectly due to factors such as scattering and leakage, dust emission, water wetting, crushing, insect and mouse damage, heating, mildew, pollution and the like.
The package and transportation of grains make the cost of package and manpower loading and unloading higher, which results in increased operation cost and can not meet the four-dispersion requirements of bulk, bulk transportation, bulk unloading and bulk storage. However, as the grain producing areas are widely distributed and have more receiving, storing, loading and unloading links, the grain packing transportation still occupies a larger proportion, the grain packing and bulk grain logistics mode coexist, and the grain logistics bulk advantage cannot be fully exerted. The construction of the specialized technical matching equipment for the fortification is imperfect, the requirement of the fortification operation cannot be met, compared with the grain production cost, the conventional grain transportation cost is too high and occupies most of the grain logistics cost, so that a technical scheme is needed in urgent need from the transportation side or the port loading and unloading side, the transportation efficiency is improved, and the transportation cost and the labor cost are reduced.
Disclosure of Invention
In order to solve the technical problems, the invention provides an intelligent dispatching method and system for port transportation grains, comprising the following steps:
acquiring all transit grain storages and mutual transportation paths which are nearby a port grain storage and can transport bulk grains for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
the method comprises the steps of obtaining the quantity of bulk grains required by the grain storage of a port, the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains, setting a transportation path searching model, and searching an actual shortest path for transporting the required quantity of the bulk grains from the grain storage of the port to the grain storage of the port by taking the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains as parameters and combining all paths.
Further, the transportation path searching model is as follows:
Wherein g k For the k-th grain storage, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k For the transfer grain storage g k Distance to shortest path among all paths of the port grain warehouse, M k For the transfer grain storage g k N is the required bulk grain quantity;
MAX F(g)＝(g 1 ，g 2 …g k )
searching in all the transit grain storagesThe intermediate grain warehouse F (g) with the largest value sends the needed bulk grain quantity in the F (g)And (3) until the next transfer grain storage, if no transfer grain storage exists between the F (g) and the port grain storage, finishing traversing, otherwise, sending the required bulk grain quantity in the F (g) to the next transfer grain storage, and continuing traversing until the required bulk grain quantity is sent to the port grain storage.
Further, the transportation path searching model is as follows:
Traversing a bulk grain transportation directed graph, if the quantity of the scattered grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required scattered grains, circularly traversing the bulk grain transportation directed graph, if the quantity of the scattered grains required by the storage can be found and the sum of the quantity of the scattered grains required by the storage of the first transfer grain storage meets the quantity of the scattered grains required by the port grain storage, finding a cooperation relation between the searched transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
d is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k For the transfer grain storage g k Distance to shortest path among all paths of the port grain warehouse, M k For the transfer grain storage g k Is dispersed in the medium of (a)The grain quantity, N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the k And finally determining the actual shortest path relative to the storage of the transfer grain.
Further, the method further comprises the following steps: when the needed bulk grain is loaded and unloaded, the running time of the loading and unloading equipment is optimized.
Further, the optimizing the runtime of the handling device includes: assuming that the required bulk grain transportation flow totally passes through N loading and unloading devices, the loading and unloading devices S are sequentially arranged i I epsilon {1, …, N }, the time required for each loading and unloading device to start is respectivelyThe time for detecting the required bulk grain passing through the tail part of each loading and unloading device is T i t No desired bulk grain passes through for a period of time ofThe speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>The start-up time of each of the remaining handling equipment may be set as:
If T i q When the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, e is an superscript for distinguishing the individual parameters.
The invention also provides an intelligent dispatching system for port transportation grains, which comprises the following steps:
acquiring all transit grain storages and mutual transportation paths which are nearby a port grain storage and can transport bulk grains for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
the method comprises the steps of obtaining the quantity of bulk grains required by the grain storage of a port, the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains, setting a transportation path searching model, and searching an actual shortest path for transporting the required quantity of the bulk grains from the grain storage of the port to the grain storage of the port by taking the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains as parameters and combining all paths.
Further, the transportation path searching model is as follows:
wherein g k For the k-th grain storage, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k Is said inGrain storage g k Distance to shortest path among all paths of the port grain warehouse, M k For the transfer grain storage g k N is the required bulk grain quantity;
MAX F(g)＝(g 1 ，g 2 …g k )
searching in all the transit grain storagesAnd (3) conveying the required bulk grain quantity in the F (g) to a next transit grain warehouse, ending traversing if no transit grain warehouse exists between the F (g) and the port grain warehouse, otherwise, conveying the required bulk grain quantity in the F (g) to the next transit grain warehouse, and continuing traversing until conveying the required bulk grain quantity to the port grain warehouse.
Further, the transportation path searching model is as follows:
traversing a bulk grain transportation directed graph, if the quantity of the scattered grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required scattered grains, circularly traversing the bulk grain transportation directed graph, if the quantity of the scattered grains required by the storage can be found and the sum of the quantity of the scattered grains required by the storage of the first transfer grain storage meets the quantity of the scattered grains required by the port grain storage, finding a cooperation relation between the searched transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
d is the collaboration relationship set, D k For the kth cooperative relationship，A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k For the transfer grain storage g k Distance to shortest path among all paths of the port grain warehouse, M k For the transfer grain storage g k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the k And finally determining the actual shortest path relative to the storage of the transfer grain.
Further, the method further comprises the following steps: when the needed bulk grain is loaded and unloaded, the running time of the loading and unloading equipment is optimized.
Further, the optimizing the runtime of the handling device includes: assuming that the required bulk grain transportation flow totally passes through N loading and unloading devices, the loading and unloading devices S are sequentially arranged i I epsilon {1, …, N }, the time required for each loading and unloading device to start is respectivelyThe time for detecting the required bulk grain passing through the tail part of each loading and unloading device is T i t No desired bulk grain passes through for a period of time ofThe speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +. >It can be setThe starting time of each loading and unloading device is as follows:
if T i q When the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, e is an superscript for distinguishing the individual parameters.
In general, the above technical solutions conceived by the present invention have the following beneficial effects compared with the prior art:
1. according to the technical scheme, the transportation path searching model is arranged, so that the quality of the needed bulk grain is ensured, the path distance between the bulk grain and the grain storage of the port is relatively shorter, and the transportation efficiency of the bulk grain is greatly improved under the condition of ensuring the quality of the grain;
2. according to the technical scheme, the loading and unloading time of the loading and unloading equipment is optimized, so that the efficiency of grains in the loading and unloading process is greatly improved, the labor cost is reduced, the time for loading and unloading grains is greatly shortened, and the technical problems of long time consumption and high labor cost of loading and unloading equipment in the prior art are solved
Drawings
FIG. 1 is a flow chart of the method of embodiment 1 of the present invention;
fig. 2 is a block diagram of a system of embodiment 2 of the present invention.
Detailed Description
In order to better understand the above technical solutions, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
The method provided by the invention can be implemented in a terminal environment, wherein the terminal can comprise one or more of the following components: processor, storage medium, and display screen. Wherein the storage medium has stored therein at least one instruction that is loaded and executed by the processor to implement the method described in the embodiments below.
The processor may include one or more processing cores. The processor connects various parts within the overall terminal using various interfaces and lines, performs various functions of the terminal and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the storage medium, and invoking data stored in the storage medium.
The storage medium may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (ROM). The storage medium may be used to store instructions, programs, code sets, or instructions.
The display screen is used for displaying a user interface of each application program.
In addition, it will be appreciated by those skilled in the art that the structure of the terminal described above is not limiting and that the terminal may include more or fewer components, or may combine certain components, or a different arrangement of components. For example, the terminal further includes components such as a radio frequency circuit, an input unit, a sensor, an audio circuit, a power supply, and the like, which are not described herein.
Example 1
As shown in fig. 1, an embodiment of the present invention provides a method for calculating a shortest path for transporting grains in a port, including:
step 101, acquiring all transit grain storages and mutual transportation paths which are near a port grain storage and can transport bulk grain for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
step 102, obtaining the quantity of bulk grain required by the port grain storage, the quantity of bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain in each of the transit grain storage, setting a transportation path searching model, and searching an actual shortest path for transporting the required quantity of bulk grain from the transit grain storage to the port grain storage by taking the quantity of transit bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain as parameters and combining all paths.
Specifically, the transportation path searching model is as follows:
wherein g k A is the status value of the grain stored in the k-th grain transfer warehouse, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Carrying out normalization treatment (wherein the temperature numerical constant, the relative humidity numerical constant and the bulk grain moisture numerical constant can be dynamically adjusted according to actual conditions, the basis of the dynamic adjustment is historical grain storage data, the constant is set for unifying parameters with different properties and facilitating calculation), L k For the distance from the kth transit grain warehouse to the shortest path in all paths of the port grain warehouse, M k The quantity of the intermediate bulk grain stored for the kth intermediate grain, wherein N is the required bulk grain quantity;
F(g)＝MAX(g 1 ，g 2 …g k )
searching in all the transit grain storagesThe grain state value of the intermediate grain warehouse with the largest value is measuredThe method is characterized in that the method is used as F (g), the required bulk grain quantity in the transit grain warehouse corresponding to F (g) is sent to the next transit grain warehouse, if no transit grain warehouse exists between the transit grain warehouse corresponding to F (g) and the port grain warehouse, the traversal is finished, otherwise, the required bulk grain quantity in the transit grain warehouse corresponding to F (g) is sent to the next transit grain warehouse, and then the traversal is continued until the required bulk grain quantity is sent to the port grain warehouse. For example, when bulk grain required for transporting from a middle grain warehouse is not only considered, but also considered, if a certain item of data exceeds a standard, for example, the temperature exceeds the highest temperature that grains can be stored, the grains may be spoiled, if the bulk grain is not transported timely, so that the purpose of selecting the middle grain warehouse can be better achieved by integrating indexes of the grains and transport paths of the middle grain warehouse, and when bulk grain is transported from one middle grain warehouse to the next middle grain warehouse, the bulk grain needs to be traversed, because the bulk grain needs to be transported from one middle grain warehouse to the next middle grain warehouse, during the time, the storage parameters of the corresponding bulk grain in other middle grain warehouses are likely to change, even the corresponding storage standard is not met, at this time, the bulk grain transported to the next middle grain warehouse may be required to continue to traverse, and the risk of spoiling the bulk grain generated by transporting from the middle grain warehouse which does not meet the storage standard can be greatly reduced.
The above transportation path searching model is provided that the number of bulk grains stored in the bulk grain storage must be equal to the number of bulk grains required by the port grain storage in the transportation directed graph, because in the actual operation process, the bulk grains stored in the vicinity of the port grain storage are generally equal to the bulk grains required by the port transportation, but one case is that the vicinity of the port grain storage is equal to the bulk grains required by the port transportation, and as shown above, the other case is that the vicinity of the port is equal to the bulk grains required by the port grain storage, and the bulk grains stored in the vicinity of the port are not equal to the bulk grains required by the port grain storage, so that the addition of the bulk grains stored in the vicinity of the port is required to meet the bulk grain required by the port storage, and the following steps are required:
specifically, when the bulk grain stored in the storage of the transfer grain near the port can meet the quantity of the bulk grain required by the storage of the grain in the port, the bulk grain stored in the storage of the transfer grain needs to be added, and the formed transportation path searching model can be as follows:
traversing a bulk grain transportation directed graph, if the quantity of bulk grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, and if the sum of the quantity of bulk grains required by the transfer grain storage and the quantity of bulk grains required by the port grain storage can be found to meet the quantity of bulk grains required by the port grain storage, finding a cooperation relation between the transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
D is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
The method comprises the steps of firstly determining a middle-transfer grain warehouse with the shortest path with the port grain warehouse, wherein the middle-transfer grain warehouse stores needed bulk grain, but the quantity is insufficient, adding the needed bulk grain with the bulk grain in other middle-transfer grain warehouses to meet the quantity of the bulk grain needed by the port grain warehouse, finding a model through the transportation path to know that one middle-transfer grain warehouse can meet the quantity of the bulk grain needed, or other combination forms can meet the quantity of the bulk grain needed, and comparing the combination forms.
The invention not only considers the aspect of bulk grain transportation, but also considers how to improve efficiency from grain loading and unloading processes, because the prior art usually realizes the loading and unloading operation of the grain raw material bin by manpower, the links of arranging operation, commanding operation, supervising operation, recording operation and the like are all dependent on manpower, therefore, in the process of executing the loading and unloading operation of the grain raw material bin, the problems of unordered operation, easy error, human cheating, supervision inadequacy, low efficiency and the like exist, the invention simultaneously brings the scheme of automatic adjustment of loading and unloading equipment into the whole technical scheme of the invention, and the scheme is matched with the above transportation technical scheme, optimizes the prior art at the transportation end and the loading and unloading end, thereby achieving the technical effect of improving efficiency in the whole flow of the water path transportation of grains, and is as follows:
further, the operating time of the loading and unloading equipment is optimized when the needed bulk grain is loaded and unloaded.
Specifically, the optimizing the operation time of the loading and unloading equipment comprises: assuming that the required bulk grain transportation flow passes through N loading and unloading devices in total, the time required for each loading and unloading device to start isi epsilon {1, …, N }, the time for each loading and unloading equipment tail to detect the passing of the required bulk grain is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
if it isWhen in use, let->
If it isWhen the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
By optimizing the loading and unloading time of the loading and unloading equipment, the efficiency of grains in the loading and unloading process is greatly improved, the labor cost is reduced, the time for loading and unloading grains is greatly shortened, and the technical problems of long time consumption and high labor cost of loading and unloading equipment in the prior art are solved.
Example 2
As shown in fig. 2, an embodiment of the present invention further provides a shortest path computing system for transporting grains in a port, including:
the system comprises an acquisition path module, a bulk grain transportation directed graph and a storage path module, wherein the acquisition path module is used for acquiring all transit grain storages and transportation paths which are nearby a port grain storage and can transport bulk grain for the port grain storages, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
The practical shortest path calculation module is used for obtaining the quantity of bulk grains required by the port grain storage, the quantity of bulk grains, the bulk grain temperature, the relative humidity of the bulk grains and the bulk grain moisture of each of the transit grain storage, setting a transportation path search model, and finding out the practical shortest path for transporting the required quantity of the bulk grains from the transit grain storage to the port grain storage by taking the quantity of the transit bulk grains, the bulk grain temperature, the relative humidity of the bulk grains and the bulk grain moisture as parameters and combining all paths.
Specifically, the transportation path searching model is as follows:
wherein g k A is the status value of the grain stored in the k-th grain transfer warehouse, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Carrying out normalization treatment (wherein the temperature numerical constant, the relative humidity numerical constant and the bulk grain moisture numerical constant can be dynamically adjusted according to actual conditions, the basis of the dynamic adjustment is historical grain storage data, the constant is set for unifying parameters with different properties and facilitating calculation), L k For the distance from the kth transit grain warehouse to the shortest path in all paths of the port grain warehouse, M k For the k-th intermediate bulk grain in the intermediate bulk grain warehouse, N is the required bulk grain quantity, L is easily obtained in the prior art k However, during the transportation of bulk grains, from one grain storage to a port grain storage, there may be multiple grain storages, and during the transportation of bulk grains, there may be other grain storages, where the state of bulk grains is changed, for example, about to deteriorate, so that dynamic adjustment according to the grain state is required, then the transportation path is also dynamically changed, then L k The method is not an actual shortest path, so that the method aims to find out the actual shortest path according to the actual state of the stored grains of each transfer grain;
F(g)＝MAX(g 1 ，g 2 …g k )
searching in all the transit grain storagesThe grain state value of the intermediate grain warehouse with the maximum value is used as the grain state valueAnd (3) for F (g), conveying the required bulk grain quantity in the transit grain warehouse corresponding to F (g) to the next transit grain warehouse, ending traversing if no transit grain warehouse exists between the transit grain warehouse corresponding to F (g) and the port grain warehouse, otherwise, conveying the required bulk grain quantity in the transit grain warehouse corresponding to F (g) to the next transit grain warehouse, and continuing traversing until conveying the required bulk grain quantity to the port grain warehouse. For example, when bulk grain required for transporting from a middle grain warehouse is not only considered, but also considered, if a certain item of data exceeds a standard, for example, the temperature exceeds the highest temperature that grains can be stored, the grains may be spoiled, if the bulk grain is not transported timely, so that the purpose of selecting the middle grain warehouse can be better achieved by integrating indexes of the grains and transport paths of the middle grain warehouse, and when bulk grain is transported from one middle grain warehouse to the next middle grain warehouse, the bulk grain needs to be traversed, because the bulk grain needs to be transported from one middle grain warehouse to the next middle grain warehouse, during the time, the storage parameters of the corresponding bulk grain in other middle grain warehouses are likely to change, even the corresponding storage standard is not met, at this time, the bulk grain transported to the next middle grain warehouse may be required to continue to traverse, and the risk of spoiling the bulk grain generated by transporting from the middle grain warehouse which does not meet the storage standard can be greatly reduced.
The above transportation path searching model is provided that the number of bulk grains stored in the bulk grain storage must be equal to the number of bulk grains required by the port grain storage in the transportation directed graph, because in the actual operation process, the bulk grains stored in the vicinity of the port grain storage are generally equal to the bulk grains required by the port transportation, but one case is that the vicinity of the port grain storage is equal to the bulk grains required by the port transportation, and as shown above, the other case is that the vicinity of the port is equal to the bulk grains required by the port grain storage, and the bulk grains stored in the vicinity of the port are not equal to the bulk grains required by the port grain storage, so that the addition of the bulk grains stored in the vicinity of the port is required to meet the bulk grain required by the port storage, and the following steps are required:
specifically, when the bulk grain stored in the storage of the transfer grain near the port can meet the quantity of the bulk grain required by the storage of the grain in the port, the bulk grain stored in the storage of the transfer grain needs to be added, and the formed transportation path searching model can be as follows:
traversing a bulk grain transportation directed graph, if the quantity of the required bulk grains stored in the transfer grain bin can meet the quantity requirement of the port grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, if the sum of the quantity of the required bulk grains stored in the first transfer grain storage and the quantity of the required bulk grains stored in the first transfer grain storage can meet the quantity of the required bulk grains stored in the port grain storage, finding the transfer grain storage and the second transfer grain storage to have a cooperative relation (the cooperative relation is that when the quantity of the bulk grains stored in the first transfer grain storage does not meet the quantity requirement, finding a second transfer grain storage, and if the sum of the bulk grains in the second transfer grain storage and the first transfer grain storage can meet the quantity of the bulk grains, the first transfer grain storage and the second transfer grain storage have the cooperative relation), and generating the cooperative relation set, wherein the cooperative relation set is expressed as:
D＝(d 1 ，d 2 …d k )
D is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k For the kth transit grainThe bulk grain moisture, A ', B ' and C ' are respectively temperature numerical constant, relative humidity numerical constant and bulk grain moisture numerical constant, and are used for adding A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
The method comprises the steps of firstly determining a middle-transfer grain warehouse with the shortest path with the port grain warehouse, wherein the middle-transfer grain warehouse stores needed bulk grain, but the quantity is insufficient, adding the needed bulk grain with the bulk grain in other middle-transfer grain warehouses to meet the quantity of the bulk grain needed by the port grain warehouse, finding a model through the transportation path to know that one middle-transfer grain warehouse can meet the quantity of the bulk grain needed, or other combination forms can meet the quantity of the bulk grain needed, and comparing the combination forms.
The invention not only considers the aspect of bulk grain transportation, but also considers how to improve efficiency from grain loading and unloading processes, because the prior art usually realizes the loading and unloading operation of the grain raw material bin by manpower, the links of arranging operation, commanding operation, supervising operation, recording operation and the like are all dependent on manpower, therefore, in the process of executing the loading and unloading operation of the grain raw material bin, the problems of unordered operation, easy error, human cheating, supervision inadequacy, low efficiency and the like exist, the invention simultaneously brings the scheme of automatic adjustment of loading and unloading equipment into the whole technical scheme of the invention, and the scheme is matched with the above transportation technical scheme, optimizes the prior art at the transportation end and the loading and unloading end, thereby achieving the technical effect of improving efficiency in the whole flow of the water path transportation of grains, and is as follows:
further, the operating time of the loading and unloading equipment is optimized when the needed bulk grain is loaded and unloaded.
Specifically, the optimizing the operation time of the loading and unloading equipment comprises: assuming that the required bulk grain transportation flow passes through N loading and unloading devices in total, the time required for each loading and unloading device to start isi.e { 1..the.N }, the time for each loading and unloading device tail to detect the required bulk grain to pass through is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
/>
if it isWhen in use, let->
If it isWhen the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
By optimizing the loading and unloading time of the loading and unloading equipment, the efficiency of grains in the loading and unloading process is greatly improved, the labor cost is reduced, the time for loading and unloading grains is greatly shortened, and the technical problems of long time consumption and high labor cost of loading and unloading equipment in the prior art are solved.
Example 3
The embodiment of the invention also provides a storage medium which stores a plurality of instructions for realizing the shortest path calculation method for transporting grains in the port.
Alternatively, in this embodiment, the storage medium may be located in any one of the computer terminals in the computer terminal group in the computer network, or in any one of the mobile terminals in the mobile terminal group.
Alternatively, in the present embodiment, the storage medium is configured to store program code for performing the steps of: step 101, acquiring all transit grain storages and mutual transportation paths which are near a port grain storage and can transport bulk grain for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
step 102, obtaining the quantity of bulk grain required by the port grain storage, the quantity of bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain in each of the transit grain storage, setting a transportation path searching model, and searching an actual shortest path for transporting the required quantity of bulk grain from the transit grain storage to the port grain storage by taking the quantity of transit bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain as parameters and combining all paths.
Specifically, the transportation path searching model is as follows:
Wherein g k A is the status value of the grain stored in the k-th grain transfer warehouse, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Carrying out normalization treatment (wherein the temperature numerical constant, the relative humidity numerical constant and the bulk grain moisture numerical constant can be dynamically adjusted according to actual conditions, the basis of the dynamic adjustment is historical grain storage data, the constant is set for unifying parameters with different properties and facilitating calculation), L k For the distance from the kth transit grain warehouse to the shortest path in all paths of the port grain warehouse, M k The quantity of the intermediate bulk grain stored for the kth intermediate grain, wherein N is the required bulk grain quantity;
F(g)＝MAX(g 1 ，g 2 …g k )
searching in all the transit grain storagesAnd (3) taking the grain state value of the intermediate grain warehouse with the largest value as F (g), sending the required bulk grain quantity in the intermediate grain warehouse corresponding to F (g) to the next intermediate grain warehouse, ending traversing if no intermediate grain warehouse exists between the intermediate grain warehouse corresponding to F (g) and the port grain warehouse, otherwise, sending the required bulk grain quantity in the intermediate grain warehouse corresponding to F (g) to the next intermediate grain warehouse, and continuing traversing until the required bulk grain quantity is sent to the port grain warehouse. For example, when bulk grain required for transporting from a middle grain warehouse is not only considered, but also considered, if a certain item of data exceeds a standard, for example, the temperature exceeds the highest temperature that grains can be stored, the grains may be spoiled, if the bulk grain is not transported timely, so that the purpose of selecting the middle grain warehouse can be better achieved by integrating indexes of the grains and transport paths of the middle grain warehouse, and when bulk grain is transported from one middle grain warehouse to the next middle grain warehouse, the bulk grain needs to be traversed, because the bulk grain needs to be transported from one middle grain warehouse to the next middle grain warehouse, during the time, the storage parameters of the corresponding bulk grain in other middle grain warehouses are likely to change, even the corresponding storage standard is not met, at this time, the bulk grain transported to the next middle grain warehouse may be required to continue to traverse, and the risk of spoiling the bulk grain generated by transporting from the middle grain warehouse which does not meet the storage standard can be greatly reduced.
The above transportation path searching model is provided that the number of bulk grains stored in the bulk grain storage must be equal to the number of bulk grains required by the port grain storage in the transportation directed graph, because in the actual operation process, the bulk grains stored in the vicinity of the port grain storage are generally equal to the bulk grains required by the port transportation, but one case is that the vicinity of the port grain storage is equal to the bulk grains required by the port transportation, and as shown above, the other case is that the vicinity of the port is equal to the bulk grains required by the port grain storage, and the bulk grains stored in the vicinity of the port are not equal to the bulk grains required by the port grain storage, so that the addition of the bulk grains stored in the vicinity of the port is required to meet the bulk grain required by the port storage, and the following steps are required:
specifically, when the bulk grain stored in the storage of the transfer grain near the port can meet the quantity of the bulk grain required by the storage of the grain in the port, the bulk grain stored in the storage of the transfer grain needs to be added, and the formed transportation path searching model can be as follows:
traversing a bulk grain transportation directed graph, if the quantity of bulk grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, and if the sum of the quantity of bulk grains required by the transfer grain storage and the quantity of bulk grains required by the port grain storage can be found to meet the quantity of bulk grains required by the port grain storage, finding a cooperation relation between the transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
D is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
The method comprises the steps of firstly determining a middle-transfer grain warehouse with the shortest path with the port grain warehouse, wherein the middle-transfer grain warehouse stores needed bulk grain, but the quantity is insufficient, adding the needed bulk grain with the bulk grain in other middle-transfer grain warehouses to meet the quantity of the bulk grain needed by the port grain warehouse, finding a model through the transportation path to know that one middle-transfer grain warehouse can meet the quantity of the bulk grain needed, or other combination forms can meet the quantity of the bulk grain needed, and comparing the combination forms.
The invention not only considers the aspect of bulk grain transportation, but also considers how to improve efficiency from grain loading and unloading processes, because the prior art usually realizes the loading and unloading operation of the grain raw material bin by manpower, the links of arranging operation, commanding operation, supervising operation, recording operation and the like are all dependent on manpower, therefore, in the process of executing the loading and unloading operation of the grain raw material bin, the problems of unordered operation, easy error, human cheating, supervision inadequacy, low efficiency and the like exist, the invention simultaneously brings the scheme of automatic adjustment of loading and unloading equipment into the whole technical scheme of the invention, and the scheme is matched with the above transportation technical scheme, optimizes the prior art at the transportation end and the loading and unloading end, thereby achieving the technical effect of improving efficiency in the whole flow of the water path transportation of grains, and is as follows:
further, the operating time of the loading and unloading equipment is optimized when the needed bulk grain is loaded and unloaded.
Specifically, the optimizing the operation time of the loading and unloading equipment comprises: assuming that the required bulk grain transportation flow passes through N loading and unloading devices in total, the time required for each loading and unloading device to start isi epsilon {1, …, N }, the time for each loading and unloading equipment tail to detect the passing of the required bulk grain is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
if it isWhen in use, let->
If it isLess than 0, the loading and unloading equipment is started up simultaneouslyThe loading and unloading equipment is also started;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
By optimizing the loading and unloading time of the loading and unloading equipment, the efficiency of grains in the loading and unloading process is greatly improved, the labor cost is reduced, the time for loading and unloading grains is greatly shortened, and the technical problems of long time consumption and high labor cost of loading and unloading equipment in the prior art are solved.
Example 4
The embodiment of the invention also provides electronic equipment, which comprises a processor and a storage medium connected with the processor, wherein the storage medium stores a plurality of instructions, and the instructions can be loaded and executed by the processor so that the processor can execute the shortest path calculation method for transporting grains in a port.
Specifically, the electronic device of the present embodiment may be a computer terminal, and the computer terminal may include: one or more processors, and a storage medium.
The storage medium may be used to store a software program and a module, for example, in an embodiment of the present invention, corresponding program instructions/modules are executed by the processor to execute various functional applications and data processing by running the software program and the module stored in the storage medium, that is, to implement the above-mentioned shortest path calculation method for transporting grains in a port. The storage medium may include a high-speed random access storage medium, and may also include a non-volatile storage medium, such as one or more magnetic storage systems, flash memory, or other non-volatile solid-state storage medium. In some examples, the storage medium may further include a storage medium remotely located with respect to the processor, and the remote storage medium may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The processor may invoke the information stored in the storage medium and the application program via the transmission system to perform the following steps: step 101, acquiring all transit grain storages and mutual transportation paths which are near a port grain storage and can transport bulk grain for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
Step 102, obtaining the quantity of bulk grain required by the port grain storage, the quantity of bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain in each of the transit grain storage, setting a transportation path searching model, and searching an actual shortest path for transporting the required quantity of bulk grain from the transit grain storage to the port grain storage by taking the quantity of transit bulk grain, the temperature of bulk grain, the relative humidity of bulk grain and the moisture of bulk grain as parameters and combining all paths.
Specifically, the transportation path searching model is as follows:
wherein g k A is the status value of the grain stored in the k-th grain transfer warehouse, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization (where temperature and relative humidity values and bulk waterThe fractional value constant can be dynamically adjusted according to actual conditions, the basis of the dynamic adjustment is historical grain storage data, the constant is set for unifying parameters with different attributes, and the calculation is convenient), L k For the distance from the kth transit grain warehouse to the shortest path in all paths of the port grain warehouse, M k The quantity of the intermediate bulk grain stored for the kth intermediate grain, wherein N is the required bulk grain quantity;
F(g)＝MAX(g 1 ，g 2 …g k )
searching in all the transit grain storagesAnd (3) taking the grain state value of the intermediate grain warehouse with the largest value as F (g), sending the required bulk grain quantity in the intermediate grain warehouse corresponding to F (g) to the next intermediate grain warehouse, ending traversing if no intermediate grain warehouse exists between the intermediate grain warehouse corresponding to F (g) and the port grain warehouse, otherwise, sending the required bulk grain quantity in the intermediate grain warehouse corresponding to F (g) to the next intermediate grain warehouse, and continuing traversing until the required bulk grain quantity is sent to the port grain warehouse. For example, when bulk grain is transported from a middle grain warehouse, not only the length of the path is considered, but also various data of grains in the middle grain warehouse are considered, if a certain data is out of standard, for example, the temperature exceeds the highest temperature that grains can be stored, the grains may be spoiled, if the grains are not transported out in time, the indexes of various grains and the transportation path of the middle grain warehouse are integrated, the purpose of selecting the middle grain warehouse can be better achieved, and when bulk grain is transported from one middle grain warehouse to the next middle grain warehouse, the bulk grain needs to be traversed, because the bulk grain is transported from one middle grain warehouse to the next middle grain warehouse, the storage parameters of the corresponding bulk grain in other middle grain warehouses are likely to be changed, and even the storage parameters of the corresponding bulk grain in other middle grain warehouses cannot be reached If the storage standard is met, the bulk grain transported to the next storage standard may be traversed continuously, and the bulk grain is transported from the storage standard which is not met, so that the risk of grain spoilage is reduced greatly.
The above transportation path searching model is provided that the number of bulk grains stored in the bulk grain storage must be equal to the number of bulk grains required by the port grain storage in the transportation directed graph, because in the actual operation process, the bulk grains stored in the vicinity of the port grain storage are generally equal to the bulk grains required by the port transportation, but one case is that the vicinity of the port grain storage is equal to the bulk grains required by the port transportation, and as shown above, the other case is that the vicinity of the port is equal to the bulk grains required by the port grain storage, and the bulk grains stored in the vicinity of the port are not equal to the bulk grains required by the port grain storage, so that the addition of the bulk grains stored in the vicinity of the port is required to meet the bulk grain required by the port storage, and the following steps are required:
specifically, when the bulk grain stored in the storage of the transfer grain near the port can meet the quantity of the bulk grain required by the storage of the grain in the port, the bulk grain stored in the storage of the transfer grain needs to be added, and the formed transportation path searching model can be as follows:
Traversing a bulk grain transportation directed graph, if the quantity of bulk grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, and if the sum of the quantity of bulk grains required by the transfer grain storage and the quantity of bulk grains required by the port grain storage can be found to meet the quantity of bulk grains required by the port grain storage, finding a cooperation relation between the transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
d is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
The method comprises the steps of firstly determining a middle-transfer grain warehouse with the shortest path with the port grain warehouse, wherein the middle-transfer grain warehouse stores needed bulk grain, but the quantity is insufficient, adding the needed bulk grain with the bulk grain in other middle-transfer grain warehouses to meet the quantity of the bulk grain needed by the port grain warehouse, finding a model through the transportation path to know that one middle-transfer grain warehouse can meet the quantity of the bulk grain needed, or other combination forms can meet the quantity of the bulk grain needed, and comparing the combination forms.
The invention not only considers the aspect of bulk grain transportation, but also considers how to improve efficiency from grain loading and unloading processes, because the prior art usually realizes the loading and unloading operation of the grain raw material bin by manpower, the links of arranging operation, commanding operation, supervising operation, recording operation and the like are all dependent on manpower, therefore, in the process of executing the loading and unloading operation of the grain raw material bin, the problems of unordered operation, easy error, human cheating, supervision inadequacy, low efficiency and the like exist, the invention simultaneously brings the scheme of automatic adjustment of loading and unloading equipment into the whole technical scheme of the invention, and the scheme is matched with the above transportation technical scheme, optimizes the prior art at the transportation end and the loading and unloading end, thereby achieving the technical effect of improving efficiency in the whole flow of the water path transportation of grains, and is as follows:
further, the operating time of the loading and unloading equipment is optimized when the needed bulk grain is loaded and unloaded.
Specifically, the optimizing the operation time of the loading and unloading equipment comprises: assuming that the required bulk grain transportation flow passes through N loading and unloading devices in total, the time required for each loading and unloading device to start isi epsilon {1, …, N }, the time for each loading and unloading equipment tail to detect the passing of the required bulk grain is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
if it isWhen in use, let->
If it isWhen the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
By optimizing the loading and unloading time of the loading and unloading equipment, the efficiency of grains in the loading and unloading process is greatly improved, the labor cost is reduced, the time for loading and unloading grains is greatly shortened, and the technical problems of long time consumption and high labor cost of loading and unloading equipment in the prior art are solved.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed technology may be implemented in other manners. The system embodiments described above are merely exemplary, and for example, the division of the units is merely a logic function division, and there may be another division manner in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or partly in the form of a software product or all or part of the technical solution, which is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a random-access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or the like, which can store program codes.
It is apparent that the above examples are given by way of illustration only and are not limiting of the embodiments. Other variations or modifications of the above teachings will be apparent to those of ordinary skill in the art. It is not necessary here nor is it exhaustive of all embodiments. While still being apparent from variations or modifications that may be made by those skilled in the art are within the scope of the invention.

Claims (6)

1. A method for calculating a shortest path for transporting grain at a port, comprising:
acquiring all transit grain storages and mutual transportation paths which are nearby a port grain storage and can transport bulk grains for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
acquiring the quantity of bulk grains required by the port grain storage, the quantity of bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains in each of the port grain storage, setting a transportation path searching model, and combining all paths to find an actual shortest path for transporting the required quantity of the bulk grains from the port grain storage to the port grain storage by taking the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains as parameters, wherein the transportation path searching model is as follows:
Traversing a bulk grain transportation directed graph, if the quantity of bulk grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, and if the sum of the quantity of bulk grains required by the transfer grain storage and the quantity of bulk grains required by the port grain storage can be found to meet the quantity of bulk grains required by the port grain storage, finding a cooperation relation between the transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ,d 2 ...d k )
d is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
2. The method for calculating the shortest path for transporting grains at a port according to claim 1, further comprising: when the needed bulk grain is loaded and unloaded, the running time of the loading and unloading equipment is optimized.
3. The method for calculating the shortest path for transporting grain at a port according to claim 2, wherein optimizing the operation time of the loading and unloading equipment comprises:
assuming that the required bulk grain transportation flow goes through N loading and unloading processes in totalThe time required for starting each loading and unloading device isThe time for detecting the required bulk grain passing through the tail part of each loading and unloading device is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
if it isWhen in use, let->
If it isWhen the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
4. A shortest path computing system for transporting grain at a port, comprising:
acquiring all transit grain storages and mutual transportation paths which are nearby a port grain storage and can transport bulk grains for the port grain storage, performing topological operation on all transit grain storages and transportation paths to generate a bulk grain transportation directed graph, wherein the vertex of the bulk grain transportation directed graph is the port grain storage, traversing the bulk grain transportation directed graph, and finding out all paths from each transit grain storage to the port grain storage;
acquiring the quantity of bulk grains required by the port grain storage, the quantity of bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains in each of the port grain storage, setting a transportation path searching model, and combining all paths to find an actual shortest path for transporting the required quantity of the bulk grains from the port grain storage to the port grain storage by taking the quantity of the bulk grains, the temperature of the bulk grains, the relative humidity of the bulk grains and the moisture of the bulk grains as parameters, wherein the transportation path searching model is as follows:
Traversing a bulk grain transportation directed graph, if the quantity of bulk grains required by the port grain storage can be met by the energy storage of the transfer grain storage, firstly finding a first transfer grain storage which has the shortest path with the port grain storage and stores the required bulk grains, circularly traversing the bulk grain transportation directed graph, and if the sum of the quantity of bulk grains required by the transfer grain storage and the quantity of bulk grains required by the port grain storage can be found to meet the quantity of bulk grains required by the port grain storage, finding a cooperation relation between the transfer grain storage and the second transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
D＝(d 1 ，d 2 …d k )
d is the collaboration relationship set, D k For the kth cooperative relationship, A k B, the bulk grain temperature of the kth intermediate grain warehouse k The relative humidity of the bulk grain stored for the kth transit grain, C k The bulk grain moisture stored for the kth transit grain, A ', B ' and C ' are respectively a temperature numerical constant, a relative humidity numerical constant and a bulk grain moisture numerical constant for the purpose of converting A k 、B k And C k Normalization processing is carried out, L k The transfer grain warehouse g is used for warehousing the kth transfer grain k Distance to shortest path among all paths of the port grain warehouse, M k The transfer grain warehouse g which is the kth transfer grain warehouse k N is the required bulk grain quantity;
finding out a cooperative relationship D with the largest cooperative relationship in the cooperative relationship set D k Determining a collaboration relationship d with the largest collaboration relationship k And (5) corresponding grain storage, and finally determining the actual shortest path.
5. The shortest path computing system for transporting grain at a port of claim 4, further comprising: when the needed bulk grain is loaded and unloaded, the running time of the loading and unloading equipment is optimized.
6. The shortest path computing system for transporting grain at a port of claim 5, wherein optimizing the operating time of the loading and unloading device comprises:
assuming that the required bulk grain transportation flow passes through N loading and unloading devices in total, the time required for each loading and unloading device to start isThe time for detecting the required bulk grain passing through the tail part of each loading and unloading device is T i t The time for which no desired bulk grain passes is +.>The speed of each loading and unloading equipment is v i The distance of the bulk grain from the tail part of the loading and unloading equipment to the head part of the loading and unloading equipment is l i Each loading and unloading device is set to be safe for +.>The start-up time of each of the remaining handling equipment is set to be:
if it isWhen in use, let->
If T i q When the load and unload speed is smaller than 0, starting the current loading and unloading equipment at the same time of starting the previous loading and unloading equipment;
if the first loading and unloading equipment is stopped, the stopping time of the rest loading and unloading equipment is as follows:
where i is a subscript and q, t, a, and e are superscripts for distinguishing the individual parameters.
CN202310678577.7A 2023-03-27 2023-03-27 Method and system for calculating shortest path of port transported grains Pending CN116843261A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310678577.7A CN116843261A (en) 2023-03-27 2023-03-27 Method and system for calculating shortest path of port transported grains

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202310678577.7A CN116843261A (en) 2023-03-27 2023-03-27 Method and system for calculating shortest path of port transported grains
CN202310303499.2A CN116029640B (en) 2023-03-27 2023-03-27 Intelligent dispatching method and system for port transportation grains

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN202310303499.2A Division CN116029640B (en) 2023-03-27 2023-03-27 Intelligent dispatching method and system for port transportation grains

Publications (1)

Publication Number Publication Date
CN116843261A true CN116843261A (en) 2023-10-03

Family

ID=86077904

Family Applications (2)

Application Number Title Priority Date Filing Date
CN202310303499.2A Active CN116029640B (en) 2023-03-27 2023-03-27 Intelligent dispatching method and system for port transportation grains
CN202310678577.7A Pending CN116843261A (en) 2023-03-27 2023-03-27 Method and system for calculating shortest path of port transported grains

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CN202310303499.2A Active CN116029640B (en) 2023-03-27 2023-03-27 Intelligent dispatching method and system for port transportation grains

Country Status (1)

Country Link
CN (2) CN116029640B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116107259B (en) * 2023-04-13 2023-06-16 交通运输部水运科学研究所 Grain mechanized horizontal warehouse control system and method for waterway transportation
CN116227247B (en) * 2023-05-09 2023-07-04 交通运输部水运科学研究所 Grain silo reverse simulation method and system based on big data

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140279658A1 (en) * 2013-03-12 2014-09-18 United Parcel Service Of America, Inc. Systems and methods of suggesting attended delivery/pickup locations
CN105883425A (en) * 2014-12-30 2016-08-24 北京巨柱智伟能源环保科技有限公司 Energy conservation, emission reduction and haze reduction system based on environmental logistics
CN111080212A (en) * 2020-01-02 2020-04-28 航天信息股份有限公司 Container grain historical logistics code-assigning block chain data acquisition method and system
CN113837692B (en) * 2021-09-23 2023-10-03 广州智湾科技有限公司 Intelligent scheduling decision method and decision system for port operation site vehicles
CN114861956B (en) * 2022-07-04 2022-09-13 深圳市大树人工智能科技有限公司 Intelligent port integrated management system
CN115796544A (en) * 2022-12-12 2023-03-14 北京斯年智驾科技有限公司 Dispatching method and device for unmanned horizontal transportation of port

Also Published As

Publication number Publication date
CN116029640B (en) 2023-07-04
CN116029640A (en) 2023-04-28

Similar Documents

Publication Publication Date Title
CN116029640B (en) Intelligent dispatching method and system for port transportation grains
EP3816919A1 (en) Order processing method and device, server, and storage medium
US20190220791A1 (en) Intelligent routing code for improved product distribution
CN108122082A (en) A kind of warehouse-out method and device
CN108341204A (en) A kind of intelligent robot cargo that serving storehouse management goes out to be put in storage method and system
CN110428197B (en) Task scheduling method and system for mobile carrying trolley
CN111382889A (en) Warehouse location recommendation method, device, equipment and medium
CN111626652A (en) Order processing method, device, system and medium
CN110689305A (en) Method and device for updating warehouse goods and logistics system
CN108906637A (en) Logistics method for sorting and terminal device
Zhong et al. Application of hybrid GA-PSO based on intelligent control fuzzy system in the integrated scheduling in automated container terminal
CN109993470B (en) Inventory scheduling method and device
CN105844313A (en) Linux system based radio frequency identification reading and writing device and the method for such reading and writing
CN116002257A (en) Warehouse system, warehouse system scheduling method, warehouse system scheduling device and electronic equipment
CN116402445A (en) Goods delivery scheduling method, device and computer equipment
CN116151723A (en) Multiple metering method and system for comprehensive grain reserve base
CN115310917B (en) Warehousing management method
EP4318349A1 (en) Method and apparatus for putting away turnover box
CN114613710A (en) Method, system and computer equipment for dispatching car in advance based on completion time
CN113780942A (en) Article transportation control method, device, equipment and storage medium
CN113592395A (en) Intelligent management method and equipment for industrial material warehousing and computer storage medium
CN114394440A (en) Stacking processing method, device, equipment, storage medium and product of container
CN112884305A (en) Warehouse logistics distribution method based on big data platform
CN106960303A (en) Cross-platform Hand-Hold Data Terminal intelligent storage auxiliary management method
CN116227247B (en) Grain silo reverse simulation method and system based on big data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination