CN116029640A - Intelligent dispatching method and system for port transportation grains - Google Patents

Intelligent dispatching method and system for port transportation grains Download PDF

Info

Publication number
CN116029640A
CN116029640A CN202310303499.2A CN202310303499A CN116029640A CN 116029640 A CN116029640 A CN 116029640A CN 202310303499 A CN202310303499 A CN 202310303499A CN 116029640 A CN116029640 A CN 116029640A
Authority
CN
China
Prior art keywords
grain
bulk
port
storage
grains
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.)
Granted
Application number
CN202310303499.2A
Other languages
Chinese (zh)
Other versions
CN116029640B (en
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 CN202310303499.2A priority Critical patent/CN116029640B/en
Priority to CN202310678577.7A priority patent/CN116843261A/en
Publication of CN116029640A publication Critical patent/CN116029640A/en
Application granted granted Critical
Publication of CN116029640B publication Critical patent/CN116029640B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Storage Of Harvested Produce (AREA)

Abstract

The invention discloses an intelligent dispatching method and system for 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 the grain storage of the 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 in each of the grain storage of the port, setting a transportation path searching model, 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 to find the actual shortest path for transporting the quantity of the required bulk grains from the grain storage of the bulk grains to the grain storage of the port.

Description

Intelligent dispatching method and system for port transportation grains
Technical Field
The invention belongs to the technical field of port bulk grain transportation, and particularly relates to an intelligent dispatching method and system for port bulk grain transportation.
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 total amount of grains transported by railways only in China is about 1 hundred million tons each year. 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. Bulk specific gravity is less than 15% from the whole industry. The northeast region is the region with highest bulk grain logistics transportation degree in China, and not only has 4000 special railway bulk grain transportation vehicles, but also has more perfect bulk grain transfer warehouse and port bulk grain transfer equipment. 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 grain transportation in China mainly depends on social force to carry out packaging transportation, the construction of the professional technology supporting equipment for the four-dispersion is imperfect, the requirement of the four-dispersion operation cannot be met, compared with the grain production cost, the current grain transportation cost in China 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 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:
Figure SMS_1
，
wherein ,
Figure SMS_5
for the kth intermediate grain warehouse, </i >>
Figure SMS_9
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_13
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_4
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_8
、
Figure SMS_12
and
Figure SMS_15
Respectively a temperature numerical constant, a relative humidity numerical constant and bulk grainMoisture numerical constant for treating ++>
Figure SMS_2
、
Figure SMS_6
and
Figure SMS_11
Normalization processing is performed>
Figure SMS_14
Warehouse +.>
Figure SMS_3
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_7
Warehouse +.>
Figure SMS_10
N is the required bulk grain quantity;
Figure SMS_16
，
searching in all the transit grain storages
Figure SMS_17
Intermediate grain warehouse with maximum value +.>
Figure SMS_18
The said
Figure SMS_19
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure SMS_20
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_21
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse 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 required bulk grains stored in the transfer grain bin can meet the quantity of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_22
，
Figure SMS_23
，
d is the set of collaboration relations to be described,
Figure SMS_25
for the kth cooperative relationship, +.>
Figure SMS_28
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_31
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_26
The bulk grain water stored for the kth transfer grainDivide (I) at the bottom>
Figure SMS_30
、
Figure SMS_33
and
Figure SMS_34
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_24
、
Figure SMS_29
and
Figure SMS_32
Normalization processing is performed>
Figure SMS_35
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +. >
Figure SMS_27
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_36
Determining the relation to said collaboration>
Figure SMS_37
And (5) corresponding grain storage, and finally determining the actual shortest path.
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 is totally passed through N loading and unloading devices according to the following conditionsSecondary loading and unloading equipment
Figure SMS_38
The time required for starting each loading and unloading device is respectively
Figure SMS_39
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_40
No desired bulk grain passes through for a period of time of
Figure SMS_41
The speed of each loading and unloading device is +.>
Figure SMS_42
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_43
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure SMS_44
The start time of each of the remaining handling equipment may be set as:
Figure SMS_45
if it is
Figure SMS_46
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:
Figure SMS_47
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:
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.
Further, the transportation path searching model is as follows:
Figure SMS_48
，
wherein ,
Figure SMS_50
for the kth intermediate grain warehouse, </i >>
Figure SMS_56
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_58
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_52
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_53
、
Figure SMS_60
and
Figure SMS_61
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_49
、
Figure SMS_54
and
Figure SMS_57
Normalization processing is performed>
Figure SMS_62
Warehouse +.>
Figure SMS_51
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_55
Warehouse +.>
Figure SMS_59
N is the required bulk grain quantity;
Figure SMS_63
，/>
searching in all the transit grain storages
Figure SMS_64
Intermediate grain warehouse with maximum value +.>
Figure SMS_65
The said
Figure SMS_66
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure SMS_67
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_68
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse 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 required bulk grains stored in the transfer grain bin can meet the quantity of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_69
，
Figure SMS_70
，
d is the set of collaboration relations to be described,
Figure SMS_72
for the kth cooperative relationship, +.>
Figure SMS_77
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_79
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_73
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_76
、
Figure SMS_78
and
Figure SMS_81
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +. >
Figure SMS_71
、
Figure SMS_75
and
Figure SMS_80
Normalization processing is performed>
Figure SMS_82
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure SMS_74
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_83
DeterminingIs in a>
Figure SMS_84
And (5) corresponding grain storage, and finally determining the actual shortest path.
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 are sequentially arranged
Figure SMS_85
The time required for the start-up of each loading and unloading device is +.>
Figure SMS_86
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_87
The time for which no desired bulk grain passes is +.>
Figure SMS_88
The speed of each loading and unloading device is +.>
Figure SMS_89
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_90
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +. >
Figure SMS_91
The start time of each of the remaining handling equipment may be set as: />
Figure SMS_92
If it is
Figure SMS_93
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:
Figure SMS_94
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 an intelligent dispatching method for port transportation grains, 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:
Figure SMS_95
，
wherein ,
Figure SMS_97
for the kth intermediate grain warehouse, </i >>
Figure SMS_102
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_107
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_99
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_103
、
Figure SMS_104
and
Figure SMS_108
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_96
、
Figure SMS_101
and
Figure SMS_106
Normalization (where temperature and relative humidity values and bulk moisture values are constantThe numerical constant can be dynamically adjusted according to actual conditions, the basis of the dynamic adjustment is that historical grain stores data, and the constant is set for unifying parameters with different attributes, so that the calculation is convenient),>
Figure SMS_109
warehouse +.>
Figure SMS_98
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_100
Warehouse +.>
Figure SMS_105
N is the required bulk grain quantity;
Figure SMS_110
，
searching in all the transit grain storages
Figure SMS_111
Intermediate grain warehouse with maximum value +.>
Figure SMS_112
The said
Figure SMS_113
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +. >
Figure SMS_114
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_115
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to theAnd (5) storing grains in a port. 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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_116
，
Figure SMS_117
，
D is the set of collaboration relations to be described,
Figure SMS_119
for the kth cooperative relationship, +.>
Figure SMS_124
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_126
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_120
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_122
、
Figure SMS_127
and
Figure SMS_129
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_118
、
Figure SMS_123
and
Figure SMS_125
Normalization processing is performed>
Figure SMS_128
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure SMS_121
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_130
Determining the relation to said collaboration>
Figure SMS_131
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 totally passes through N loading and unloading devices, the loading and unloading devices are sequentially arranged
Figure SMS_132
The time required for starting each loading and unloading device is respectively
Figure SMS_133
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_134
The time for which no desired bulk grain passes is +.>
Figure SMS_135
The speed of each loading and unloading device is +.>
Figure SMS_136
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_137
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure SMS_138
The start time of each of the remaining handling equipment may be set as:
Figure SMS_139
if it is
Figure SMS_140
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:
Figure SMS_141
where i is a subscript and q, t, a, e is an superscript 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, the embodiment of the present invention further provides an intelligent dispatching 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:
Figure SMS_142
，
wherein ,
Figure SMS_144
for the kth intermediate grain warehouse, </i >>
Figure SMS_148
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_151
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_146
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_150
、
Figure SMS_152
and
Figure SMS_155
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_143
、
Figure SMS_149
and
Figure SMS_154
Normalization processing (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, and the constant is set for unifying parameters with different properties and facilitating calculation) is carried out >
Figure SMS_156
Warehouse +.>
Figure SMS_145
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_147
Warehouse +.>
Figure SMS_153
N is the required bulk grain quantity;
Figure SMS_157
，
searching in all the transit grain storages
Figure SMS_158
Intermediate grain warehouse with maximum value +.>
Figure SMS_159
The->
Figure SMS_160
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure SMS_161
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_162
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to the port grain storage. 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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_163
，
Figure SMS_164
，
D is the set of collaboration relations to be described,
Figure SMS_166
is the kthCooperative relationship(s)>
Figure SMS_170
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_173
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_168
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_172
、
Figure SMS_177
and
Figure SMS_165
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_169
、
Figure SMS_174
and
Figure SMS_176
Normalization processing is performed>
Figure SMS_167
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure SMS_171
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_178
Determining a collaboration relationship with the user
Figure SMS_179
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 totally passes through N loading and unloading devices, the loading and unloading devices are sequentially arranged
Figure SMS_180
The time required for starting each loading and unloading device is respectively
Figure SMS_181
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_182
The time for which no desired bulk grain passes is +.>
Figure SMS_183
The speed of each loading and unloading device is +.>
Figure SMS_184
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_185
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure SMS_186
The start time of each of the remaining handling equipment may be set as:
Figure SMS_187
,
if it is
Figure SMS_188
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:
Figure SMS_189
where i is a subscript and q, t, a, e is an superscript 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 intelligent dispatching method for the port transportation grains.
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:
Figure SMS_190
，
wherein ,
Figure SMS_192
for the kth intermediate grain warehouse, </i >>
Figure SMS_198
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_201
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_194
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_196
、
Figure SMS_200
and
Figure SMS_204
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_191
、
Figure SMS_195
and
Figure SMS_199
The normalization process is carried out (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 that historical grain storage data is provided, and the constants are set for different attributesParameters are unified, convenient to calculate), and +.>
Figure SMS_203
Warehouse +.>
Figure SMS_193
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_197
For the storage of the transfer grain
Figure SMS_202
N is the required bulk grain quantity;
Figure SMS_205
，
searching in all the transit grain storages
Figure SMS_206
Intermediate grain warehouse with maximum value +.>
Figure SMS_207
The said
Figure SMS_208
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +. >
Figure SMS_209
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_210
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to the port grain storage. For example, when bulk grains are required for transportation from intermediate grain stores, not only the length of the path but also the intermediate grain stores are taken into considerationIf a certain item of data exceeds the standard, for example, the temperature exceeds the highest temperature that the grain can be stored, the grain may be spoiled, if the grain is not transported out in time, the grain can be spoiled, so the aim of selecting the grain for transfer can be better achieved by integrating the indexes of the grains and the transportation path of the grain for transfer, furthermore, when the bulk grain is transported from one grain for transfer to the next grain for transfer, the bulk grain is traversed, because the time is needed for transporting the bulk grain from one grain for transfer to the next grain for transfer, in the time, the storage parameters of the corresponding bulk grain for other grain for transfer are likely to change, even the corresponding storage standard is not met, the bulk grain transported to the next grain for transfer may meet the storage standard, then the bulk grain is required to be traversed continuously, and the risk of grain spoilage can be greatly reduced from the grain for transfer which does not meet the storage standard. / >
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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_211
，
Figure SMS_212
，
D is the set of collaboration relations to be described,
Figure SMS_214
for the kth cooperative relationship, +.>
Figure SMS_217
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_220
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_215
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_219
、
Figure SMS_222
and
Figure SMS_224
Respectively the temperature valuesThe constant of the magnetization, the constant of the relative humidity and the constant of the bulk moisture magnetization are used for the preparation of +.>
Figure SMS_213
、
Figure SMS_218
and
Figure SMS_221
Normalization processing is performed>
Figure SMS_223
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure SMS_216
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_225
Determining the relation to said collaboration>
Figure SMS_226
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 totally passes through N loading and unloading devices, the loading and unloading devices are sequentially arranged
Figure SMS_227
The time required for starting each loading and unloading device is respectively
Figure SMS_228
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_229
The time for which no desired bulk grain passes is +.>
Figure SMS_230
The speed of each loading and unloading device is +.>
Figure SMS_231
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_232
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure SMS_233
The start time of each of the remaining handling equipment may be set as:
Figure SMS_234
if it is
Figure SMS_235
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:
Figure SMS_236
where i is a subscript and q, t, a, e is an superscript 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 intelligent dispatching 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 can be used for storing software programs and modules, such as an intelligent dispatching method for port transportation grains in the embodiment of the invention, and the processor executes various functional applications and data processing by running the software programs and the modules stored in the storage medium, namely the intelligent dispatching method for port transportation grains is realized. 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:
Figure SMS_237
，
wherein ,
Figure SMS_241
for the kth intermediate grain warehouse, </i >>
Figure SMS_244
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_248
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_239
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_245
、
Figure SMS_247
and
Figure SMS_251
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure SMS_238
、
Figure SMS_242
and
Figure SMS_246
The normalization treatment is carried out (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 the historical grain storage data, and the purpose of setting the constants is that In the process of unifying parameters of different attributes, the calculation is convenient),>
Figure SMS_250
warehouse +.>
Figure SMS_240
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure SMS_243
For the storage of the transfer grain
Figure SMS_249
N is the required bulk grain quantity;
Figure SMS_252
，
searching in all the transit grain storages
Figure SMS_253
Intermediate grain warehouse with maximum value +.>
Figure SMS_254
The said
Figure SMS_255
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure SMS_256
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure SMS_257
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to the port grain storage. For example, when bulk grain is required for storage and transportation of the intermediate grain, not only the length of the path but also the length of the path are consideredIf a certain item of data exceeds the standard, for example, the temperature exceeds the highest temperature that the grain can be stored, the grain may be spoiled, if the grain is not transported out in time, the index of each item of grain and the transportation path of the grain storage are integrated, the purpose of selecting the grain storage can be better achieved, and when the bulk grain is transported from one grain storage to the next grain storage, the bulk grain is traversed, because the time is needed for transporting the bulk grain from one grain storage to the next grain storage, in the time, the storage parameters of the corresponding bulk grain in other grain storages are likely to be changed, even the corresponding storage standard cannot be met, the bulk grain transported to the next grain storage may be required to continue traversing, and the risk of grain spoilage can be greatly reduced from the grain storage transportation which does not meet the storage standard.
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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure SMS_258
，
Figure SMS_259
，
D is the set of collaboration relations to be described,
Figure SMS_261
for the kth cooperative relationship, +.>
Figure SMS_265
The bulk grain temperature stored for the kth transit grain is +.>
Figure SMS_269
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure SMS_262
The bulk grain water stored for the kth transfer grain is +.>
Figure SMS_266
、
Figure SMS_268
and
Figure SMS_271
Respectively are provided withFor the temperature, relative humidity and bulk grain moisture values, for the use of +.>
Figure SMS_260
、
Figure SMS_264
and
Figure SMS_267
Normalization processing is performed>
Figure SMS_270
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure SMS_263
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure SMS_272
Determining the relation to said collaboration>
Figure SMS_273
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 totally passes through N loading and unloading devices, the loading and unloading devices are sequentially arranged
Figure SMS_274
The time required for the start-up of each loading and unloading device is +. >
Figure SMS_275
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure SMS_276
The time for which no desired bulk grain passes is +.>
Figure SMS_277
The speed of each loading and unloading device is +.>
Figure SMS_278
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure SMS_279
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure SMS_280
The start time of each of the remaining handling equipment may be set as:
Figure SMS_281
，
if it is
Figure SMS_282
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:
Figure SMS_283
，
where i is a subscript and q, t, a, e is an superscript 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, randomAccess 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 (10)

1. An intelligent dispatching method for port transportation grains is characterized by 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.
2. The intelligent scheduling method for port transportation of grains according to claim 1, wherein the transportation path search model is:
Figure QLYQS_1
，
wherein ,
Figure QLYQS_4
for the kth intermediate grain warehouse, </i >>
Figure QLYQS_9
For the temperature of the bulk grain stored in the kth transit grain,
Figure QLYQS_11
the bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure QLYQS_5
The bulk grain water stored for the kth transfer grain is +.>
Figure QLYQS_8
、
Figure QLYQS_10
and
Figure QLYQS_14
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure QLYQS_2
、
Figure QLYQS_6
and
Figure QLYQS_12
Normalization processing is performed>
Figure QLYQS_15
Warehouse +.>
Figure QLYQS_3
Distance to shortest path among all paths of the port grain warehouseLeave, go up>
Figure QLYQS_7
Warehouse +.>
Figure QLYQS_13
N is the required bulk grain quantity;
Figure QLYQS_16
searching in all the transit grain storages
Figure QLYQS_17
Intermediate grain warehouse with maximum value +.>
Figure QLYQS_18
The->
Figure QLYQS_19
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure QLYQS_20
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure QLYQS_21
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to the port grain storage.
3. The intelligent scheduling method for port transportation of grains according to claim 1, wherein the transportation path search model is:
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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure QLYQS_22
Figure QLYQS_23
d is the set of collaboration relations to be described,
Figure QLYQS_25
for the kth cooperative relationship, +.>
Figure QLYQS_29
The bulk grain temperature stored for the kth transit grain is +.>
Figure QLYQS_33
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure QLYQS_27
The bulk grain water stored for the kth transfer grain is +.>
Figure QLYQS_30
、
Figure QLYQS_31
and
Figure QLYQS_34
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure QLYQS_26
、
Figure QLYQS_28
and
Figure QLYQS_32
Normalization processing is performed>
Figure QLYQS_35
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +. >
Figure QLYQS_24
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure QLYQS_36
Determining the relation to said collaboration>
Figure QLYQS_37
And (5) corresponding grain storage, and finally determining the actual shortest path.
4. The intelligent scheduling method for port transportation of grains 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.
5. The intelligent scheduling method for port transportation of grains according to claim 4, wherein optimizing the operation time of the loading and unloading equipment comprises: assuming the required bulk grain transportation flowThrough N loading and unloading devices in sequence
Figure QLYQS_38
The time required for the start-up of each loading and unloading device is +.>
Figure QLYQS_39
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure QLYQS_40
The time for which no desired bulk grain passes is +.>
Figure QLYQS_41
The speed of each loading and unloading device is +.>
Figure QLYQS_42
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +.>
Figure QLYQS_43
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +. >
Figure QLYQS_44
The start time of each of the remaining handling equipment may be set as:
Figure QLYQS_45
if it is
Figure QLYQS_46
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:
Figure QLYQS_47
where i is a subscript and q, t, a, e is an superscript for distinguishing the individual parameters.
6. An intelligent dispatch system for port transportation of grains, comprising:
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.
7. The intelligent dispatch system for port transporting food items of claim 6, wherein the transportation path finding model is:
Figure QLYQS_48
wherein ,
Figure QLYQS_51
for the kth intermediate grain warehouse, </i >>
Figure QLYQS_55
For the temperature of the bulk grain stored in the kth transit grain,
Figure QLYQS_57
the bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure QLYQS_52
The bulk grain water stored for the kth transfer grain is +.>
Figure QLYQS_54
、
Figure QLYQS_59
and
Figure QLYQS_61
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +.>
Figure QLYQS_49
、
Figure QLYQS_53
and
Figure QLYQS_60
Normalization processing is performed>
Figure QLYQS_62
Warehouse +.>
Figure QLYQS_50
Distance to shortest path among the all paths of the port grain warehouse, +.>
Figure QLYQS_56
Warehouse +.>
Figure QLYQS_58
N is the required bulk grain quantity;
Figure QLYQS_63
searching in all the transit grain storages
Figure QLYQS_64
Intermediate grain warehouse with maximum value +.>
Figure QLYQS_65
The said
Figure QLYQS_66
The required bulk grain quantity in (3) is sent to the next transit grain storage, if the bulk grain quantity is +.>
Figure QLYQS_67
If no intermediate grain storage exists between the port grain storage and the port grain storage, the traversal is finished, otherwise, the +.>
Figure QLYQS_68
After the required bulk grain quantity is sent to the next transit grain storage, continuing to traverse until the required bulk grain quantity is sent to the port grain storage.
8. The intelligent dispatch system for port transporting food items of claim 6, wherein the transportation path finding model is:
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 of the required bulk grains stored in the port grain storage, 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 quantity of the required bulk grains stored in the transfer grain storage can be found and the sum of the quantity of the required bulk grains stored in the first transfer grain storage meets the quantity of the required bulk grains stored in the port grain storage, finding a cooperation relation between the transfer grain storage and the first transfer grain storage, and generating a cooperation relation set, wherein the cooperation relation set is expressed as:
Figure QLYQS_69
Figure QLYQS_70
d is the set of collaboration relations to be described,
Figure QLYQS_72
for the kth cooperative relationship, +.>
Figure QLYQS_77
The bulk grain temperature stored for the kth transit grain is +.>
Figure QLYQS_79
The bulk grain stored for the kth transit grain is relative humidity,/for the bulk grain stored for the kth transit grain>
Figure QLYQS_73
The bulk grain water stored for the kth transfer grain is +.>
Figure QLYQS_75
、
Figure QLYQS_78
and
Figure QLYQS_81
Temperature, relative humidity and bulk grain moisture constants, respectively, for adding +. >
Figure QLYQS_71
、
Figure QLYQS_76
and
Figure QLYQS_80
Normalization processing is performed>
Figure QLYQS_82
Distance of shortest path from the transit grain warehouse to all paths of the port grain warehouse for storing needed bulk grain, +.>
Figure QLYQS_74
The quantity of the intermediate bulk grain stored for the intermediate grain storage is N, which is the required bulk grain quantity;
finding out the cooperative relationship with the largest cooperative relationship in the cooperative relationship set D
Figure QLYQS_83
Determining the relation to said collaboration>
Figure QLYQS_84
And (5) corresponding grain storage, and finally determining the actual shortest path.
9. The intelligent dispatch system for port transporting food items of claim 6, further comprising: when the needed bulk grain is loaded and unloaded, the running time of the loading and unloading equipment is optimized.
10. The intelligent dispatch system for port transportation of food items of claim 9, wherein optimizing the operating time of the loading and unloading equipment comprises: assuming that the required bulk grain transportation flow totally passes through N loading and unloading devices, the loading and unloading devices are sequentially arranged
Figure QLYQS_85
Each of which isThe time required for the start-up of the loading and unloading device is +.>
Figure QLYQS_86
The time for detecting the passing of the required bulk grain at the tail part of each loading and unloading device is +.>
Figure QLYQS_87
The time for which no desired bulk grain passes is +.>
Figure QLYQS_88
The speed of each loading and unloading device is +.>
Figure QLYQS_89
The distance of the required bulk grain from the tail of the loading and unloading equipment to the head of the loading and unloading equipment is +. >
Figure QLYQS_90
To ensure safety and prevent blocking, each loading and unloading device is provided with a safety time of +.>
Figure QLYQS_91
The start time of each of the remaining handling equipment may be set as:
Figure QLYQS_92
,
if it is
Figure QLYQS_93
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:
Figure QLYQS_94
,
where i is a subscript and q, t, a, e is an superscript for distinguishing the individual parameters.
CN202310303499.2A 2023-03-27 2023-03-27 Intelligent dispatching method and system for port transportation grains Active CN116029640B (en)

Priority Applications (2)

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

Applications Claiming Priority (1)

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

Related Child Applications (1)

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

Publications (2)

Publication Number Publication Date
CN116029640A true CN116029640A (en) 2023-04-28
CN116029640B CN116029640B (en) 2023-07-04

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 After (1)

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

Country Status (1)

Country Link
CN (2) CN116029640B (en)

Cited By (2)

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

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140278603A1 (en) * 2013-03-12 2014-09-18 United Parcel Service Of America, Inc. Systems and methods of locating and selling items at 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
CN113837692A (en) * 2021-09-23 2021-12-24 广州智湾科技有限公司 Intelligent scheduling decision method and decision system for vehicles in port operation field
CN114861956A (en) * 2022-07-04 2022-08-05 深圳市大树人工智能科技有限公司 Intelligent port integrated management system
CN115796544A (en) * 2022-12-12 2023-03-14 北京斯年智驾科技有限公司 Dispatching method and device for unmanned horizontal transportation of port

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140278603A1 (en) * 2013-03-12 2014-09-18 United Parcel Service Of America, Inc. Systems and methods of locating and selling items at 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
CN113837692A (en) * 2021-09-23 2021-12-24 广州智湾科技有限公司 Intelligent scheduling decision method and decision system for vehicles in port operation field
CN114861956A (en) * 2022-07-04 2022-08-05 深圳市大树人工智能科技有限公司 Intelligent port integrated management system
CN115796544A (en) * 2022-12-12 2023-03-14 北京斯年智驾科技有限公司 Dispatching method and device for unmanned horizontal transportation of port

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
PANPAN ZHANG ET AL.: "Applications of Robots in the Port and Shipping Area", 《2020 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMMUNICATION TECHNOLOGY》, pages 209 - 213 *
莫宝民 等: "粮食散装化运输对港口发展的影响", 《水运管理》, no. 09, pages 27 - 30 *
赵思敏: "粮食应急物流系统的网络构建及路径优化", 《中国优秀硕士学位论文全文数据库》, no. 09, pages 11 - 59 *

Cited By (2)

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

Also Published As

Publication number Publication date
CN116029640B (en) 2023-07-04
CN116843261A (en) 2023-10-03

Similar Documents

Publication Publication Date Title
CN116029640B (en) Intelligent dispatching method and system for port transportation grains
CN113213039B (en) Material box robot control method and device, electronic equipment and storage medium
CN108891838A (en) Order processing method, apparatus, electronic equipment and computer readable storage medium
CN108906637A (en) Logistics method for sorting and terminal device
CN111027902A (en) Unmanned warehouse goods transportation matching method and device
Zhong et al. Application of hybrid GA-PSO based on intelligent control fuzzy system in the integrated scheduling in automated container terminal
CN108453046A (en) A kind of intellectual access goods system and intellectual access pallet piling up method
CN110533373A (en) A kind of batch combined method of assembly line order
CN108622592B (en) Load regulation and control method and device for warehouse sorting line
CN113592395A (en) Intelligent management method and equipment for industrial material warehousing and computer storage medium
CN114529236A (en) Storage management method and device for goods shelf, electronic equipment and storage medium
CN204433573U (en) Detecting and controlling system taken inventory by a kind of pallet
CN116228079B (en) Grain container transportation scheduling method and system
CN108879970A (en) To the method and relevant device of mobile robot wireless charging
CN205003534U (en) Production warehousing and transportation system
CN103383757A (en) Cage trolley dispatching system for tobacco logistics distribution and dispatching method of system
CN105501782A (en) Warehousing system equipment and application thereof
CN112884305A (en) Warehouse logistics distribution method based on big data platform
CN113928770A (en) Method, device and equipment for determining box changing strategy of goods
CN116227247B (en) Grain silo reverse simulation method and system based on big data
CN113962619A (en) Freight shift determination method and device for waybill, electronic equipment and storage medium
CN218618464U (en) Warehousing system
CN205608753U (en) On -vehicle RFID identification system
WO2024032381A1 (en) Order processing method, apparatus and device, and warehousing system and storage medium
CN113534755B (en) Material storing and taking method and device based on rail shuttle trolley and intelligent equipment

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
GR01 Patent grant
GR01 Patent grant