CN113011797B - Canned finished oil scheduling method and equipment based on niche train competition algorithm - Google Patents
Canned finished oil scheduling method and equipment based on niche train competition algorithm Download PDFInfo
- Publication number
- CN113011797B CN113011797B CN202110563948.8A CN202110563948A CN113011797B CN 113011797 B CN113011797 B CN 113011797B CN 202110563948 A CN202110563948 A CN 202110563948A CN 113011797 B CN113011797 B CN 113011797B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- scheduling scheme
- population
- individuals
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 49
- 238000012163 sequencing technique Methods 0.000 claims abstract description 12
- 230000006870 function Effects 0.000 claims description 54
- 238000003860 storage Methods 0.000 claims description 11
- 238000004891 communication Methods 0.000 claims description 7
- 230000001174 ascending effect Effects 0.000 claims description 5
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000004083 survival effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000029602 competition with other organism Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000011664 nicotinic acid Substances 0.000 description 1
- 239000003208 petroleum Substances 0.000 description 1
- 239000003209 petroleum derivative Substances 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a canned finished oil scheduling method and equipment based on a niche queue competition algorithm, which comprises the following steps: acquiring a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; sequencing the individuals in each scheduling scheme population according to the population fitness value of each scheduling scheme population, and determining a search space for each individual; all individuals serve as parent individuals to generate a plurality of child individuals in the search space, the objective function value of each child individual and each parent individual is obtained, the individual with the objective function value meeting a preset threshold value is selected as a representative individual of the scheduling scheme population, the representative individual participates in competition among all the scheduling scheme populations, and the scheduling scheme populations are sequenced; and if the end condition is reached, selecting individuals in the scheduling scheme population with the top sequence as the canned finished oil scheduling scheme. The invention can quickly obtain the canned finished oil scheduling scheme.
Description
Technical Field
The embodiment of the invention relates to the technical field of canned product oil storage and transportation, in particular to a canned product oil scheduling method and equipment based on a niche queue competition algorithm.
Background
The storage and transportation scheduling of the finished oil is an important content in the production activities of oil refineries. The production of the finished oil is stored in a finished oil storage tank area, the production and the reasonable scheduling of the storage and the sale of the petroleum products need to be arranged, and the situations of tank overflow, tank stringing, insufficient tank quantity and the like are avoided. The storage and transportation scheduling of the finished oil need to fully consider various transportation modes in the petroleum transportation, loading and unloading wharfs, vehicle loading and unloading and railway loading and unloading. The loading, unloading and transporting terminal of the railway can be regarded as a batch behavior, and a good and effective management environment is necessary for the operation of the industrial system, and whether the scheduling operation planning of the oil tank field is reasonable or not is a key point. Therefore, developing a canned finished oil scheduling method and equipment based on niche queuing competition algorithm can effectively fill the technical blank, and becomes a technical problem to be solved in the industry.
Disclosure of Invention
Aiming at the problems in the prior art, the embodiment of the invention provides a canned finished oil scheduling method and equipment based on a niche queue competition algorithm.
In a first aspect, an embodiment of the present invention provides a canned finished oil scheduling method based on a niche train competition algorithm, including: acquiring a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; all individuals serve as parent individuals to generate a plurality of child individuals in the search space, the objective function value of each child individual and each parent individual is obtained, the individuals with the objective function values meeting a preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations, and all the scheduling scheme populations are reordered according to competition results; and if the end condition is reached, selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes.
On the basis of the content of the embodiment of the method, the method for scheduling the canned finished oil based on the niche train competition algorithm provided by the embodiment of the invention comprises the following steps of performing niche population division on a plurality of initial canned finished oil scheduling schemes to obtain a plurality of scheduling scheme populations:
wherein k =1,2, …, N; i =1,2, …, N; n is the number of a plurality of canned product oil scheduling schemes;
the number is the ith habitat population norm;
is the ith population;
is the kth population;
is the nth individual in the ith population.
On the basis of the content of the above method embodiment, the method for scheduling the canned finished oil based on the niche train competition algorithm provided in the embodiment of the present invention obtains the fitness value of each scheduling scheme population according to the sharing function of the individual in each scheduling scheme population, and includes:
wherein,
sharing functions of individuals in the ith scheduling scheme population;
historical fitness value of the ith scheduling scheme population;
the current fitness value of the ith scheduling scheme population is obtained;
is a niche population radius threshold;
to control the parameters of the shared function shape.
On the basis of the content of the above method embodiment, the method for scheduling canned finished oil based on niche train competition algorithm provided in the embodiment of the present invention ranks the individuals in each scheduling scheme population according to the population fitness value of each scheduling scheme, and includes: and according to the size of the fitness value of each scheduling scheme population, sequencing the individuals in each scheduling scheme population in an ascending order.
On the basis of the content of the above method embodiment, the method for scheduling the canned finished oil based on the niche train competition algorithm provided in the embodiment of the present invention determines a search space for each individual according to the position of each individual in the corresponding scheduling scheme population, including: the individual search space at the head is smallest and the individual search space at the tail is largest.
On the basis of the content of the above method embodiment, the method for scheduling the canned finished oil based on the niche train competition algorithm provided in the embodiment of the present invention includes the steps of obtaining the objective function value of each child individual and each parent individual, including:
wherein G is an objective function; j is the jth time period; t is the number of time segments;
is a weight coefficient;
scheduling an expected value for the product oil;
and scheduling the actual value for the product oil.
On the basis of the content of the above method embodiment, the method for scheduling canned finished oil based on a niche train competition algorithm provided in the embodiment of the present invention further includes, after selecting a plurality of individuals in a plurality of scheduling scheme populations ranked at the top as canned finished oil scheduling schemes: if the terminal condition is not met, the search space of each individual in each scheduling scheme population is reduced, all individuals are used as parent individuals to generate a plurality of child individuals in the reduced search space, new objective function values of each child individual and each parent individual are obtained, the individuals with the new objective function values meeting the preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations again, and all the scheduling scheme populations are reordered again according to competition results until the terminal condition is met.
In a second aspect, an embodiment of the present invention provides a canned finished oil scheduling device based on a niche train competition algorithm, including: the first main module is used for obtaining a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; the second main module is used for obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; the third main module is used for generating a plurality of descendant individuals in the search space by taking all the individuals as parent individuals, acquiring an objective function value of each descendant individual and each parent individual, selecting the individual with the objective function value conforming to a preset threshold value as a representative individual of the scheduling scheme population, participating in competition among all the scheduling scheme populations, and reordering all the scheduling scheme populations according to competition results; and the fourth main module is used for selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes if the termination condition is reached.
In a third aspect, an embodiment of the present invention provides an electronic device, including:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, and the processor calls the program instructions to execute the canned product oil scheduling method based on the niche queuing competition algorithm provided by any one of the various implementation manners of the first aspect.
In a fourth aspect, embodiments of the present invention provide a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method for scheduling a canned product oil based on a niche fleet competition algorithm as provided in any one of the various implementations of the first aspect.
According to the canned product oil scheduling method and equipment based on the niche train competition algorithm, the niche population division is carried out on the initial canned product oil scheduling schemes to obtain the scheduling scheme populations, intraspecific competition and interspecific competition are carried out on the scheduling scheme populations, the canned product oil scheduling schemes can be quickly obtained, the planning efficiency of the canned product oil scheduling schemes is improved, the obtained canned product oil scheduling schemes are globally optimal, and local optimal traps planned by the canned product oil scheduling schemes are avoided.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below to the drawings required for the description of the embodiments or the prior art, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of a method for scheduling canned finished oil based on a niche queuing competition algorithm according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a canned finished oil scheduling device based on a niche queuing competition algorithm according to an embodiment of the present invention;
fig. 3 is a schematic physical structure diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. In addition, technical features of various embodiments or individual embodiments provided by the present invention may be arbitrarily combined with each other to form a feasible technical solution, and such combination is not limited by the sequence of steps and/or the structural composition mode, but must be realized by a person skilled in the art, and when the technical solution combination is contradictory or cannot be realized, such a technical solution combination should not be considered to exist and is not within the protection scope of the present invention.
And coding the tank field scheduling operation, and performing optimization solution by adopting a niche-based multi-target queue competition mode to obtain an optimal scheduling scheme. Compared with the defects that the general bionic algorithm has poor flexibility and local convergence and the traditional niche technology cannot effectively utilize good factors in the population, and the population evolution theory in biology is combined, the provided niche-based multi-target queue competition mode is an improved niche algorithm based on inter-population sharing, the mutual influence and mutual restriction relation among the populations are fully considered in the evolution process, and the characteristics of the good populations are effectively utilized. And other population fitness is adjusted according to the fitness of the shared population, so that the quality of the population is improved, the evolution process is developed along a better direction, the premature phenomenon is effectively avoided, and the convergence performance of the algorithm is improved. Based on the consideration, the embodiment of the invention provides a canned finished oil scheduling method based on a niche train competition algorithm, and referring to fig. 1, the method comprises the following steps: acquiring a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; all individuals serve as parent individuals to generate a plurality of child individuals in the search space, the objective function value of each child individual and each parent individual is obtained, the individuals with the objective function values meeting a preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations, and all the scheduling scheme populations are reordered according to competition results; and if the end condition is reached, selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes. Wherein the predetermined threshold may be 50 tons, 100 tons, 150 tons or 200 tons. In particular, the queue competition mode is a global optimization search mode based on parallel search and two-layer competition. In the process of evolution of the queue competition mode, various groups are always kept independently and parallelly evolved; the population generates filial generations through asexual propagation; individuals compete with each other in the population, one layer is longitudinal competition, in the same population, the parent and all the children compete for survival, and only the best one is reserved; and the other layer is horizontal competition, different populations compete for positions, the population is arranged into a queue according to the size of the fitness value of each population, the top population is arranged at the first position, and the worst population is arranged at the last position. The queuing order embodies the competitive driving force of the algorithm: the group with the front rank is given a smaller search space, the local search capability is improved, and the convergence speed can be accelerated; and a larger search space is given to the population behind the ranking, the global search capability of the algorithm is increased, and the algorithm is prevented from converging on a local optimal solution. The embodiment of the invention provides a canned finished oil scheduling method based on a niche queue competition algorithm, which mainly comprises two stages, wherein the niche population of each scheduling scheme population is found in the first stage through niche technology according to the distance between the scheduling scheme populations, then a queue competition mode is utilized to evolve in each niche population, the fitness of the scheduling scheme population is improved by utilizing a sharing mechanism according to the distance between the scheduling scheme populations for the updated scheduling scheme population, and the corresponding scheduling scheme population is penalized by utilizing a penalty function for the individual with the lowest fitness. And finally, keeping the optimal individuals of each population until a termination condition is met.
Based on the content of the above method embodiment, as an optional embodiment, the method for scheduling canned finished oil based on a niche train competition algorithm provided in the embodiment of the present invention performs niche population division on a plurality of initial canned finished oil scheduling schemes to obtain a plurality of scheduling scheme populations, including:
wherein k =1,2, …, N; i =1,2, …, N; n is initialThe number of the canned product oil scheduling schemes;
the number is the ith habitat population norm;
is the ith population;
is the kth population;
is the nth individual in the ith population.
In particular, the concept of niche in the evolutionary theory refers to the living environment of organisms in a specific environment. The main idea of this concept is "people group by group, things group by group", which reflects that in the evolution process of nature, various organisms live in specific environments, there are excellent organisms among the same species, there are competition among the organisms, and there is information exchange among different species. The resource sharing embodies that the same living creatures in a specific environment share limited resources, the creatures realize the co-evolution through mutual coordination, and the creatures with weak environmental adaptation capability are gradually eliminated on the premise of insufficient resources.
Based on the content of the foregoing method embodiment, as an optional embodiment, the canned finished oil scheduling method based on niche queuing competition algorithm provided in the embodiment of the present invention obtains the fitness value of each scheduling scheme population according to the sharing function of the individual in each scheduling scheme population, and includes:
wherein,
sharing functions of individuals in the ith scheduling scheme population;
historical fitness value of the ith scheduling scheme population;
the current fitness value of the ith scheduling scheme population is obtained;
is a niche population radius threshold;
to control the parameters of the shared function shape.
Based on the content of the foregoing method embodiment, as an optional embodiment, the method for scheduling canned finished oil based on a niche queuing competition algorithm provided in the embodiment of the present invention ranks, according to each scheduling scheme population fitness value, individuals in each scheduling scheme population, including: and according to the size of the fitness value of each scheduling scheme population, sequencing the individuals in each scheduling scheme population in an ascending order.
Based on the content of the foregoing method embodiment, as an optional embodiment, the method for scheduling canned finished oil based on a niche queuing competition algorithm provided in the embodiment of the present invention, where the search space is determined for each individual according to the position of each individual in the corresponding scheduling scheme population, includes: the individual search space at the head is smallest and the individual search space at the tail is largest.
Based on the content of the above method embodiment, as an optional embodiment, the method for scheduling canned finished oil based on niche queuing competition algorithm provided in the embodiment of the present invention includes that the obtaining of the objective function value of each child individual and each parent individual includes:
wherein G is an objective function; j is the jth time period; t is the number of time segments;
is a weight coefficient;
scheduling an expected value for the product oil;
and scheduling the actual value for the product oil.
Based on the content of the foregoing method embodiment, as an optional embodiment, the method for scheduling canned finished oil based on a niche queuing competition algorithm provided in the embodiment of the present invention further includes, after selecting a plurality of individuals in a plurality of scheduling scheme populations ranked at the top as canned finished oil scheduling schemes: if the terminal condition is not met, the search space of each individual in each scheduling scheme population is reduced, all individuals are used as parent individuals to generate a plurality of child individuals in the reduced search space, new objective function values of each child individual and each parent individual are obtained, the individuals with the new objective function values meeting the preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations again, and all the scheduling scheme populations are reordered again according to competition results until the terminal condition is met.
Specifically, if the termination condition is not reached (the termination condition is that the specified iteration number is less than a certain number, and in another embodiment, the iteration number may be 100, 200, or 300), the fitness value of the scheduling scheme population is calculated by using the formulas (1) to (6); according to the size of the fitness value, sequencing all individuals in an ascending order (solving the problem of minimum value, and taking the negative value of the target function when solving the maximum value); determining the corresponding search spaces according to the position sequence of the individuals in the queue in a certain proportion, wherein the search space of the first individual is the smallest, and the largest search space is allocated to the last individual; all individuals are bred in respective search spaces to generate n sub-generation individuals uniformly or randomly, in the same population, the n sub-generation individuals and the parent generation individuals are merged and participate in survival competition (shown as a formula (7)), and only the most excellent individuals are reserved as representatives of the population and participate in competition of queue positions; and outputting a calculation result (namely the canned finished oil scheduling scheme) when the termination condition is reached.
According to the canned finished oil scheduling method based on the niche train competition algorithm, the niche groups are divided into a plurality of initial canned finished oil scheduling schemes to obtain a plurality of scheduling scheme groups, and the plurality of scheduling scheme groups are subjected to intraspecies competition and interspecies competition, so that the plurality of canned finished oil scheduling schemes can be quickly obtained, the planning efficiency of the canned finished oil scheduling schemes is improved, the obtained canned finished oil scheduling schemes are globally optimal, and the local optimal trap planned by the canned finished oil scheduling schemes is avoided.
The implementation basis of the various embodiments of the present invention is realized by programmed processing performed by a device having a processor function. Therefore, in engineering practice, the technical solutions and functions thereof of the embodiments of the present invention can be packaged into various modules. Based on the above practical situation, on the basis of the above embodiments, embodiments of the present invention provide a packaged product oil scheduling device based on niche queuing competition algorithm, which is used for executing the packaged product oil scheduling method based on niche queuing competition algorithm in the above method embodiments. Referring to fig. 2, the apparatus includes: the first main module is used for obtaining a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; the second main module is used for obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; the third main module is used for generating a plurality of descendant individuals in the search space by taking all the individuals as parent individuals, acquiring an objective function value of each descendant individual and each parent individual, selecting the individual with the objective function value conforming to a preset threshold value as a representative individual of the scheduling scheme population, participating in competition among all the scheduling scheme populations, and reordering all the scheduling scheme populations according to competition results; and the fourth main module is used for selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes if the termination condition is reached.
According to the canned finished oil scheduling device based on the niche queuing competition algorithm, provided by the embodiment of the invention, the modules in the figure 2 are adopted, niche population division is carried out on a plurality of initial canned finished oil scheduling schemes to obtain a plurality of scheduling scheme populations, and intraspecific competition and interspecific competition are carried out on the plurality of scheduling scheme populations, so that a plurality of canned finished oil scheduling schemes can be quickly obtained, the planning efficiency of the canned finished oil scheduling schemes is improved, the obtained canned finished oil scheduling scheme is a global optimal scheme, and the local optimal trap planned by the canned finished oil scheduling scheme is avoided.
It should be noted that, the apparatus in the apparatus embodiment provided by the present invention may be used for implementing methods in other method embodiments provided by the present invention, except that corresponding function modules are provided, and the principle of the apparatus embodiment provided by the present invention is basically the same as that of the apparatus embodiment provided by the present invention, so long as a person skilled in the art obtains corresponding technical means by combining technical features on the basis of the apparatus embodiment described above, and obtains a technical solution formed by these technical means, on the premise of ensuring that the technical solution has practicability, the apparatus in the apparatus embodiment described above may be modified, so as to obtain a corresponding apparatus class embodiment, which is used for implementing methods in other method class embodiments. For example:
based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: the first submodule is used for realizing the niche population division of a plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations, and comprises:
wherein k =1,2, …, N; i =1,2, …, N; n is the number of a plurality of canned product oil scheduling schemes;
the number is the ith habitat population norm;
is the ith population;
is the kth population;
is the nth individual in the ith population.
Based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: the second sub-module is configured to obtain the fitness value of each scheduling scheme population according to the sharing function of the individual in each scheduling scheme population, and includes:
wherein,
sharing functions of individuals in the ith scheduling scheme population;
historical fitness value of the ith scheduling scheme population;
the current fitness value of the ith scheduling scheme population is obtained;
is a niche population radius threshold;
to control the parameters of the shared function shape.
Based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: a third sub-module, configured to implement the sorting of the individuals in each scheduling scheme population according to each scheduling scheme population fitness value, where the sorting includes: and according to the size of the fitness value of each scheduling scheme population, sequencing the individuals in each scheduling scheme population in an ascending order.
Based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: a fourth sub-module, configured to determine a search space for each individual according to a position of each individual in a corresponding scheduling scheme population, where the determination includes: the individual search space at the head is smallest and the individual search space at the tail is largest.
Based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: a fifth sub-module, configured to implement the obtaining of the objective function value of each child individual and each parent individual, including:
wherein G is an objective function; j is the jth time period; t is the number of time segments;
is a weight coefficient;
scheduling an expected value for the product oil;
and scheduling the actual value for the product oil.
Based on the content of the above device embodiment, as an optional embodiment, the device for scheduling canned product oil based on the niche train competition algorithm provided in the embodiment of the present invention further includes: the sixth sub-module is configured to, after the selecting of a plurality of individuals in a plurality of scheduling scheme populations ranked in the top as the canned finished oil scheduling scheme, further include: if the terminal condition is not met, the search space of each individual in each scheduling scheme population is reduced, all individuals are used as parent individuals to generate a plurality of child individuals in the reduced search space, new objective function values of each child individual and each parent individual are obtained, the individuals with the new objective function values meeting the preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations again, and all the scheduling scheme populations are reordered again according to competition results until the terminal condition is met.
The method of the embodiment of the invention is realized by depending on the electronic equipment, so that the related electronic equipment is necessarily introduced. To this end, an embodiment of the present invention provides an electronic apparatus, as shown in fig. 3, including: the system comprises at least one processor (processor), a communication Interface (communication Interface), at least one memory (memory) and a communication bus, wherein the at least one processor, the communication Interface and the at least one memory are communicated with each other through the communication bus. The at least one processor may invoke logic instructions in the at least one memory to perform all or a portion of the steps of the methods provided by the various method embodiments described above.
In addition, the logic instructions in the at least one memory may be implemented in software functional units and stored in a computer readable storage medium when sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the method embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed 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 modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. Based on this recognition, each block in the flowchart or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In this patent, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A canned finished oil scheduling method based on a niche queue competition algorithm is characterized by comprising the following steps: acquiring a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; all individuals serve as parent individuals to generate a plurality of child individuals in the search space, the objective function value of each child individual and each parent individual is obtained, the individuals with the objective function values meeting a preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations, and all the scheduling scheme populations are reordered according to competition results; and if the end condition is reached, selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes.
2. The niche-queuing competition algorithm-based canned product oil scheduling method of claim 1, wherein the niche population division is performed on the initial plurality of canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations, comprising:
wherein k =1,2, …, N; i =1,2, …, N; n is the number of a plurality of canned product oil scheduling schemes;
the number is the ith habitat population norm;
is the ith population;
is the kth population;
is the nth individual in the ith population.
3. The method for scheduling canned finished oil based on niche queuing competition algorithm according to claim 2, wherein the obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population comprises:
wherein,
sharing functions of individuals in the ith scheduling scheme population;
historical fitness value of the ith scheduling scheme population;
the current fitness value of the ith scheduling scheme population is obtained;
is a niche population radius threshold;
to control the parameters of the shared function shape.
4. The niche rank competition algorithm-based canned finished oil scheduling method of claim 3, wherein the ranking of individuals in each scheduling scheme population according to each scheduling scheme population fitness value comprises: and according to the size of the fitness value of each scheduling scheme population, sequencing the individuals in each scheduling scheme population in an ascending order.
5. The method of claim 4, wherein the determining a search space for each individual according to the location of each individual in the corresponding scheduling scheme population comprises: the individual search space at the head is smallest and the individual search space at the tail is largest.
6. The method for scheduling canned finished oil based on niche queuing competition algorithm according to claim 5, wherein the obtaining the objective function value of each offspring individual and each parent individual comprises:
wherein G is an objective function; j is the jth time period; t is the number of time segments;
is a weight coefficient;
scheduling an expected value for the product oil;
and scheduling the actual value for the product oil.
7. The method of claim 6, wherein after selecting the individuals from the top-ranked scheduling plan populations as the canned product oil scheduling plans, the method further comprises: if the terminal condition is not met, the search space of each individual in each scheduling scheme population is reduced, all individuals are used as parent individuals to generate a plurality of child individuals in the reduced search space, new objective function values of each child individual and each parent individual are obtained, the individuals with the new objective function values meeting the preset threshold value are selected as representative individuals of the scheduling scheme population, the representative individuals participate in competition among all the scheduling scheme populations again, and all the scheduling scheme populations are reordered again according to competition results until the terminal condition is met.
8. A canned finished oil scheduling device based on niche queue competition algorithm is characterized by comprising: the first main module is used for obtaining a plurality of initial canned product oil scheduling schemes, and performing niche population division on the plurality of initial canned product oil scheduling schemes to obtain a plurality of scheduling scheme populations; the second main module is used for obtaining the fitness value of each scheduling scheme population according to the sharing function of the individuals in each scheduling scheme population, sequencing the individuals in each scheduling scheme population according to the fitness value of each scheduling scheme population, and determining a search space for each individual according to the position of each individual in the corresponding scheduling scheme population; the third main module is used for generating a plurality of descendant individuals in the search space by taking all the individuals as parent individuals, acquiring an objective function value of each descendant individual and each parent individual, selecting the individual with the objective function value conforming to a preset threshold value as a representative individual of the scheduling scheme population, participating in competition among all the scheduling scheme populations, and reordering all the scheduling scheme populations according to competition results; and the fourth main module is used for selecting a plurality of individuals in a plurality of scheduling scheme populations ranked in the front as the canned finished oil scheduling schemes if the termination condition is reached.
9. An electronic device, comprising:
at least one processor, at least one memory, and a communication interface; wherein,
the processor, the memory and the communication interface are communicated with each other;
the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1 to 7.
10. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110563948.8A CN113011797B (en) | 2021-05-24 | 2021-05-24 | Canned finished oil scheduling method and equipment based on niche train competition algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110563948.8A CN113011797B (en) | 2021-05-24 | 2021-05-24 | Canned finished oil scheduling method and equipment based on niche train competition algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113011797A CN113011797A (en) | 2021-06-22 |
| CN113011797B true CN113011797B (en) | 2021-07-27 |
Family
ID=76380745
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110563948.8A Active CN113011797B (en) | 2021-05-24 | 2021-05-24 | Canned finished oil scheduling method and equipment based on niche train competition algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113011797B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108898242A (en) * | 2018-06-07 | 2018-11-27 | 武汉理工大学 | A kind of multiple target Crude Oil Purchase optimization method |
| CN109034633A (en) * | 2018-08-04 | 2018-12-18 | 郑州航空工业管理学院 | Improved adaptive GA-IAGA solves the flexible job shop scheduling method with traveling time |
| CN111222642A (en) * | 2020-01-03 | 2020-06-02 | 浙江大学 | Multi-target flexible job shop scheduling method based on improved niche genetic algorithm |
| CN111242350A (en) * | 2019-12-31 | 2020-06-05 | 汉谷云智(武汉)科技有限公司 | Continuous reforming device fractionation and extraction optimization method, system and medium |
| CN111260157A (en) * | 2020-02-21 | 2020-06-09 | 天津开发区精诺瀚海数据科技有限公司 | Smelting ingredient optimization method based on ecological niche optimization genetic algorithm |
| CN111598306A (en) * | 2020-04-22 | 2020-08-28 | 汉谷云智(武汉)科技有限公司 | Oil refinery production plan optimization method and device |
| CN112381273A (en) * | 2020-10-30 | 2021-02-19 | 贵州大学 | Multi-target job shop energy-saving optimization method based on U-NSGA-III algorithm |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8533208B2 (en) * | 2009-09-28 | 2013-09-10 | Ebay Inc. | System and method for topic extraction and opinion mining |
| US11205132B2 (en) * | 2014-02-17 | 2021-12-21 | Invent.Ly, Llc | Perturbing the contextualization of a proposition by a group of subjects considered in a quantum representation by injecting a subject exhibiting an anti-consensus statistic modulo the proposition |
-
2021
- 2021-05-24 CN CN202110563948.8A patent/CN113011797B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108898242A (en) * | 2018-06-07 | 2018-11-27 | 武汉理工大学 | A kind of multiple target Crude Oil Purchase optimization method |
| CN109034633A (en) * | 2018-08-04 | 2018-12-18 | 郑州航空工业管理学院 | Improved adaptive GA-IAGA solves the flexible job shop scheduling method with traveling time |
| CN111242350A (en) * | 2019-12-31 | 2020-06-05 | 汉谷云智(武汉)科技有限公司 | Continuous reforming device fractionation and extraction optimization method, system and medium |
| CN111222642A (en) * | 2020-01-03 | 2020-06-02 | 浙江大学 | Multi-target flexible job shop scheduling method based on improved niche genetic algorithm |
| CN111260157A (en) * | 2020-02-21 | 2020-06-09 | 天津开发区精诺瀚海数据科技有限公司 | Smelting ingredient optimization method based on ecological niche optimization genetic algorithm |
| CN111598306A (en) * | 2020-04-22 | 2020-08-28 | 汉谷云智(武汉)科技有限公司 | Oil refinery production plan optimization method and device |
| CN112381273A (en) * | 2020-10-30 | 2021-02-19 | 贵州大学 | Multi-target job shop energy-saving optimization method based on U-NSGA-III algorithm |
Non-Patent Citations (2)
| Title |
|---|
| Competition for Mitogens Regulates Spermatogenic Stem Cell Homeostasis in an Open Niche;Kitadate et al;《cell press》;20190103;全文 * |
| 基于改进小生境帝国竞争算法的多目标电力系统无功优化;张金环 等;《华北电力大学学报》;20140731;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113011797A (en) | 2021-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Artificial bee colony for two dimensional protein folding | |
| CN107330560B (en) | Heterogeneous aircraft multi-task cooperative allocation method considering time sequence constraint | |
| Werner | Genetic algorithms for shop scheduling problems: a survey | |
| Luo et al. | Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW | |
| CN103530709B (en) | A kind of look for food the berth, container terminal of optimization method and bank bridge distribution method based on antibacterial | |
| CN112327923A (en) | Multi-unmanned aerial vehicle collaborative path planning method | |
| CN104573369A (en) | Shuffled frog-leaping based division method of software and hardware | |
| Jawarneh et al. | Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows | |
| CN116258357B (en) | Heterogeneous unmanned aerial vehicle cooperative target distribution method based on polygene genetic algorithm | |
| CN117077981B (en) | Method and device for distributing stand by fusing neighborhood search variation and differential evolution | |
| CN113204417A (en) | Multi-satellite multi-point target observation task planning method based on improved genetic and firefly combined algorithm | |
| CN113312874B (en) | Overall wiring method based on improved deep reinforcement learning | |
| CN109190985A (en) | A kind of multirobot rescue task distribution method | |
| Simrin et al. | The dynamic berth allocation problem: A linearized formulation | |
| Harris et al. | A memetic algorithm for the quadratic assignment problem with parallel local search | |
| Zhou et al. | A game-theory approach for job scheduling in networked manufacturing | |
| CN113011797B (en) | Canned finished oil scheduling method and equipment based on niche train competition algorithm | |
| CN113487031A (en) | Multi-unmanned aerial vehicle task allocation method based on improved simulated annealing fusion genetic algorithm | |
| CN112862212B (en) | Multi-AGV (automatic guided vehicle) scheduling method, device and equipment based on improved sparrow search algorithm | |
| CN112163790B (en) | Airport ground resource scheduling method, electronic device and computer readable storage medium | |
| Minocha et al. | Solution of time constrained vehicle routing problems using multi-objective hybrid genetic algorithm | |
| CN110633784A (en) | Multi-rule artificial bee colony improvement algorithm | |
| CN114862065A (en) | Social work task planning method and device, electronic equipment and storage medium | |
| CN114021914A (en) | Unmanned aerial vehicle cluster flight control method and device | |
| Lianshuan et al. | An improved pareto genetic algorithm for multi-objective TSP |
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 |