CN109858787A - A kind of energy scheduling management method, device, readable medium and electronic equipment - Google Patents
A kind of energy scheduling management method, device, readable medium and electronic equipment Download PDFInfo
- Publication number
- CN109858787A CN109858787A CN201910042631.2A CN201910042631A CN109858787A CN 109858787 A CN109858787 A CN 109858787A CN 201910042631 A CN201910042631 A CN 201910042631A CN 109858787 A CN109858787 A CN 109858787A
- Authority
- CN
- China
- Prior art keywords
- energy
- gas source
- gas
- gas station
- individual
- 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
Classifications
-
- 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
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
The invention discloses a kind of energy scheduling management method, device, readable medium and electronic equipment, method includes: the minimum air demand and maximum air demand, the demand tolerance at each gas station obtained in transportation network between the schedulable tolerance of each gas source, each gas source and each gas station；Obtain the vehicle scheduling data of the corresponding carrier of transportation network；According to the energy efficiency model of minimum air demand and maximum air demand, the formation of the demand tolerance at each gas station corresponding to transportation network between vehicle scheduling data, the schedulable tolerance of each gas source, each gas source and each gas station；Optimize energy efficiency model to determine the energy scheduling data of transportation network.According to the technical solution of the present invention, it can ensure that when being managed to the dispatch situation of natural gas, it accurately can meet the natural gas of user demand in time to the delivery of gas station and transport power is avoided to waste, to realize that the more reasonable dispatch situation to natural gas is managed.
Description
Technical field
The present invention relates to energy fields more particularly to a kind of energy scheduling management method, device, readable medium and electronics to set
It is standby.
Background technique
Natural gas is life and common fuel in production as a kind of clean energy resource.In Gas Industry, Yong Huxu
Liquefied natural gas is bought from gas source, and gas source is according to the purchase gas demand of user, by the vehicle of carrier by the natural gas of gas source
It is delivered to gas station corresponding to relative users, to realize the scheduling of natural gas.
It can thus be seen that being only the purchase gas demand of user to the foundation that the dispatch situation of natural gas is managed, do not have
Consider the actual operation situation in scheduling process, such as does not consider the schedulable tolerance of each gas source, the demand tolerance at gas station, expires
Minimum air demand and maximum air demand, the carrying capacity of carrier beyond its load capacity of its production of foot etc., may lead
It causes accurately to meet the natural gas of user demand in time to the delivery of gas station and transport power is caused to waste, therefore, how realize
More reasonable being managed to the dispatch situation of natural gas then becomes technical problem urgently to be resolved.
Summary of the invention
The present invention provides a kind of energy scheduling management method, device, readable medium and electronic equipment, can be timely and accurate
To gas station delivery meet user demand natural gas and avoid transport power from wasting, realize the more reasonable scheduling feelings to natural gas
Condition is managed.
In a first aspect, the present invention provides a kind of energy scheduling management methods, comprising:
It obtains in transportation network between the schedulable tolerance of each gas source, each described gas source and each gas station
Minimum air demand and maximum air demand, the demand tolerance at each gas station；
Obtain the vehicle scheduling data of the corresponding carrier of the transportation network；
According to the vehicle scheduling data, the schedulable tolerance of each gas source, each described gas source with it is each
Minimum air demand and maximum air demand, the demand tolerance at each gas station between a gas station are formed corresponding to described
The energy efficiency model of transportation network；
Optimize the energy efficiency model with the energy scheduling data of the determination transportation network.
Preferably,
The vehicle scheduling data, comprising: transport unit price, each energy transport vehicle of each energy transport vehicle
Maximum load volume, each energy transport vehicle execute the transport between each described gas station and each described gas source
The operating range of required traveling and delay time at stop when task；
Then, described to form the energy efficiency model for corresponding to the transportation network, comprising: to be formed by objective function and constraint condition
The energy efficiency model corresponding to the transportation network constituted；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, M characterizes the total amount of gas source in transportation network,
The total amount of F characterization carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th
Unit profit between gas station；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterized when being 1 the f energy transport vehicle be assigned to execute i-th gas source and
Transport task between j-th of gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to i-th of gas of execution
Transport task between source and j-th of gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The operating range of Shi Suoxu traveling；
yfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
When corresponding energy freight volume；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The delay time at stop of Shi Suoxu；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th of gas
Maximum air demand between standing；
W is preset constant；
The optimization energy efficiency model is with the energy scheduling data of the determination transportation network, comprising:
The optimal solution that the objective function is solved according to the constraint condition obtains each described gas source and each institute
State the recommendation sales volume between gas station, each institute that the transport task of each energy transport vehicle is distributed and its is assigned
State the corresponding energy freight volume of transport task.
Preferably,
The constraint condition further comprises:
Wherein, P1、P2、P3、d1、d2It is constant.
Preferably,
The optimal solution that the objective function is solved according to the constraint condition, comprising:
A1, the kind including several body is initialized according to each independent variable in the objective function and the constraint condition
Group, wherein include the first gene, the second gene and third gene in each described individual, first gene includes every
Candidate sales volume between one gas source and each described gas station, second gene include each energy fortune
The candidate tasks distribution condition of defeated vehicle, the third gene include each energy transport vehicle be assigned each described in
The corresponding energy freight volume of transport task；
A2, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
Not corresponding fitness value record global optimum individual；
A3, according to the corresponding fitness value of each individual, the population is deleted using the selection of best reservation method
In several individuals；
A4, to each individual in the population, randomly choose respectively first gene, second gene with
And the crossover location in the third gene, three crossover locations of selection are intersected two-by-two in the population
Form new individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to described
Body carries out mutation operator, and selects equally distributed random number to replace the original base of individual according to mutation operator result
Cause；
A6, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
The global optimum individual of not corresponding fitness value more new record；
A7, judge whether to reach pre-set termination condition, if so, global optimum's individual is determined as described
The optimal solution of objective function, otherwise executes A3.
Second aspect, the embodiment of the invention provides a kind of energy scheduling managing devices, comprising:
Operation data obtains module, for obtaining the schedulable tolerance of each gas source in transportation network, described in each
Minimum air demand and maximum air demand, the demand tolerance at each gas station between gas source and each gas station；
Data acquisition module is dispatched, for obtaining the vehicle scheduling data of the corresponding carrier of the transportation network；
Model construction module, for according to the schedulable tolerance of the vehicle scheduling data, each gas source, each
The demand gas of minimum air demand and maximum air demand, each gas station between a gas source and each described gas station
Amount forms the energy efficiency model for corresponding to the transportation network；
Optimization processing module, for optimizing the energy efficiency model with the energy scheduling data of the determination transportation network.
Preferably,
The vehicle scheduling data, comprising: transport unit price, each energy transport vehicle of each energy transport vehicle
Maximum load volume, each energy transport vehicle execute the transport between each described gas station and each described gas source
The operating range of required traveling and delay time at stop when task；
Then, the model construction module, be used to form be made of objective function and constraint condition correspond to the transport
The energy efficiency model of network；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, M characterizes the total amount of gas source in transportation network,
The total amount of F characterization carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th
Unit profit between gas station；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterized when being 1 the f energy transport vehicle be assigned to execute i-th gas source and
Transport task between j-th of gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to i-th of gas of execution
Transport task between source and j-th of gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The operating range of Shi Suoxu traveling；
yfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
When corresponding energy freight volume；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The delay time at stop of Shi Suoxu；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th of gas
Maximum air demand between standing；
W is preset constant；
The optimization processing module obtains every for solving the optimal solution of the objective function according to the constraint condition
The transport task of recommendation sales volume, each energy transport vehicle between one gas source and each described gas station is divided
The corresponding energy freight volume of each described transport task matched and its be assigned.
Preferably,
The constraint condition further comprises:
Wherein, P1、P2、P3、d1、d2It is constant.
Preferably,
The optimization processing module, for executing following steps A1~A7:
A1, the kind including several body is initialized according to each independent variable in the objective function and the constraint condition
Group, wherein include the first gene, the second gene and third gene in each described individual, first gene includes every
Candidate sales volume between one gas source and each described gas station, second gene include each energy fortune
The candidate tasks distribution condition of defeated vehicle, the third gene include each energy transport vehicle be assigned each described in
The corresponding energy freight volume of transport task；
A2, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
Not corresponding fitness value record global optimum individual；
A3, according to the corresponding fitness value of each individual, the population is deleted using the selection of best reservation method
In several individuals；
A4, to each individual in the population, randomly choose respectively first gene, second gene with
And the crossover location in the third gene, three crossover locations of selection are intersected two-by-two in the population
Form new individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to described
Body carries out mutation operator, and selects equally distributed random number to replace the original base of individual according to mutation operator result
Cause；
A6, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
The global optimum individual of not corresponding fitness value more new record；
A7, judge whether to reach pre-set termination condition, if being then determined as global optimum's individual described
The optimal solution of objective function, otherwise executes A3.
The third aspect, the present invention provides a kind of readable mediums, including execute instruction, when the processor of electronic equipment executes
Described when executing instruction, the electronic equipment executes the method as described in any in first aspect.
Fourth aspect, the present invention provides a kind of electronic equipment, including processor and are stored with the storage executed instruction
Device, when executing instruction described in the processor executes memory storage, the processor is executed as in first aspect
Any method.
The present invention provides a kind of energy scheduling management method, device, readable medium and electronic equipment, this method is by obtaining
Take the minimum air demand between the schedulable tolerance of each gas source in transportation network, each described gas source and each gas station
And maximum air demand, the demand tolerance at each gas station, and obtain the vehicle scheduling of the corresponding carrier of transportation network
Data, and according to the vehicle scheduling data of acquisition, the schedulable tolerance of each gas source, each gas source and each gas station it
Between minimum air demand and maximum air demand, the demand tolerance at each gas station form the energy efficiency model for corresponding to transportation network,
Then the energy scheduling data of transportation network can be then determined by optimizing to the energy efficiency model；In subsequent process, i.e.,
It can be executed between each gas source and each gas station according to the energy transport vehicle of obtained energy scheduling data rational management carrier
Energy transport task, it is ensured that accurately can meet the natural gas of user demand in time to the delivery of gas station and avoid transport power unrestrained
Take, to realize that the more reasonable dispatch situation to natural gas is managed.
Detailed description of the invention
It in order to illustrate the embodiments of the present invention more clearly or existing technical solution, below will be to embodiment or the prior art
Attached drawing needed in description is briefly described, it should be apparent that, the accompanying drawings in the following description is only in the present invention
The some embodiments recorded without any creative labor, may be used also for those of ordinary skill in the art
To obtain other drawings based on these drawings.
Fig. 1 is a kind of flow diagram for energy scheduling management method that one embodiment of the invention provides；
Fig. 2 is a kind of structural schematic diagram for energy scheduling managing device that one embodiment of the invention provides；
Fig. 3 is the structural schematic diagram for a kind of electronic equipment that one embodiment of the invention provides.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with specific embodiment and accordingly
Technical solution of the present invention is clearly and completely described in attached drawing.Obviously, described embodiment is only a part of the invention
Embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making wound
Every other embodiment obtained under the premise of the property made labour, shall fall within the protection scope of the present invention.
As shown in Figure 1, including the following steps: the embodiment of the invention provides a kind of energy scheduling management method
Step 101, schedulable tolerance, each described gas source and each gas of each gas source in transportation network are obtained
Minimum air demand and maximum air demand, the demand tolerance at each gas station between standing；
Step 102, the vehicle scheduling data of the corresponding carrier of the transportation network are obtained；
Step 103, according to the vehicle scheduling data, the schedulable tolerance of each gas source, each described gas
Minimum air demand between source and each described gas station and maximum air demand, the demand tolerance at each gas station are formed pair
The energy efficiency model of transportation network described in Ying Yu；
Step 104, optimize the energy efficiency model with the energy scheduling data of the determination transportation network.
Embodiment as shown in Figure 1, this method is by obtaining the schedulable tolerance, each of each gas source in transportation network
Minimum air demand and maximum air demand, the demand tolerance at each gas station between a gas source and each gas station,
And the vehicle scheduling data of the corresponding carrier of transportation network are obtained, and according to the vehicle scheduling data of acquisition, each gas
Minimum air demand and maximum air demand, each gas station between the schedulable tolerance in source, each gas source and each gas station
Demand tolerance formed correspond to transportation network energy efficiency model, then then can be by optimizing the energy efficiency model with determination
The energy scheduling data of transportation network out；It, can be according to obtained energy scheduling data rational management carrier in subsequent process
Energy transport vehicle execute the energy transport task between each gas source and each gas station, it is ensured that can in time and accurately to gas
Delivery of standing meets the natural gas of user demand and transport power is avoided to waste, to realize the more reasonable dispatch situation to natural gas
It is managed.
It should be understood by those skilled in the art that, a transportation network can be made of multiple gas sources and multiple gas stations,
Gas source belongs to natural gas supply quotient, and gas station belongs to natural gas motorcar side (i.e. user), and carrier passes through its energy transport vehicle for gas
The natural gas transportation that source provides is to corresponding gas station.Carrier can be natural gas supply quotient itself and/or third party's transport service
Be engaged in contractor.
It should be noted that user belonging to each gas station may include trader, industrial user, power plant and other classes
Type client, the critical property of the corresponding business of different user, natural gas demand are respectively different.Therefore, here can according to
A large number of users is divided into different classes of by the critical property of the business at family and natural gas demand, for example a large number of users is divided into guarantor
It for client, specializes in client, stablize client, multiple classifications such as Protocol Client, correspondingly, meeting each user known and respectively corresponding
Largest production demand needed in the case where demand tolerance, the classification of owning user, setting can be distinguished according to each gas station
Corresponding minimum air demand and maximum air demand between each gas source and each gas station.
In a kind of specific business scenario, the natural gas that gas source provides can fully meet the use gas demand at gas station, but
The carrying capacity of carrier is not enough to support all natural gas for meeting user demand being transported to corresponding gas station, i.e. carrier
Carrying capacity be not able to satisfy the natural gas dispatching requirement of transportation network, at this point, ensuring that transportation network is corresponding to realize
Under the premise of supplier's profit maximization, avoids causing the transport power of carrier waste, transports and be no less than respectively to each gas station
Natural gas needed for meeting its lowest manufactured demand realizes the energy transport vehicle of rational management carrier and reduces resource consumption, originally
In invention one embodiment,
The vehicle scheduling data, comprising: transport unit price, each energy transport vehicle of each energy transport vehicle
Maximum load volume, each energy transport vehicle execute the transport between each described gas station and each described gas source
The operating range of required traveling and delay time at stop when task；
Then, described to form the energy efficiency model for corresponding to the transportation network, comprising: to be formed by objective function and constraint condition
The energy efficiency model corresponding to the transportation network constituted；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, M characterizes the total amount of gas source in transportation network,
The total amount of F characterization carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th
Unit profit between gas station；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterized when being 1 the f energy transport vehicle be assigned to execute i-th gas source and
Transport task between j-th of gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to i-th of gas of execution
Transport task between source and j-th of gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The operating range of Shi Suoxu traveling；
yfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
When corresponding energy freight volume；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The delay time at stop of Shi Suoxu；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th of gas
Maximum air demand between standing；
W is preset constant；
The optimization energy efficiency model is with the energy scheduling data of the determination transportation network, comprising:
The optimal solution that the objective function is solved according to the constraint condition obtains each described gas source and each institute
State the recommendation sales volume between gas station, each institute that the transport task of each energy transport vehicle is distributed and its is assigned
State the corresponding energy freight volume of transport task.
In the embodiment, constraint condition is referred specifically to:
(1), carrier can provide one or more energy transport vehicles be performed simultaneously i-th of gas source and j-th gas station it
Between transport task, i.e. between i-th of gas source and j-th of gas station in the case where meeting other conditions, i-th of gas source and jth
Recommend freight volume between a gas station, be assigned equal to all to the transport task executed between i-th of gas source and j-th of gas station
Energy transport vehicle executes the sum of the corresponding energy freight volume when transport task between i-th of gas source and j-th of gas station respectively.
(2), the recommendation freight volume between i-th of gas source and j-th of gas station should be not less than i-th of gas source and j-th of gas
Minimum air demand between standing, it is ensured that it is subsequent when being managed according to energy scheduling data to energy scheduling situation, it is practical to each
The natural gas of gas station transport can satisfy the lowest manufactured demand of user corresponding to gas station；Meanwhile recommending it to j-th of gas station
Corresponding minimum air demand can be slightly larger than from the recommendation sales volume of i-th of gas source purchase natural gas but should not exceed i-th of gas
The schedulable tolerance in source.
(3), i-th gas source can sell natural gas to multiple gas stations, but i-th of gas source is to each gas station effective sale
The total amount of natural gas should be not more than the schedulable tolerance of i-th of gas source.
(4), multiple gas sources can provide natural gas, but the day that each gas source is provided to j-th of gas station to j-th of gas station simultaneously
The total amount of right gas should be not more than demand tolerance corresponding to j-th of gas station, which refers specifically to set period of time
The interior total amount for meeting the natural gas consumed required for highest production requirement corresponding to j-th of gas station.
(5), the f energy transport vehicle can be assigned to the transport executed between i-th of gas source and j-th of gas station and appoint
Business, but is only capable of the direct transport task being performed simultaneously between a gas source and a gas station, can not be performed simultaneously a gas source with
Multiple transport tasks between multiple gas stations or between multiple gas sources and a gas station.
(6), the f energy transport vehicle can be assigned to the transport executed between i-th of gas source and j-th of gas station and appoint
Business, but its execute the corresponding energy freight volume when transport task between i-th of gas source and j-th of gas station should be no more than it most
Big load volume.
For example, preset constant w can be as penalty coefficient according to history management and running situation, gradually adjust with
Obtained empirical value.
For example, delay time at stop KfijRefer specifically to position and jth that the f energy transport vehicle executes i-th of gas source
When transport task between a gas station, respectively at the predicted time interval that i-th of gas source and j-th of gas station early arrive or evening arrives
The sum of.In a kind of mode in the cards, operating range D can be passed throughfij, estimate the f energy transport vehicle and execute i-th
It reaches first estimated time of i-th of gas source when transport task between the position of gas source and j-th of gas station and estimates
Up to second estimated time at j-th of gas station, then by the first estimated time for reaching i-th of gas source and pre-set reach the
The limiting time of i gas source is compared to obtain the first predicted time interval, and when will reach the second of j-th of gas station and estimate
Between with the pre-set limiting time for reaching j-th of gas station be compared to obtain the second predicted time interval, when the first prediction
Between interval with the second predicted time interval and as delay time at stop Kfij；For example, the arrival time that i-th of gas source limits
For moment TiaAnd TibBetween, the arrival time that j-th of gas station limits is moment TjaAnd TjbBetween, it is assumed that the f energy transport vehicle
Earlier than moment TiaOr it is later than moment TibT altogether1A time interval reaches i-th of gas source, while earlier than moment TjaOr it is later than
Moment TjbT altogether2A time interval reaches, then Kfij=t1+t2。
It should be noted that DfijThe f energy transport vehicle is referred specifically to be assigned to i-th of gas source of execution and j-th
When transport task between gas station, from the position of the f energy transport vehicle travel to the first operating range of i-th of gas source with from
I-th of gas source travels the sum of the second operating range to j-th of gas station.
It will be apparent that in the energy efficiency model, HijWith yfijIn the presence of the relationship of direct correlation, i.e., deposited in the energy efficiency model
Variable then only include xij、TfijAnd yfij, when being optimized for the energy efficiency model, it is only necessary to obtain xij、TfijAnd yfij
Recommendation sales volume between each gas source and each gas station, each energy transport vehicle can be obtained in the optimal solution of composition
Transport task distribution and its assigned corresponding energy freight volume of each transport task.
Unit profit in objective function between i-th of gas source and j-th of gas station, can at least be realized by the following two kinds
One of mode is realized.
Implementation 1 directly acquires the purchase gas unit price and gas supply unit price of i-th of gas source, by gas supply unit price and purchase gas list
The difference of valence is as unit profit.
It is implementation 2, its recommendation freight volume between i-th of gas source and j-th of gas station is associated, it is formed with i-th
Piecewise function of the recommendation freight volume as independent variable between a gas source and j-th of gas station, and using the piecewise function as constraint
Condition.
For implementation 2, the piecewise function specifically:
Wherein, P1、P2、P3、d1、d2It is constant.
The optimal solution that the objective function is solved according to the constraint condition, can specifically include following each step A1~
A7。
A1, the kind including several body is initialized according to each independent variable in the objective function and the constraint condition
Group, wherein include the first gene, the second gene and third gene in each described individual, first gene includes every
Candidate sales volume between one gas source and each described gas station, second gene include each energy fortune
The candidate tasks distribution condition of defeated vehicle, the third gene include each energy transport vehicle be assigned each described in
The corresponding energy freight volume of transport task；
A2, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
Not corresponding fitness value record global optimum individual；
A3, according to the corresponding fitness value of each individual, the population is deleted using the selection of best reservation method
In several individuals；
A4, to each individual in the population, randomly choose respectively first gene, second gene with
And the crossover location in the third gene, three crossover locations of selection are intersected two-by-two in the population
Form new individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to described
Body carries out mutation operator, and selects equally distributed random number to replace the original base of individual according to mutation operator result
Cause；
A6, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
The global optimum individual of not corresponding fitness value more new record；
A7, judge whether to reach pre-set termination condition, if so, global optimum's individual is determined as described
The optimal solution of objective function, otherwise executes A3.
It should be understood by those skilled in the art that, termination condition can reach maximum number of iterations with the number of iterations of population,
I.e. by judging whether the number (i.e. the number of iterations) of circulation execution A3~A6 reaches maximum number of iterations, if it is, by complete
Office's optimum individual is determined as the optimal solution of objective function, otherwise executes A3.Termination condition is also possible to update twice in succession most
Variation between excellent individual meets preset condition.
It should be noted that the optimal solution for determining objective function can also be realized by other algorithms.
For example,
First gene can recorde are as follows: [x00…xij…xMN]；
Second gene can recorde are as follows: [T000…Tfij…TFMN]；
Third gene can recorde are as follows: [y000…yfij…yFMN]；
For each of population individual, it should be respectively indicated using binary-coded form and form the every of the individual
Each of one gene element.
Based on design identical with embodiment of the present invention method, referring to FIG. 2, the embodiment of the invention also provides one kind
Energy scheduling managing device, comprising:
Operation data obtains module 201, for obtaining the schedulable tolerance of each gas source in transportation network, each institute
State the minimum air demand and maximum air demand, the demand tolerance at each gas station between gas source and each gas station；
Data acquisition module 202 is dispatched, for obtaining the vehicle scheduling data of the corresponding carrier of the transportation network；
Model construction module 203, for according to the schedulable tolerance of the vehicle scheduling data, each gas source,
The need of minimum air demand and maximum air demand, each gas station between each described gas source and each described gas station
Tolerance is asked to form the energy efficiency model for corresponding to the transportation network；
Optimization processing module 204, for optimizing the energy efficiency model with the energy scheduling data of the determination transportation network.
In one embodiment of the invention, the vehicle scheduling data, comprising: the transport unit price of each energy transport vehicle,
The maximum load volume of each energy transport vehicle, each energy transport vehicle execute each described gas station with it is each
The operating range of required traveling and delay time at stop when transport task between a gas source；
Then, the model construction module 203, be used to form be made of objective function and constraint condition correspond to the fortune
The energy efficiency model of defeated network；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, M characterizes the total amount of gas source in transportation network,
The total amount of F characterization carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th
Unit profit between gas station；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterized when being 1 the f energy transport vehicle be assigned to execute i-th gas source and
Transport task between j-th of gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to i-th of gas of execution
Transport task between source and j-th of gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The operating range of Shi Suoxu traveling；
yfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
When corresponding energy freight volume；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task executed between i-th of gas source and j-th of gas station
The delay time at stop of Shi Suoxu；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th of gas
Maximum air demand between standing；
W is preset constant；
The optimization processing module 204 is obtained for solving the optimal solution of the objective function according to the constraint condition
Recommendation sales volume between each described gas source and each described gas station, the transport task of each energy transport vehicle
Distribution and its corresponding energy freight volume of each assigned transport task.
In one embodiment of the invention, the constraint condition further comprises:
Wherein, P1、P2、P3、d1、d2It is constant.
In one embodiment of the invention, the optimization processing module 204, for executing following steps A1~A7:
A1, the kind including several body is initialized according to each independent variable in the objective function and the constraint condition
Group, wherein include the first gene, the second gene and third gene in each described individual, first gene includes every
Candidate sales volume between one gas source and each described gas station, second gene include each energy fortune
The candidate tasks distribution condition of defeated vehicle, the third gene include each energy transport vehicle be assigned each described in
The corresponding energy freight volume of transport task；
A2, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
Not corresponding fitness value record global optimum individual；
A3, according to the corresponding fitness value of each individual, the population is deleted using the selection of best reservation method
In several individuals；
A4, to each individual in the population, randomly choose respectively first gene, second gene with
And the crossover location in the third gene, three crossover locations of selection are intersected two-by-two in the population
Form new individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to described
Body carries out mutation operator, and selects equally distributed random number to replace the original base of individual according to mutation operator result
Cause；
A6, the corresponding fitness value of each individual in the population is calculated, and is divided according to each individual
The global optimum individual of not corresponding fitness value more new record；
A7, judge whether to reach pre-set termination condition, if being then determined as global optimum's individual described
The optimal solution of objective function, otherwise executes A3
For convenience of description, it describes to be divided into various units when apparatus above embodiment with function or module describes respectively,
The function of each unit or module can be realized in the same or multiple software and or hardware in carrying out the present invention.
Fig. 3 is the structural schematic diagram of a kind of electronic equipment provided in an embodiment of the present invention.In hardware view, the electronic equipment
Including processor, optionally further comprising internal bus, network interface, memory.Wherein, memory may include memory, such as
High-speed random access memory (Random-Access Memory, RAM), it is also possible to further include nonvolatile memory (non-
Volatile memory), for example, at least 1 magnetic disk storage etc..Certainly, which is also possible that other business institutes
The hardware needed.
Processor, network interface and memory can be connected with each other by internal bus, which can be ISA
(Industry Standard Architecture, industry standard architecture) bus, PCI (Peripheral
Component Interconnect, Peripheral Component Interconnect standard) bus or EISA (Extended Industry Standard
Architecture, expanding the industrial standard structure) bus etc..The bus can be divided into address bus, data/address bus, control always
Line etc..Only to be indicated with a four-headed arrow in Fig. 3, it is not intended that an only bus or a type of convenient for indicating
Bus.
Memory is executed instruction for storing.Specifically, the computer program that can be performed is executed instruction.Memory
It may include memory and nonvolatile memory, and execute instruction to processor offer and data.
In a kind of mode in the cards, processor reads corresponding execute instruction to interior from nonvolatile memory
It is then run in depositing, can also obtain from other equipment and execute instruction accordingly, to form energy scheduling pipe on logic level
Manage device.What processor execution memory was stored executes instruction, to execute instruction any reality of the realization present invention by what is executed
The energy scheduling management method provided in example is provided.
The method that the above-mentioned energy scheduling managing device provided such as embodiment illustrated in fig. 2 of the present invention executes can be applied to locate
It manages in device, or realized by processor.Processor may be a kind of IC chip, the processing capacity with signal.In reality
During now, each step of the above method can pass through the integrated logic circuit of the hardware in processor or the finger of software form
It enables and completing.Above-mentioned processor can be general processor, including central processing unit (Central Processing Unit,
CPU), network processing unit (Network Processor, NP) etc.；It can also be digital signal processor (Digital Signal
Processor, DSP), it is specific integrated circuit (Application Specific Integrated Circuit, ASIC), existing
It is field programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, discrete
Door or transistor logic, discrete hardware components.It may be implemented or execute the disclosed each side in the embodiment of the present invention
Method, step and logic diagram.General processor can be microprocessor or the processor is also possible to any conventional processing
Device etc..
The step of method in conjunction with disclosed in the embodiment of the present invention, can be embodied directly in hardware decoding processor and execute
At, or in decoding processor hardware and software module combination execute completion.Software module can be located at random access memory,
This fields such as flash memory, read-only memory, programmable read only memory or electrically erasable programmable memory, register maturation
In storage medium.The storage medium is located at memory, and processor reads the information in memory, completes above-mentioned side in conjunction with its hardware
The step of method.
The embodiment of the present invention also proposed a kind of readable medium, which, which is stored with, executes instruction, storage
It executes instruction when being executed by the processor of electronic equipment, the electronic equipment can be made to execute and provided in any embodiment of the present invention
Energy scheduling management method, and be specifically used for executing method as shown in Figure 1.
Electronic equipment described in foregoing individual embodiments can be computer.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method or computer program product.
Therefore, the form that complete hardware embodiment, complete software embodiment or software and hardware combine can be used in the present invention.
Various embodiments are described in a progressive manner in the present invention, same and similar part between each embodiment
It may refer to each other, each embodiment focuses on the differences from other embodiments.Implement especially for device
For example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method
Part illustrates.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described want
There is also other identical elements in the process, method of element, commodity or equipment.
The above description is only an embodiment of the present invention, is not intended to restrict the invention.For those skilled in the art
For, the invention may be variously modified and varied.All any modifications made within the spirit and principles of the present invention are equal
Replacement, improvement etc., should be included within scope of the presently claimed invention.
Claims (10)
1. a kind of energy scheduling management method characterized by comprising
Obtain the minimum in transportation network between the schedulable tolerance of each gas source, each described gas source and each gas station
Air demand and maximum air demand, the demand tolerance at each gas station；
Obtain the vehicle scheduling data of the corresponding carrier of the transportation network；
According to the vehicle scheduling data, the schedulable tolerance of each gas source, each described gas source and each institute
It states the minimum air demand between gas station and maximum air demand, the demand tolerance at each gas station forms and corresponds to the transport
The energy efficiency model of network；
Optimize the energy efficiency model with the energy scheduling data of the determination transportation network.
2. the method according to claim 1, wherein
The vehicle scheduling data, comprising: the transport unit price of each energy transport vehicle, each energy transport vehicle are most
Big load volume, each energy transport vehicle execute the transport task between each described gas station and each described gas source
The operating range of Shi Suoxu traveling and delay time at stop；
Then, described to form the energy efficiency model for corresponding to the transportation network, comprising: formation is made of objective function and constraint condition
The energy efficiency model corresponding to the transportation network；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, the total amount of gas source, F table in M characterization transportation network
Levy the total amount of carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th of gas station
Between unit profit；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterizes the f energy transport vehicle and is assigned to i-th of gas source of execution and j-th when being 1
Transport task between gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to executing i-th of gas source and the
Transport task between j gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task when institute executed between i-th of gas source and j-th of gas station
The operating range that need to be travelled；
yfijThe f energy transport vehicle is characterized to be assigned to when executing the transport task between i-th of gas source and j-th of gas station pairs
The energy freight volume answered；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task when institute executed between i-th of gas source and j-th of gas station
The delay time at stop needed；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th gas station it
Between maximum air demand；
W is preset constant；
The optimization energy efficiency model is with the energy scheduling data of the determination transportation network, comprising:
The optimal solution that the objective function is solved according to the constraint condition obtains each described gas source and each described gas
The transport task of recommendation sales volume, each energy transport vehicle between standing is distributed and its each assigned described fortune
The corresponding energy freight volume of defeated task.
3. according to the method described in claim 2, it is characterized in that,
The constraint condition further comprises:
Wherein, P1、P2、P3、d1、d2It is constant.
4. according to the method in claim 2 or 3, which is characterized in that
The optimal solution that the objective function is solved according to the constraint condition, comprising:
A1, the population including several body is initialized according to each independent variable in the objective function and the constraint condition,
It wherein, include the first gene, the second gene and third gene in each described individual, first gene includes each
Candidate sales volume between the gas source and each described gas station, second gene include each energy transport vehicle
Candidate tasks distribution condition, the third gene includes each assigned described transport of each energy transport vehicle
The corresponding energy freight volume of task；
A2, the corresponding fitness value of each individual in the population is calculated, and right respectively according to each individual
The fitness value record global optimum individual answered；
A3, according to the corresponding fitness value of each individual, deleted in the population using the selection of best reservation method
Several individuals；
A4, to each individual in the population, randomly choose first gene, second gene and institute respectively
The crossover location in third gene is stated, three crossover locations of selection are intersected two-by-two to be formed in the population
New individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to it is described individual into
Row variation operation, and select equally distributed random number to replace the original gene of individual according to mutation operator result；
A6, the corresponding fitness value of each individual in the population is calculated, and right respectively according to each individual
The global optimum individual of the fitness value answered more new record；
A7, judge whether to reach pre-set termination condition, if so, global optimum's individual is determined as the target
The optimal solution of function, otherwise executes A3.
5. a kind of energy scheduling managing device characterized by comprising
Operation data obtains module, for obtaining the schedulable tolerance of each gas source in transportation network, each described gas source
Minimum air demand and maximum air demand, the demand tolerance at each gas station between each gas station；
Data acquisition module is dispatched, for obtaining the vehicle scheduling data of the corresponding carrier of the transportation network；
Model construction module, for the schedulable tolerance according to the vehicle scheduling data, each gas source, each institute
State the minimum air demand and maximum air demand, the demand tolerance shape at each gas station between gas source and each described gas station
At the energy efficiency model for corresponding to the transportation network；
Optimization processing module, for optimizing the energy efficiency model with the energy scheduling data of the determination transportation network.
6. device according to claim 5, which is characterized in that
The vehicle scheduling data, comprising: the transport unit price of each energy transport vehicle, each energy transport vehicle are most
Big load volume, each energy transport vehicle execute the transport task between each described gas station and each described gas source
The operating range of Shi Suoxu traveling and delay time at stop；
Then, the model construction module, be used to form be made of objective function and constraint condition correspond to the transportation network
Energy efficiency model；Wherein,
The objective function includes:
The constraint condition includes:
Wherein, Z characterization energy valid value, N characterize the total amount at gas station in transportation network, the total amount of gas source, F table in M characterization transportation network
Levy the total amount of carrier's energy transport vehicle；
cij(Hij) recommend freight volume for H between i-th of gas source of characterization and j-th of gas stationijWhen, i-th of gas source and j-th of gas station
Between unit profit；
HijCharacterize the recommendation freight volume between i-th of gas source and j-th of gas station；
xijCharacterize the recommendation sales volume between i-th of gas source and j-th of gas station；
TfijValue is 0 or 1, TfijValue characterizes the f energy transport vehicle and is assigned to i-th of gas source of execution and j-th when being 1
Transport task between gas station, TfijValue characterizes the f energy transport vehicle when being 0 unassigned to executing i-th of gas source and the
Transport task between i gas station；
PfCharacterize the transport unit price of the f energy transport vehicle；
DfijThe f energy transport vehicle is characterized to be assigned to the transport task when institute executed between i-th of gas source and j-th of gas station
The operating range that need to be travelled；
yfijThe f energy transport vehicle is characterized to be assigned to when executing the transport task between i-th of gas source and j-th of gas station pairs
The energy freight volume answered；
CfCharacterize the maximum load volume of the f energy transport vehicle；
KfijThe f energy transport vehicle is characterized to be assigned to the transport task when institute executed between i-th of gas source and j-th of gas station
The delay time at stop needed；
aiCharacterize the schedulable tolerance of i-th of gas source, bjCharacterize the demand tolerance at j-th of gas station；
VaijCharacterize minimum air demand between i-th of gas source and j-th of gas station, VbijCharacterize i-th of gas source and j-th gas station it
Between maximum air demand；
W is preset constant；
The optimization processing module obtains each for solving the optimal solution of the objective function according to the constraint condition
Recommendation sales volume between the gas source and each described gas station, each energy transport vehicle transport task distribution and
The corresponding energy freight volume of its each assigned transport task.
7. device according to claim 6, which is characterized in that
The constraint condition further comprises:
Wherein, P1、P2、P3、d1、d2It is constant.
8. device according to claim 6 or 7, which is characterized in that
The optimization processing module, for executing following steps A1~A7:
A1, the population including several body is initialized according to each independent variable in the objective function and the constraint condition,
It wherein, include the first gene, the second gene and third gene in each described individual, first gene includes each
Candidate sales volume between the gas source and each described gas station, second gene include each energy transport vehicle
Candidate tasks distribution condition, the third gene includes each assigned described transport of each energy transport vehicle
The corresponding energy freight volume of task；
A2, the corresponding fitness value of each individual in the population is calculated, and right respectively according to each individual
The fitness value record global optimum individual answered；
A3, according to the corresponding fitness value of each individual, deleted in the population using the selection of best reservation method
Several individuals；
A4, to each individual in the population, randomly choose first gene, second gene and institute respectively
The crossover location in third gene is stated, three crossover locations of selection are intersected two-by-two to be formed in the population
New individual；
A5, each individual to the population, by non-uniform probability, be randomly assigned variable position in a manner of to it is described individual into
Row variation operation, and select equally distributed random number to replace the original gene of individual according to mutation operator result；
A6, the corresponding fitness value of each individual in the population is calculated, and right respectively according to each individual
The global optimum individual of the fitness value answered more new record；
A7, judge whether to reach pre-set termination condition, if global optimum's individual is then determined as the target
The optimal solution of function, otherwise executes A3.
9. a kind of readable medium, including execute instruction, when executing instruction described in the processor of electronic equipment executes, the electronics
Equipment executes the method as described in any in Claims 1-4.
10. a kind of electronic equipment including processor and is stored with the memory executed instruction, described in processor execution
When executing instruction described in memory storage, the processor executes the method as described in any in Claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910042631.2A CN109858787B (en) | 2019-01-17 | 2019-01-17 | Energy scheduling management method and device, readable medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910042631.2A CN109858787B (en) | 2019-01-17 | 2019-01-17 | Energy scheduling management method and device, readable medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109858787A true CN109858787A (en) | 2019-06-07 |
| CN109858787B CN109858787B (en) | 2021-08-27 |
Family
ID=66894973
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910042631.2A Active CN109858787B (en) | 2019-01-17 | 2019-01-17 | Energy scheduling management method and device, readable medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109858787B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117114329A (en) * | 2023-09-01 | 2023-11-24 | 中科盖思数字科技有限公司 | Air supply scheduling method, device, computer equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971174A (en) * | 2014-05-06 | 2014-08-06 | 大连理工大学 | Hydropower station group optimized dispatching method based on improved quantum-behaved particle swarm algorithm |
| CN104408589A (en) * | 2014-10-24 | 2015-03-11 | 陕西科技大学 | AGV optimization scheduling method based on mixed particle swarm optimization |
| CN106447524A (en) * | 2016-07-12 | 2017-02-22 | 广东电网有限责任公司电力科学研究院 | User energy center operation energy consumption cost control method and system |
| CN106707778A (en) * | 2016-12-06 | 2017-05-24 | 长沙理工大学 | Model predictive control-based home integrated energy intelligent optimization and management system |
| CN107578119A (en) * | 2017-08-09 | 2018-01-12 | 泉州装备制造研究所 | A kind of resource allocation global optimization method of intelligent dispatching system |
| CN107609681A (en) * | 2017-08-22 | 2018-01-19 | 西安建筑科技大学 | A kind of more metal multiple target ore-proportioning methods based on APSO algorithm |
-
2019
- 2019-01-17 CN CN201910042631.2A patent/CN109858787B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971174A (en) * | 2014-05-06 | 2014-08-06 | 大连理工大学 | Hydropower station group optimized dispatching method based on improved quantum-behaved particle swarm algorithm |
| CN104408589A (en) * | 2014-10-24 | 2015-03-11 | 陕西科技大学 | AGV optimization scheduling method based on mixed particle swarm optimization |
| CN106447524A (en) * | 2016-07-12 | 2017-02-22 | 广东电网有限责任公司电力科学研究院 | User energy center operation energy consumption cost control method and system |
| CN106707778A (en) * | 2016-12-06 | 2017-05-24 | 长沙理工大学 | Model predictive control-based home integrated energy intelligent optimization and management system |
| CN107578119A (en) * | 2017-08-09 | 2018-01-12 | 泉州装备制造研究所 | A kind of resource allocation global optimization method of intelligent dispatching system |
| CN107609681A (en) * | 2017-08-22 | 2018-01-19 | 西安建筑科技大学 | A kind of more metal multiple target ore-proportioning methods based on APSO algorithm |
Non-Patent Citations (2)
| Title |
|---|
| 刘振玮: "LNG车辆运输调度优化模型研究", 《中国优秀硕士学位论文全文数据库》 * |
| 李波: "天然气管网系统输配气运行方案优化", 《石油规划设计》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117114329A (en) * | 2023-09-01 | 2023-11-24 | 中科盖思数字科技有限公司 | Air supply scheduling method, device, computer equipment and storage medium |
| CN117114329B (en) * | 2023-09-01 | 2024-04-12 | 中科盖思数字科技有限公司 | Multi-air-source intelligent scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109858787B (en) | 2021-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Peeters et al. | Hybrid make-to-stock and make-to-order systems: a taxonomic review | |
| Uzsoy et al. | A survey of semiconductor supply chain models Part II: demand planning, inventory management, and capacity planning | |
| Abdelmaguid et al. | A genetic algorithm approach to the integrated inventory-distribution problem | |
| Wangphanich et al. | Analysis of the bullwhip effect in multi-product, multi-stage supply chain systems–a simulation approach | |
| Jerath et al. | Revenue management with strategic customers: Last-minute selling and opaque selling | |
| Lieckens et al. | Multi-level reverse logistics network design under uncertainty | |
| Framinan et al. | Available-to-promise (ATP) systems: a classification and framework for analysis | |
| Cakici et al. | Multi-objective analysis of an integrated supply chain scheduling problem | |
| Low et al. | Integrated scheduling of production and delivery with time windows | |
| Rafiei et al. | Capacity coordination in hybrid make-to-stock/make-to-order production environments | |
| Kanet et al. | Dynamic planned safety stocks in supply networks | |
| Ye et al. | Cross-docking truck scheduling with product unloading/loading constraints based on an improved particle swarm optimisation algorithm | |
| CN109829633B (en) | Energy scheduling management method and device, readable medium and electronic equipment | |
| Chen et al. | Courier dispatch in on-demand delivery | |
| Chen et al. | Available-to-promise-based flexible order allocation in ATO supply chains | |
| Zhou et al. | A supplier selection and order allocation problem with stochastic demands | |
| Teimoury et al. | An integrated operations-marketing perspective for making decisions about order penetration point in multi-product supply chain: a queuing approach | |
| Dai et al. | O2O on-demand delivery optimization with mixed driver forces | |
| Shao et al. | Comparison of order-fulfilment performance in MTO and MTS systems with an inventory cost budget constraint | |
| Jha et al. | A coordinated two-phase approach for operational decisions with vehicle routing in a single-vendor multi-buyer system | |
| Xu et al. | Real-time order allocation model by considering available-to-promise reserving, occupying and releasing mechanisms | |
| Jha et al. | A single-vendor single-buyer production-inventory model with controllable lead time and service level constraint for decaying items | |
| CN109858787A (en) | A kind of energy scheduling management method, device, readable medium and electronic equipment | |
| Rabbani et al. | A new AATP model with considering supply chain lead-times and resources and scheduling of the orders in flowshop production systems: A graph-theoretic view | |
| Alemany et al. | Order promising process for extended collaborative selling chain |
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 |