CN116151723A - Multiple metering method and system for comprehensive grain reserve base - Google Patents
Multiple metering method and system for comprehensive grain reserve base Download PDFInfo
- Publication number
- CN116151723A CN116151723A CN202310429598.5A CN202310429598A CN116151723A CN 116151723 A CN116151723 A CN 116151723A CN 202310429598 A CN202310429598 A CN 202310429598A CN 116151723 A CN116151723 A CN 116151723A
- Authority
- CN
- China
- Prior art keywords
- grain
- storage
- base
- comprehensive
- certain
- 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
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/0834—Choice of carriers
- G06Q10/08345—Pricing
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Storage Of Harvested Produce (AREA)
Abstract
The invention discloses a grain comprehensive reserve base multiple metering method and a system, wherein the method comprises the following steps: acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain; training a base grain storage prediction model according to the historical grain storage data, and predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain; when a certain grain comprehensive storage base is needed to be stored in a warehouse, searching a plurality of target grain comprehensive storage bases which can meet the storage capacity of the certain grain in the warehouse according to the predicted grain storage data; and setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Description
Technical Field
The invention belongs to the technical field of grain multi-mode intermodal transportation, and particularly relates to a grain comprehensive storage base multi-metering method and system.
Background
With the continuous development of social economy, a single transportation mode is difficult to meet huge logistics demands and requirements on transportation efficiency and cost, and multi-mode intermodal transportation which organically connects the traditional split and split logistics transportation of water, iron, public, air, pipelines and the like in series is generated. The multi-type intermodal transportation can comprehensively utilize the advantages of multiple transportation modes, promote adjustment of transportation structures, shorten transportation turnover time, improve transportation efficiency and reduce logistics cost, thereby meeting the future social development demands.
However, under the condition of multi-mode intermodal transportation such as water, iron, public and the like, the comprehensive grain reserve base is used as a transit ground of the multi-mode intermodal transportation, and the difficulty of realizing the distributed storage of various grains and grease of the whole base under the complex condition is faced, and the comprehensive grain reserve base mainly has the following aspects:
1. at present, a grain comprehensive storage base lacks of an integral management system, actual grain condition metering work is mainly completed by granary management staff working under each grain depot, timeliness is not guaranteed, and due to opacity of each link, errors are generated in the step-by-step transmission process of grain condition data.
2. Under the multi-type intermodal condition, the comprehensive grain storage base is faced with the problems of rich grain varieties and large bidirectional material flow, and only by reasonably carrying out distributed storage on various grains and grease, unnecessary warehouse-reversing operation can be reduced, and the comprehensive grain storage efficiency is improved.
The comprehensive grain storing base relates to various transportation means such as belt conveyer, bucket elevator, etc. and it is important how to integrate various transportation capacity resources and to carry out the efficient transportation of all elements.
Disclosure of Invention
In order to solve the technical problems, the invention provides a grain comprehensive reserve base multiple metering method, which comprises the following steps:
acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain;
training a base grain storage prediction model according to the historical grain storage data, and predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain;
when a certain grain comprehensive storage base is needed to be stored in a warehouse, searching a plurality of target grain comprehensive storage bases which can meet the storage capacity of the certain grain in the warehouse according to the predicted grain storage data;
and setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Further, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
Further, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Further, constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
Further, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
The invention also provides a grain comprehensive reserve base multiple metering system, which comprises:
the historical grain storage data acquisition module is used for acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain;
the prediction module is used for training a base grain storage prediction model according to the historical grain storage data, predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain;
the searching module is used for searching a plurality of target grain comprehensive storage bases capable of meeting the storage amount of a certain grain to be stored according to the predicted grain storage data when the certain grain comprehensive storage base exists and the certain grain to be stored;
and the calculation module is used for setting an output and input cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Further, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
Further, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
To selectThe transportation time of the transportation route k from the grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Further, constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
Further, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
In general, the above technical solutions conceived by the present invention have the following beneficial effects compared with the prior art:
according to the method, various grains and grease are reasonably stored in a distributed manner under the condition of multi-mode intermodal transportation by utilizing an intelligent optimization algorithm, so that the automatic distribution of the weight of the grains stored in the whole base is realized.
The method of the invention fully coordinates transport capacity resources and realizes the efficient transport of all elements.
Drawings
FIG. 1 is a flow chart of the method of embodiment 1 of the present invention;
fig. 2 is a block diagram of a system of embodiment 2 of the present invention.
Detailed Description
In order to better understand the above technical solutions, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
The method provided by the invention can be implemented in a terminal environment, wherein the terminal can comprise one or more of the following components: processor, storage medium, and display screen. Wherein the storage medium has stored therein at least one instruction that is loaded and executed by the processor to implement the method described in the embodiments below.
The processor may include one or more processing cores. The processor connects various parts within the overall terminal using various interfaces and lines, performs various functions of the terminal and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the storage medium, and invoking data stored in the storage medium.
The storage medium may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (ROM). The storage medium may be used to store instructions, programs, code sets, or instructions.
The display screen is used for displaying a user interface of each application program.
In addition, it will be appreciated by those skilled in the art that the structure of the terminal described above is not limiting and that the terminal may include more or fewer components, or may combine certain components, or a different arrangement of components. For example, the terminal further includes components such as a radio frequency circuit, an input unit, a sensor, an audio circuit, a power supply, and the like, which are not described herein.
Example 1
As shown in fig. 1, an embodiment of the present invention provides a grain comprehensive reserve base multiple metering method, including:
specifically, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
specifically, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
And 104, setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Specifically, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
Example 2
As shown in fig. 2, the embodiment of the invention further provides a multiple metering method for a grain comprehensive reserve base, which comprises the following steps:
the historical grain storage data acquisition module is used for acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain;
the prediction module is used for training a base grain storage prediction model according to the historical grain storage data, predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain;
specifically, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
The searching module is used for searching a plurality of target grain comprehensive storage bases capable of meeting the storage amount of a certain grain to be stored according to the predicted grain storage data when the certain grain comprehensive storage base exists and the certain grain to be stored;
specifically, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
And the calculation module is used for setting an output and input cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Specifically, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
Example 3
The embodiment of the invention also provides a storage medium which stores a plurality of instructions for realizing the grain comprehensive reserve base multiple metering method.
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: a multiple metering method for a comprehensive grain reserve base, comprising:
specifically, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
specifically, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
And 104, setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Specifically, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
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 grain comprehensive reserve base multi-metering method.
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 enterprise vehicle environment-friendly monitoring method in the embodiment of the invention, corresponding program instructions/modules, 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 grain comprehensive storage base multi-metering method 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: a multiple metering method for a comprehensive grain reserve base, comprising:
specifically, the base grain storage prediction model is as follows:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
specifically, the method further comprises the following steps:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
And 104, setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
Specifically, the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a collection of target grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
Comprehensive storage of grain transported from grain-feeding site j to grain-feeding site for selecting transport route kSingle transportation cost of the preparation base i; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
Constraint conditions of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed technology may be implemented in other manners. The system embodiments described above are merely exemplary, and for example, the division of the units is merely a logic function division, and there may be another division manner in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or partly in the form of a software product or all or part of the technical solution, which is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-only memory (ROM), a random access memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or the like, which can store program codes.
It is apparent that the above examples are given by way of illustration only and are not limiting of the embodiments. Other variations or modifications of the above teachings will be apparent to those of ordinary skill in the art. It is not necessary here nor is it exhaustive of all embodiments. While still being apparent from variations or modifications that may be made by those skilled in the art are within the scope of the invention.
Claims (10)
1. A multiple metering method for a comprehensive grain reserve base, which is characterized by comprising the following steps:
acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain;
training a base grain storage prediction model according to the historical grain storage data, and predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain;
when a certain grain comprehensive storage base is needed to be stored in a warehouse, searching a plurality of target grain comprehensive storage bases which can meet the storage capacity of the certain grain in the warehouse according to the predicted grain storage data;
and setting an out-warehouse cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
2. The method for multiple metering of a comprehensive grain reserve base of claim 1, wherein the base grain reserve prediction model is:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The predicted storage amount of the grain with the type of C is E, and the E is the storage amount of all grains at presentThe total amount, D is the historical storage total amount of all grains, and a is the number of times of historical records.
3. The method for multiple metering of a comprehensive grain reserve base according to claim 2, wherein the warehouse-in and warehouse-out cost control model is as follows:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a set of target grain comprehensive reserve bases, < >>
The method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting a transport route k for grain delivery from a certain grain comprehensive storage base i to transport to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the single transportation quantity from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
4. A method for multiple metering of a comprehensive grain reserve base as claimed in claim 3, wherein the constraints of the warehouse-in and warehouse-out cost control model are as follows:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
5. The method of multiple metering of a grain complex reserve base of claim 1, further comprising:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
6. A multiple metering system for a comprehensive grain reserve base, comprising:
the historical grain storage data acquisition module is used for acquiring historical grain storage data of each grain comprehensive storage base, wherein the historical grain storage data comprises: historical storage of each grain;
the prediction module is used for training a base grain storage prediction model according to the historical grain storage data, predicting predicted grain storage data of each grain comprehensive storage base through the base grain storage prediction model, wherein the predicted grain storage data comprises: predictive storage for each grain;
the searching module is used for searching a plurality of target grain comprehensive storage bases capable of meeting the storage amount of a certain grain to be stored according to the predicted grain storage data when the certain grain comprehensive storage base exists and the certain grain to be stored;
and the calculation module is used for setting an output and input cost control model, and calculating the minimum cost value of transporting the grain from one grain comprehensive storage base to the target grain comprehensive storage base in the multiple target grain comprehensive storage bases.
7. The grain comprehensive reserve base multiple metering system of claim 6, wherein the base grain storage prediction model is:
wherein A is the history storage amount of the grain of the type A, B is the history storage amount of the grain of the type B, C is the history storage amount of the grain of the type C,
for the predicted storage of grain of class A +.>
For the predicted storage of grain of class B +.>
The method is characterized in that the method is used for predicting storage quantity of grains of the type C, E is the total storage quantity of all grains currently, D is the historical storage quantity of all grains, and a is the number of times of historical records.
8. The grain comprehensive storage base multiple metering system of claim 7, wherein the warehouse in and warehouse out cost control model is:
wherein I is a collection of grain comprehensive reserve bases,
the method comprises the steps of carrying out a first treatment on the surface of the J is a set of target grain comprehensive reserve bases, < >>
The method comprises the steps of carrying out a first treatment on the surface of the K is a collection of grain comprehensive reserve base transportation routes, < > and is a collection of grain comprehensive reserve base transportation routes>
；/>
Selecting transport for grain deliveryRoute k is transported from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
Selecting a transport route k for grain feeding from a grain feeding site j to a certain grain comprehensive storage base i; />
Selecting a transportation route k for grain delivery, and transporting a transportation distance from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
A transport distance from a grain feeding site j to a certain grain comprehensive storage site i is selected for the transport route k; />
Selecting a transportation route k for grain delivery, and transporting the transportation route k from a certain grain comprehensive storage base i to a target grain comprehensive storage base j; />
The transportation time for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery, and transporting the grain from a certain grain comprehensive storage base i to a single transportation cost of a target grain comprehensive storage base j; />
The single transportation cost for selecting a transportation route k to be transported to a certain grain comprehensive storage base i by a grain feeding site j; />
Selecting a transportation route k for grain delivery from a grain comprehensive storage base i to a target grain comprehensive storage base jSecondary traffic volume; />
Single-time traffic from a grain feeding place j to a certain grain comprehensive storage base i for selecting a transport route k; />
The maximum food consumption which can be contained in the base i is comprehensively reserved for the grains; />
For transporting food, and +.>
。
9. The grain comprehensive reserve base multiple metering system of claim 8, wherein the constraints of the warehouse in and warehouse out cost control model are:
wherein, the formula (1) represents that only one transportation route can be selected when a certain grain comprehensive storage base i is transported to a target grain comprehensive storage base j; the formula (2) represents that only one transportation route can be selected when the target grain comprehensive storage base j is transported to a certain grain comprehensive storage base i; the formula (3) represents that a certain grain comprehensive storage base i can store grain food which is larger than grain food in warehouse when the target grain comprehensive storage base j is transported to the certain grain comprehensive storage base i; formula (4) represents a variable constraint; the formulas (5) to (6) represent the decision variables with a value range of not 1, namely 0.
10. The grain comprehensive reserve base multiple metering system of claim 6, further comprising:
and determining certain types of grains with highest warehousing rates of the certain grain comprehensive storage base, and increasing the storage amount of the certain types of grains adjacent to the certain grain comprehensive storage base.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310429598.5A CN116151723B (en) | 2023-04-21 | 2023-04-21 | Multiple metering method and system for comprehensive grain reserve base |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310429598.5A CN116151723B (en) | 2023-04-21 | 2023-04-21 | Multiple metering method and system for comprehensive grain reserve base |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116151723A true CN116151723A (en) | 2023-05-23 |
| CN116151723B CN116151723B (en) | 2023-06-27 |
Family
ID=86354699
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310429598.5A Active CN116151723B (en) | 2023-04-21 | 2023-04-21 | Multiple metering method and system for comprehensive grain reserve base |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116151723B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117114581A (en) * | 2023-10-16 | 2023-11-24 | 中国标准化研究院 | Grain depot storage and logistics optimization method based on artificial intelligence |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140172494A1 (en) * | 2011-08-05 | 2014-06-19 | Junko Hosoda | Multi-base inventory deployment computation device |
| CN106485413A (en) * | 2016-10-09 | 2017-03-08 | 河南工业大学 | The method and device that a kind of grain optimum storage quantity determines |
| US20200364630A1 (en) * | 2019-05-15 | 2020-11-19 | Target Brands, Inc. | System and method for managing transportation vessels |
| CN113449939A (en) * | 2020-03-24 | 2021-09-28 | 北京京东振世信息技术有限公司 | Inventory data prediction method, device, computing equipment and medium |
-
2023
- 2023-04-21 CN CN202310429598.5A patent/CN116151723B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140172494A1 (en) * | 2011-08-05 | 2014-06-19 | Junko Hosoda | Multi-base inventory deployment computation device |
| CN106485413A (en) * | 2016-10-09 | 2017-03-08 | 河南工业大学 | The method and device that a kind of grain optimum storage quantity determines |
| US20200364630A1 (en) * | 2019-05-15 | 2020-11-19 | Target Brands, Inc. | System and method for managing transportation vessels |
| CN113449939A (en) * | 2020-03-24 | 2021-09-28 | 北京京东振世信息技术有限公司 | Inventory data prediction method, device, computing equipment and medium |
Non-Patent Citations (2)
| Title |
|---|
| 于海鸿 等: "一种求解粮食调运优化问题的两阶段方法", 小型微型计算机系统, vol. 28, no. 3, pages 495 - 499 * |
| 陶学宗 等: "粮食多式联运无缝衔接方案优化模型与求解", 物流科技, pages 22 - 24 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117114581A (en) * | 2023-10-16 | 2023-11-24 | 中国标准化研究院 | Grain depot storage and logistics optimization method based on artificial intelligence |
| CN117114581B (en) * | 2023-10-16 | 2024-02-06 | 中国标准化研究院 | Grain depot storage and logistics optimization method based on artificial intelligence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116151723B (en) | 2023-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109447355B (en) | Distribution optimization method, device, medium and computing equipment for warehouse goods | |
| CN116151723B (en) | Multiple metering method and system for comprehensive grain reserve base | |
| CN113259144B (en) | Warehouse network planning method and device | |
| CN111401619A (en) | Purchase order processing method and device, electronic equipment and storage medium | |
| Ng et al. | Yard planning for vessel services with a cyclical calling pattern | |
| CN110390497A (en) | Article storage method and device | |
| CN112926808A (en) | Logistics path planning method, device, equipment and computer readable storage medium | |
| Zhang et al. | Quantified edge server placement with quantum encoding in internet of vehicles | |
| CN111461467B (en) | Material distribution method and system based on electronic order, server and medium | |
| CN117113608A (en) | Cold-chain logistics network node layout method and equipment | |
| CN218825573U (en) | Logistics management system based on cloud computing | |
| CN116167245A (en) | Multi-attribute transfer decision model-based multi-modal grain transportation method and system | |
| CN116703078A (en) | Method and related device for determining daily declaration plan of virtual power plant | |
| EP4318346A1 (en) | Warehouse order task processing method and apparatus, storage medium, and electronic device | |
| CN111489005A (en) | Inventory path optimization method and device | |
| CN113743733B (en) | Replenishment method and system | |
| CN115114769A (en) | Multi-data center microgrid management method, device, equipment and storage medium | |
| CN111582408B (en) | Data processing method, data processing device, storage medium and electronic equipment | |
| CN116415743B (en) | Fruit and vegetable distribution optimization method based on-line dispatching system | |
| Wang | Planning and layout of intelligent logistics park based on improved genetic algorithm | |
| CN113762573A (en) | Logistics network optimization method and device | |
| CN109740829A (en) | Foodstuff transportation method, equipment, storage medium and device based on ant group algorithm | |
| CN116307999B (en) | Transportation mode scheduling method and system based on water-iron public multi-mode intermodal transportation | |
| CN113762580A (en) | Method and device for determining logistics park for commercial tenant | |
| CN113256030B (en) | Storage area goods tide storage control method and device |
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 |