CN102254284A - Grid resource scheduling method based on simultaneous upward-offering auction mechanism - Google Patents

Abstract

The invention provides a grid resource scheduling method based on a simultaneous upward-offering auction mechanism, belonging to the technical field of networks. The grid resource scheduling method includes a preparation period, a screening period and an auction period. In the grid resource scheduling method, auction is adopted as a manner for pricing the grid resource capacity, and the pricing manner is used for allocating grid resources, thus the market information can be well reflected, and masses of customers are fully aroused to arrange idle resources into a grid so as to improve the resource scheduling efficiency in the grid environment; and the original simultaneous upward-offering auction mechanism is improved so that the mechanism is suitable for scheduling grid resources subjected to ribbon capacity division, and a grid resource auction winner standard identifying method is designed through combination of the grid resource scheduling method and a genetic algorithm, thus the grid resource scheduling method is better applicable to an actual long-term grid resource scheduling condition.

Description

A kind of grid resource scheduling method based on the auction mechanism of upwards offering simultaneously

Technical field

The invention belongs to networking technology area, be specifically related to a kind of grid resource scheduling method based on the auction mechanism of upwards offering simultaneously.

Background technology

Gridding technique can connect the various resources in the network and integrate, and the vacant share of resource is offered the user who needs them.Provide the slack resources of oneself in order to make resource provider add grid energetically, grid need be set up abundant driver resource supplier and with respect to the resource distribution mechanism of common interest.Traditional gridding resource configuration mechanism is based on the managerial personnel manual allotment that the user directly applies for resource and resource provider, can't embody the interests separately of grid user and resource provider, also can't realize the dynamic allotment of gridding resource.

Summary of the invention

Deficiency at existing grid resource scheduling method, the invention provides a kind of grid resource scheduling method based on the auction mechanism of upwards offering simultaneously, with the right to use of pervasive resource idle in the grid in long-term time range as commodity to carry out the resource rental transaction, and use genetic algorithm that the combinatorial optimization problem that runs in the mechanism is found the solution, and related resource is dispatched according to the result who obtains.

One, the ultimate principle of the grid resource scheduling method based on the auction mechanism of upwards offering simultaneously of the present invention:

The classification of 1 gridding resource

According to application target, the ability kind that the present invention provides gridding resource according to resource is different and be divided into Mesh Processing resource and grid storage resources.The Mesh Processing resource comprises all can provide processing power for affairs or a certain class particular problem on grid resource, in the middle of these resources, computational resources such as computing machine provide the processing processing power for data, production equipment in the factory provides for product starting material or half-finished processing processing power, and the human processing power that provides the variety of issue that in actual life and work, runs into as the social man.And the grid storage resources comprises that all can provide certain space to hold the article of regulation or the resource of information on the grid in a period of time, in these resources, the external memory of server can be used for storing data information in the network, warehouse in the manufacturing district can be used for storing starting material, semifinished or finished goods, and the bandwidth resources in the Internet resources then are used for the packet that temporary transient storage is flowed.

But this situation appears in above-mentioned classification sometimes, and a resource had both comprised processing power and also comprised storage capacity.If this moment, the storage capacity of this resource was served for processing power, it is considered herein that this resource is to handle resource; And if the storage capacity of this resource can be independent of processing power, or the storage capacity that provides has exceeded subsidiary book and has been in the required quantity of reason ability, it is considered herein that so this resource is to handle the synthesis of resource and storage resources.

The present invention's supposition is in a certain class resource transaction, if some resource is also often concluded the business because of demand is big, association area can be made the standard criterion of such resource requirement so.Whether meet these standard criterions according to gridding resource, the present invention is divided into pervasive resource and special resource with gridding resource.This point-score also show simultaneously the gridding resource that meets some pervasive resource criterion can be according to owner's wish resource is included into a certain pervasive resources-type in, thereby the same standard of value with such pervasive resource of similar pervasive resource with other is concluded the business; Or this kind resource concluded the business with the buyer's oneself the standard of value as a kind of specific special resource.When the seller is used as ability as the special ability processing, the special value place that can point out its resource institute providing capability by extra descriptor; And when ability is used as the transaction of pervasive ability, be confined in the scope of standard code for the descriptor of this ability.

Use above two kinds of rules to divide simultaneously, the present invention is divided into pervasive processing resource, special processing resource, pervasive storage resources and special storage resources with resource.The goods to auction of concluding the business among the present invention is exactly in fact by the right to use of a certain class resource in a certain period in these resources, and the actuals that final victor obtains by transaction is the corresponding ability that interior during this period of time this resource provides.Because the time corresponding of having rented of resources use right limits, so its ability that provides has time attribute naturally.The present invention is divided into short-term ability and long-term ability according to the length of the shortest lasting rental period of ability with ability.

When the pervasive ability of transaction short-term, the ability that the auction system of the present invention's design takes block ability description to come each seller is provided is carried out the standardization statistics, and each ability piece has following three attributes: start time, duration, capacity.The present invention will be called the term of validity of ability piece from the start time of ability piece continuous time through this section after the duration.When the commodity of transaction were processing power, what capacity was represented was the task amount that can finish in the term of validity.When the commodity of transaction were storage capacity, what capacity was represented was the maximum storage that can admit in the random time in the term of validity.The essence that block ability is divided be to use performance curve portrayal resource capability over time after, use the quantity delivered of ability in method statistic units chunk time of discretize.And the duration size of ability piece should reflect that not only the chronomere of associated user's demand measures, and also should make the seller add up resource capability as a kind of time range of reasonable tolerance.The bulk of ability is divided referring to Fig. 1.

When the long-term ability of transaction, the auction platform of the present invention's design takes banded ability description to portray the buyer's demand and the seller's supply.Each ability has following three attributes: start time, duration and instantaneous ability value.Equally, the present invention will be called the term of validity of ability band from the start time of ability band continuous time through this section after the duration.When the commodity of transaction were processing power, what instantaneous ability value was represented was the average task amount that per unit can be finished in the time in the term of validity.When the commodity of transaction were storage capacity, what instantaneous ability value was represented was the maximum storage that any time is distributed to this buyer in the term of validity.

2 user's requests and the market segmentation

To the classification of goods to auction, the present invention is divided into the auction marketplace and is used to the conclude the business market of the pervasive ability of short-term, the market of the long-term pervasive resource capability of transaction and the market of transaction special ability according to above.By market being divided into three classes, the present invention has designed relevant auction mechanism respectively.

As shown in Figure 2, the buyer that may take part in auction can be divided into large-scale user, application service provider and special user according to the purpose difference that takes part in auction.Wherein, the purpose that the application service provider takes part in auction is in order to buy a large amount of widely used by the user, processing power and storage capacities with mass market, will these abilities integrates, through selling medium and small sized enterprises or domestic consumer in the mode of price after the specific configuration.It is need rent a large amount of, long-term resource because of the demand of itself that large-scale user takes part in auction.And the purpose that the special user takes part in auction is to rent some special resource ability for the individual demand needs that satisfy oneself in a period of time.The seller who participates in these auctions then is a zonal gridding resource provider.

As shown in Figure 3, large-scale user and application service provider's ability need may be a time dependent curve.Generally, these grid users can according to the demand cycle of each period rent needs in following a period of time ability and actual conditions of demand make comparisons, over-evaluating shown in the figure, average and underestimate three kinds of situations may appear.The long-term ability of buying as the buyer is in average or when underestimating, the demand that a certain period can take place has exceeded the situation that resource can be supplied in user's hand.The sudden ability shortage that produces needs the buyer to obtain a certain amount of short-term ability.

For two kinds of different demands of long and short phase, the present invention uses simultaneously upwards asked price auction to cooperate banded ability description to satisfy the long-term ability need of the buyer for pervasive ability at the buyer.

3 auction mechanism of upwards offering simultaneously

The present invention's asked price auction that makes progress to original the time is made amendment, and cooperates banded ability to divide and makes it to be applicable to long-term pervasive ability transaction situation.

3.1 technical essential

Upwards the difference of asked price auction and traditional unidirectional auction is that a plurality of goods to auction are started auction simultaneously in an auction simultaneously, and the buyer can select to submit a tender to any goods to auction before End of Auction, and its auction technique uses the advance price auction usually.

In conjunction with unidirectional auction mechanism method for designing, in the design process of its corresponding network auction, should consider and note following several respects problem:

(1) publicity of information and termination condition

Receive the seller's the trust and the buyer's information such as target when auction platform after, other auction participant does not know these information, thus auction platform can select which information should disclose, open when.And termination condition also can have various ways, can be regularly (stipulate the total duration auctioned by the seller before auction, after the time arrived, commodity were obtained by highest bidder or current victory mark set); Also can be (seller can stipulate when the some default price of on average bidding above of gathering of bid price or current victory mark, End of Auction) of satisfying that specified conditions just finish.The selection of information is open can to cause auctioning the different effect of appearance with the combination of different termination conditions.For example: in traditional envelope mark auction, the buyer's target is exactly externally covert.Because auction has only one bout, the buyer can be worth the back in order winning and to submit the target of oneself in other buyeies' of estimation bid.Therefore, the net result of auction may not be the buyer of the most strong triumph, and it may propose low excessively quotation because of low excessively other buyeies' of estimation bid.If the auction of regulation envelope mark is carried out many wheels and the result that each is taken turns is announced to each buyer then the buyer can revise own original underestimation by the information of triumph target, thereby avoids the generation of top situation.

Behind End of Auction, the seller wishes commodity reasonably to be distributed to the highest suitor of bid or collective and is worth the highest target set, and this moment, this time auction was considered to effective.If the termination condition of auction is set at the set time end, " sniping " phenomenon then may occur.So-called " sniping " phenomenon refers in regularly auctioning, and some suitors submit to target to make when auction closes to an end rapidly oneself becomes the victor, and original victor may have little time reaction in the remaining time, and auction just is through with.The auction process of this moment is incomplete in fact, and the possible bid behavior of the part buyer has little time because of time relation to carry out.Generation for fear of this situation, can revise the termination condition of auction, for example can stipulate when auction side in a period of time does not receive new target, the real end just calculated in auction, and when " sniping " phenomenon occurring, the concluding time of auction can prolong a period of time automatically backward.

(2) combination auction and victory mark affirmation problem

In the auction of many commodity, if commodity be can divide or when multiple array mode can be arranged, mark affirmation problem can appear winning.This appears in the large-scale procurement competitive bidding usually, part or all of suitor can't provide the entire service in the procurement plan alone, this moment is for definite type of merchandize and commodity amount of purchasing from each suitor's hand, usually bid person need demand and the preference according to oneself formulate a kind of method that can weigh difference between the various combination scheme before auction, and auction can be to select best scheme according to bid person's wish by this method.If but buyer's quantity of participation competitive bidding more for a long time, a large amount of targets can cause feasible target assembled scheme a lot., be difficult to guarantee in official hour, to select best scheme so if the time that this moment, but supply and demand were separated is shorter for the scale of problem.Try to achieve one makes bid person that satisfied scheme is necessary this moment in a rational time range, need mathematical model according to problem to design corresponding algorithm for this reason and find the solution and win mark affirmation problem.

In essence, winning mark affirmation problem is a combinatorial optimization problem, the objective function of problem is exactly the mathematic(al) representation by the method correspondence of the measurement scheme quality of bid person's formulation, and the characteristics of commodity itself can form different constraint condition with the various combination restrictive condition that the seller formulates, and cause the mathematical model of problem correspondence that different structures is arranged.For example: if the commodity of regulation in will auctioning can be cut apart with any number percent, confirm can be corresponding to the 0-1 knapsack problem for the victory of these commodity mark so, and this situation may occur in the auction with the kind staple commodities.When the commodity that if some attribute that commodity have causes difference to be cut apart to be obtained can not mutual alternative, the victory of these commodity mark confirms to be exactly a kind of 0-1 knapsack problem that has the particular constraints condition, and this situation may occur in the large-scale procurement of government's bid or enterprise.

For the mathematical model of different structure, more excellent the separating that algorithms of different was tried to achieve in the identical time may be different.In actual life, by in advance with industry in expert and bid person link up, auction can be with the value information of knowing extensive stock in the auction and possible combined situation.Can produce a large amount of auction examples by the means of simulation thus, experimentize, just might find out the more excellent algorithm of a kind of in most of the cases performance by utilizing a large amount of this possible datas.

The method that can solve this type of problem has a lot, and the present invention has used two kinds of algorithms wherein to find the solution 0-1 knapsack problem corresponding in the auction mechanism and compared its performance difference.Wherein a kind of is branch-and-bound method in the traditional optimization method for solving, progressively seeks solution space in the mode that makes up binary tree; Another kind is a genetic algorithm.

When the mark of the victory in the combination auction confirm that algorithm tries to achieve be not the optimum solution of this problem correspondence the time, the buyer's triumph has certain contingency.In order to avoid this contingency as far as possible, the combination auction can be arranged to turn-based and (be defined as the one bout of auction one period regular time, winning mark after each bout finishes confirms), the victory mark result who auction platform is put at any time buyer's target information of receiving and each bout is open to all buyeies.With the buyer's target information disclosure is to proofread and correct the market supply and demand information of commodity and adjust own value estimations for commodity for the quotation information that each buyer is proposed by other buyeies, thus correct making a policy in auction process.And in time openly be in order to break the price deadlock that may exist in the auction process (all buyeies all think that own current target win probably and cause no longer including new target and produce) with the set of the victory of each bout mark, this effect class all is to use current auction result to stimulate each buyer to continue to improve quotation with auction teacher in traditional English auction strikes hammer before conclusion of the business action.

3.3.2 target portrayal

The present invention uses banded ability description to portray long-term ability need, and the term of validity of renting of ability is to be determined by the seller that in the announcement phase of auction the purpose that the buyer takes part in auction is to obtain a certain amount of ability in the period at this section.

3.3.2.1 buyer's target portrayal

Buyer's target comprises following a few part:

The buyer's identify label (Bidder Identification): bid _iDuring login, the identify label center that User Identity uid is subordinate to can judge whether uid is legal.After the legitimacy authentication, in auction platform, use the unique resource provider corresponding sign bid with uid _iRepresent this resource requirement side.The purposes of this sign is similar to the bid price number plate in the traditional auction.

This target towards supplier sign (Provider Identification): pid _jThat this identify label is represented is buyer bid _iTo seller pid _jThe commodity that provide are submitted a tender.

The ability quantity (Required Capacity) that unit interval needs: Rc _iThat express is bid _iThe ability need amount of time per unit in lease period.

Buying Offer (Bidding Unit Price): Bup _iBup _iThat represent is bid in this time submitting a tender _iThe Board Lot ability purchasing price of in lease period, quoting.

3.3.2.2 seller's ability portrayal

The information that the seller provided in the preparatory stage of auction comprises following a few part:

The seller's identify label (Provider Identification): pid _jDuring login, the identify label center that User Identity uid is subordinate to can judge whether uid is legal.After the legitimacy authentication, in auction platform, use the unique resource provider corresponding sign pid with uid _jRepresent this resource provider.The purposes of this sign is similar to the sign of goods to auction.

Unit interval providing capability quantity (Supplied Capacity): Sc _jThat express is pid _jAbility quantity delivered in lease period in the time per unit.

The seller keeps unit price (Reserved Unit Price): Rup _jRepresent pid _jReserve price for the unit capabilities setting.

Two, technical scheme of the present invention

Grid resource scheduling method based on the auction mechanism of upwards offering simultaneously of the present invention, upwards the asked price auction is set to regularly hold simultaneously, and once auction is divided into preparatory stage, screening phase and auction phase, comprises the steps:

Step 1, preparatory stage: the trust and the announcement stage of finishing traditional auction;

Auction platform is accepted all sellers' trust on a specified date, writes down and add up ability supply and reserve price that each seller submits to; The announcement stage openly specifically the auction in each seller the ability supply and the screening phase concluding time;

Step 2, screening phase: when the buyer who takes part in auction is too much, auction platform need filter out that part of buyer that most probable is won, and it is long and total business volume increases few situation to prevent submit a tender duration of causing auction of the too much buyer to eliminate other participants;

In the screening phase, the bidder is carried out authentication, registration, after the bank freezing guaranty money, carry out taking turns screening process on the net; Each buyer can only throw a deutero-albumose in the screening phase, indicates ability need and bid in the target, need not indicate in this target towards supplier sign; Suppose that it is the right that l times the overall supplies and the highest that part of buyer that bids continue to submit a tender that auction platform keeps aggregate demand, the screening process that auction platform carries out after the screening phase expires is as follows:

Step 2.1: the overall supplies Tspc that counts all sellers, descending according to the ability quotation Bup of buyer unit rearranges buyer's target, ascending order according to Rc when Bup is identical is arranged, the aggregate demand that variable Td represents current buyer's set is set, buyer's target number that on behalf of inspected, n cross, the initial value of Td is made as 0, and the initial value of n is made as 1;

Step 2.2: from buyer's formation, duplicate n buyer's target information, suppose that this target demand is Rc _n, Td=Td+Rc _n, use variable Srp to write down this buyer's quotation per unit;

Step 2.3: if Td 〉=l * Tspc or n during greater than the target number in buyer's formation, forward step 2.4 to; Otherwise n=n+1 forwards step 2.2 to;

Step 2.4: n the buyer's bid power before keeping in the formation of buyer's target, notify other buyeies to withdraw from auction;

Step 3, auction phase: finish operation and accounts settling phase in the traditional auction;

Use the turn-based auction process, the flow process of each bout is as follows:

Step 3.1:, calculate the price Sup=max (Rup that starts auction of seller j according to start auction reference price and each seller's reservation price _j, Srp), determine the initial duration T of each bout auction _Ori, snipe supervision time T _CheckWith snipe time expand T _MoreIf (apart from the T before this bout End of Auction _CheckAuction platform is received target in time, then thinks " sniping " phenomenon has taken place, with the duration prolongation T of this bout _More);

Step 3.2: timer is set, makes it through T _OriTrigger;

Step 3.3: platform receives buyer's target, and buyer's target according to seller's difference of investing, is used the descending sort of different target formations according to the ability quotation Bup of unit;

Step 3.4: timer is to after date, and whether the time of arrival of checking last target is at the current T of distance _CheckTime range in, if time of arrival in this scope, then timer is set to through T _MoreTrigger the back, and flow process turns to step 3.3; If not in this scope, check whether this bout receives new target time of arrival, if receive new target, win mark and confirm, announce the set of triumph target to each buyer, flow process turns to step 3.2; If do not receive new target at this bout, the auction phase finishes, and notifies each the buyer auction result and settles accounts;

It is as follows wherein to win the mark confirmation method:

Step 3.4.1 wins the mathematical model that mark is confirmed

Each seller will determine and announce victor's set of this bout according to buyer's target that this bout is received in every bout; Suppose seller pid _jReceive m buyer's target at the k bout, this m buyer is respectively bid _J1, bid _J2Λ, bid _Jm, establish buyer bid _JiWhether that wins is designated x _Ji, then the mathematical model of the victory of this auction mechanism mark affirmation problem is:

$\mathrm{Maximize}:\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Bup}}_{\mathrm{ji}}\×{\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})$

s.t. x _ji∈{0，1}

$\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j---\left(3.1\right)$

Step 3.4.2 makes amendment to traditional genetic algorithm and is used for finding the solution the victory mark affirmation problem of each seller's correspondence, and its step is as follows:

Step 3.4.2.1 chromosome coding

Use the two-dimensional variable length structure of arrays, wherein on behalf of a seller's victory mark, each row confirm result, the every i column element x during j is capable _JiWhether representative wins to i the buyer that this seller j submits a tender; Element value uses the 0-1 coding, and on behalf of this buyer, 1 win, and 0 representative is not won;

Step 3.4.2.2 initialization population

After setting population scale, produce each chromosome successively; When determining the element value of each row, need to guarantee $\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rpc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j;$

The step 3.4.2.3 value function that suits

The transaction value sum of selecting each seller for use as just when;

Step 3.4.2.4 selects, intersects, makes a variation

Step 3.4.2.4.1 selection operation uses the roulette back-and-forth method in the traditional genetic algorithm:

Step 3.4.2.4.2 interlace operation be will be correlated with successively chromosomal each the row in element carry out uniform crossover operator; Some row in the chromosome that the process interlace operation obtains may not satisfy

Make with the following method this row is revised: each element during from left to right traversal is gone successively, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.4.3 mutation operation is to be unit with the element in the row, and whether each element that calculates successively in this row by the variation probability morphs, when element morphs with this element value step-by-step negate; During concrete operations, from left to right successively each element in the row is carried out mutation operation, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.5 union operation and algorithm flow

Through intersection and chromosome that variation obtains in certain several seller may appear and transaction value be higher than current optimum chromosome, use this moment union operation that optimum chromosome and selected chromosome are carried out line by line relatively and will be better than optimum chromosomal those row merging in the optimum chromosome; The overall flow of genetic algorithm is as follows:

Step 3.4.2.5.1: set population scale Y and maximum iteration time Q, with current iteration number of times q=0;

Step 3.4.2.5.2: the initialization population, as current population P _Now, be worth the highest chromosome as current optimum chromosome C with wherein suitable _Best

Step 3.4.2.5.3: to P _NowIn chromosome select, make a variation and intersect to produce new population, in the process that produces new population, use union operation to generate the more excellent chromosome C in this generation _Better, with new population as current population, with the more excellent chromosome C in this generation _BetterWith current optimum chromosome C _BestCarry out union operation, q=q+1;

Step 3.4.2.5.4: if q＜Q forwards step 3.4.2.5.3 to; Otherwise, output C _BestAs separating of problem, algorithm finishes.

A kind of grid resource scheduling method beneficial effect of the present invention: with the pricing method of auction technique as the gridding resource ability based on the auction mechanism of upwards offering simultaneously, and carry out the configuration of gridding resource with this, can reflect market information well and give full play to users slack resources is joined grid, improve the scheduling of resource efficient under the grid environment; Improved the asked price auction mechanism that makes progress original the time, made its scheduling that is fit to gridding resource that banded ability is divided, and in conjunction with genetic Algorithm Design the gridding resource auction win the mark confirmation method, better be fit to actual long-term grid resource scheduling situation.

Description of drawings

Fig. 1 is the block synoptic diagram of dividing of ability;

Fig. 2 is the synoptic diagram of the application background of auction;

Fig. 3 is the synoptic diagram of large-scale user's ability need fluctuation.

Embodiment

Below in conjunction with accompanying drawing the grid resource scheduling method based on the auction mechanism of upwards offering simultaneously of the present invention is done and to be described in further detail.

One, based on the theory basis of the grid resource scheduling of auction mechanism

1 auction technique

Auction need be by carrying out with the corresponding auction technique of goods to auction.Auction technique is meant the concrete operation regulation when auction facility is carried out auction activity, and this operation regulation should fully take into account the kind and the characteristics of goods to auction, by selecting or revise existing auction technique targetedly after auction items is determined.

Along with the theoretical development of auction, the participation quantity of both parties in auction both may be the relation of one-to-many, also may be the relation of multi-to-multi, auction can be divided into unidirectional auction and two way auction again according to the difference of this participation quantity of both sides.

1.1 unidirectional auction technique

According to different rules, auction technique can have different types of dividing mode, as Wiggans unidirectional auction technique is divided into three kinds: sealing auction, advance price auction and Dutch Auction; Whether Rothkopf etc. then openly can be divided into public auction and sealing auction to auction to everyone according to buyer's target information in the auction process.At present, the basic auction technique of Gong Rening has following four kinds: advance price auction, Dutch auction, sealing first price auction and seal second price auction.Wherein, divide according to the standard of Rothkopf etc., preceding two kinds of basic auction techniques belong to public auction, and back two kinds of basic auction techniques belong to the sealing auction.

(1) advance price auction

The advance price auction also claims English auction, is a kind of auction technique the most used in the actual life.In English auction, a plurality of bidder can be arranged, each bidder can offer to goods to auction, and price is soaring gradually in auction process, and auction lasts till do not have new bid price to be higher than till the current bid price always in a period of time.Generally, the bidder can know all bid prices that other bidder submitted in the past.When if goods to auction is Individual Items, till auction process lasts till that this part sales of goods is to the highest people that offers; If auction be many wares the time, then auction will last till a certain price, the aggregate demand on this price just equals the overall supplies that will sell.The characteristics of advance price auction are that at any time of auction process point, each bidder knows current highest bid.English auction also is most popular up to now online auction technique, and the rule of this mode is simple and be convenient to the bidder current competitive bidding information is in time understood, and makes bidder's participation become relatively easy.

(2) Dutch auction

Dutch auction is driving in the wrong direction of advance price auction, i.e. Dutch auction use is auctioned the knockdown price that opposite mode is determined goods to auction with advance price, because of its auction that is applied to Dutch fresh flower the earliest well-known, so also claim Dutch Auction.Dutch auction is told a highest price by auction side, reduces present price in auction process in time successively, till having people's asked price to buy.The speed that common Dutch auction is carried out is fast especially, often is used to auction those perishable agricultural byproducts, as fruit, vegetables, seafood etc.If Dutch auction be many wares the time, usually buyer's quantity can increase along with the decline of price, the supply that auction process will last till goods to auction always is with till aggregate demand equates.In addition, at special circumstances, the rule of Dutch auction has tangible mixed nature.This character is embodied in when auction side reduces quotation, if two above buyeies are when answering the situation of valency, auction just changes the advance price auction procedure over to, makes the continuation of bidding.Therefore in this auction process, auction side merely uses the Dutch auction mode, has also used the form of advance price auction when determining the goods to auction final price.This shows, when formulating auction technique can with existing auction technique conditionally in conjunction with and be used alternatingly.

(3) sealing auction

Sealing auction is meant that the seller after goods to auction is set reserve price seals it, then by the appraisal of auction side declaration auction items, indicates the time, place, goods to auction quantity, conditions of auction of auction bid etc., gives the suitor by auction side.The suitor giving auction side in the quotation of oneself, does not know how many quotations separately is with the mode that seals letter between the suitor.Examination one by one and is mutually relatively received after all suitors' the quotation by auction side, and the suitor who meets seller's condition most is the winning bidder, obtains the article of auctioning simultaneously.When if the price of winning bidder's payment is his bid price, then this auction is called as sealing first price auction; When if the winning bidder only need pay highest bid except that him, be called sealing second price auction.

The sealing auction is with the basic difference of public auction: the suitor in the public auction can repeatedly adjust quotation according to rival's asked price, and the chance that each suitor in the sealing auction for once offers; Public auction is the highest as the triumph condition with bid usually, and sealing auction sometimes with quotation near reserve price or tape spare, scheme optimum as the acceptance of the bid condition; Generally be to serve as intermediary in the public auction, and generally be that buyer and seller directly contact with and negotiate in the sealing auction by auction side.

More than the essential structure of four kinds of auction techniques be identical, both parties all are the market structures of " one-to-many ".In this structure, if the buyer has only one, then the seller is with regard to more than one; If the seller has only one, then the buyer is with regard to more than one.Both parties always have a side grasping scarce resource in the market, have the advantage of resource, and this advantage makes this side have the option dealing mode and formulates the right of trading rules.

1.2 two way auction mode

Different with unidirectional auction, participate in all more than family of both parties of two way auction, the sellers and the buyeies submit bid to, and (the target price that the seller submits to is called " charge ", the target price that the buyer carries is called " asked price "), the buyer is according to the tender price formation that causes the demand of sorting from high to low, and the seller sorts from low to high according to tender price and produces the supply formation; By the charge (lowest price from seller's formation backward move) of the coupling seller from two formations and the buyer's asked price (ceiling price from seller's formation is mobile backward) but determine the maximum number of transaction; Determine equilibrium price and knockdown price separately according to certain market clearing rule then.

The trading time period of two way auction, any buyer can declare publicly the article of being willing to be intended to buy on which kind of price how many units of quantity; Any seller also can declare publicly the article of being willing to be intended to sell on which kind of price how many units.In case the buyer's asked price is accepted (or the seller's charge is accepted by the buyer) by the seller, just have article and strike a bargain; If the buyer's asked price is not accepted (or the seller's charge is not accepted by the buyer) by the seller, the buyer can improve its asked price gradually, and the seller also can reduce its charge gradually, till a side is accepted by the opposing party; This process lasted till till the closing the transaction time that no longer includes transaction generation or the prior regulation of arrival in a period of time always.

Two way auction can further be classified.Whether Friedman can be modified according to closing the transaction condition and quotation, auction is divided into discrete time auction and auction continuous time, wherein the buyer and the seller in the discrete time auction can't revise quotation, and the buyer and the seller in auction continuous time can revise quotation at any time.Gode and Sunder be according to quotation rules, thinks the two way auction that has three kinds of forms: first kind is called the synchronous bidirectional auction, refers to that the buyer's asked price and the seller's charge carry out synchronously or in batches, and both parties do not know the other side's quotation mutually when quotation; Second kind is called the continuous type two way auction, refers to that the buyer and the seller offer at random, and the real Buying Offer in market is not less than real asked price; The third is called semicontinuous type two way auction or mixed type two way auction, combines the characteristics that both parties offer in batches in the synchronous bidirectional auction, and the characteristics that both parties are mated successively in the continuous type two way auction.Wurman etc. by the sorting technique of unidirectional auction, also are divided into sealing two-way auction and open two way auction to two way auction according to different information announcement rules.

2 genetic algorithms

2.1 key concept and thought

Genetic algorithm copies the production process of occurring in nature life and biological evolutionary process to produce.Each is separated corresponding to an individuality with certain features in the biotic population in the solution space of problem correspondence, and each individuality has corresponding with it chromosome, and Different Individual presents different characteristics and embodied by different chromosome.In by " physical environment " that problem determined, different characteristics are corresponding to the adaptedness different to environment, individual formed population procreation from generation to generation in this " physical environment ", survive, and run to up to algorithm till the termination condition of regulation.

In algorithm, chromosome is by genomic constitution, and the coloured differently body structure is corresponding to different coding forms.The coding here refers to and uses specific data structure and corresponding numerical value to come separating of problem of representation.Individually represent by the pairing chromosomal fitness size of individuality and weigh for the adaptedness of environment, and fitness to be the fitness function that is determined by problem and coded system determined.

In this microprocess of generation of life, a new life's individuality may be that to inherit fully also may be to produce after having changed the part or all of characteristics of first generation individuality.Therefore a newborn individual adaptedness for " physical environment " depends on the individual quality of generation earlier that produces it to a certain extent, if but this does not represent elder generation's generation individuality bad for the adaptedness of environment, the adaptedness of the son individuality of their generations is also necessarily bad so.This is because formerly in individual all characteristics that had, have a part of characteristics and help the ideal adaptation environment, but owing to individual adaptedness for environment is that all characteristics that possessed by individuality are determined, so formerly may be covered by other unfavorable characteristics, make individual undesirable for the whole adaptedness of " physical environment " for the favourable characteristics in the individuality.Then can and integrate these favourable characteristics as the sub-individuality that these elder generation's generation individualities are produced, thereby have than the whole characteristics that have more advantage earlier for individuality with certain probability succession.

In the algorithm with it respective operations be THE REPLICATION OF CHROMOSOME, intersection and variation.Duplicate and refer to the individual elder generation of inheriting fully of son for all individual characteristics, it is identical for individual chromosome with an elder generation that produces it to show as sub individual homologue.Thereby intersect refer to according to generation earlier individual the part characteristics reconfigure and produce a new individuality, this be presented as chromosomal counter structure according to certain rule earlier generation chromosomal portion gene reconfigure and form a new chromosome.Variation refers to through duplicating or intersecting and after producing new sub-individuality, thereby the characteristics that change in the sub-individuality with certain small probability form new characteristics, and this is presented as according to certain rule and the probability existing genic value that son is individual and changes over new genic value.

Individual to produce son individual by first generation, earlier generation individual place initial population the newborn population at the individual place of quilt is substituted.In this course, owing to have better adaptedness than other individuality with population for environment for the part in the population is individual earlier, these individualities just may not eliminated rapidly by " physical environment " institute, thereby have had right and the chance that produces offspring.This is representing for the adaptedness of environment strong more, then should produce offspring with regard to being chosen by other individuality more by individuality.This design of algorithm has reflected the thought of " survival of the fittest in natural selection " in the biological evolution process.By the introducing of this thought, thereby the deviser of algorithm wishes that the sub-population that produces can more approach the optimum individual that " physical environment " can produce than having the characteristics that better adaptation characteristics embody the part individuality of population for population for environment earlier.

Corresponding with it in algorithm is selection operation, selection refers to selecting the operation of the individuality of a certain quantity in certain probability population of before generation, and each individual selected probability size is determined by the whole adaptedness of all individualities in the adaptedness of the corresponding environment of this individuality and the population to environment.

2.2 algorithm flow

The individual pairing chromosome of in the population each is represented by a related data structure, solution space dimension corresponding when the dimension of data structure is found the solution problem with algorithm designer is identical, and each chromosome all can be calculated own corresponding adaptive value size according to the pairing fitness function of problem.Generally, algorithm needs to preserve the pairing chromosome congression of previous generation population in the process of implementation, and produces new population with this, carries out this process repeatedly and write down more excellent the separating that algorithm obtains as algorithm in the current optimized individual that obtains when finishing.

The process of genetic algorithm is as follows:

2.2.1:: determined to produce initial population at random behind the population scale, each individuality is expressed as the pairing gene code value of chromosome;

2.2.2: calculate each individual fitness in the population, judge whether to satisfy the termination condition of algorithm,, then separating as the net result of algorithm of current optimized individual representative exported, and finish algorithm flow if satisfy; Otherwise continue to carry out step 2.2.3 down;

2.2.3: the individuality of in current population, selecting requirement according to fitness;

2.2.4: crossover probability according to the rules and cross method produce new individual;

2.2.5: according to the rules variation probability and variation method, individuality is made amendment;

2.2.6: after producing the population of individuality as a new generation of specified quantity, return top 2.2.2.

Termination condition in the genetic algorithm, can be according to the different choice of problem different modes.For example, can select the termination condition of one of following condition for use as algorithm:

(1) fitness of current optimized individual has surpassed preset value;

(2) individual average fitness has surpassed preset value in the current population;

(3) proceed to current genetic algebra and surpassed preset value.

Two, the grid resource scheduling method based on the auction mechanism of upwards offering simultaneously of the present invention grid resource scheduling method based on the auction mechanism of upwards offering simultaneously of the present invention, upwards the asked price auction is set to regularly hold simultaneously, once auction is divided into preparatory stage, screening phase and auction phase, comprises the steps:

Step 1, preparatory stage: the trust and the announcement stage of finishing traditional auction;

Auction platform is accepted all sellers' trust on a specified date, writes down and add up ability supply and reserve price that each seller submits to; The announcement stage openly specifically the auction in each seller the ability supply and the screening phase concluding time;

Step 2, screening phase: when the buyer who takes part in auction is too much, auction platform need filter out that part of buyer that most probable is won, and it is long and total business volume increases few situation to prevent submit a tender duration of causing auction of the too much buyer to eliminate other participants;

In the screening phase, the bidder is carried out authentication, registration, after the bank freezing guaranty money, carry out taking turns screening process on the net; Each buyer can only throw a deutero-albumose in the screening phase, indicates ability need and bid in the target, need not indicate in this target towards supplier sign; Suppose that it is the right that l times the overall supplies and the highest that part of buyer that bids continue to submit a tender that auction platform keeps aggregate demand, the screening process that auction platform carries out after the screening phase expires is as follows:

Step 2.1: the overall supplies Tspc that counts all sellers, descending according to the ability quotation Bup of buyer unit rearranges buyer's target, ascending order according to Rc when Bup is identical is arranged, the aggregate demand that variable Td represents current buyer's set is set, buyer's target number that on behalf of inspected, n cross, the initial value of Td is made as 0, and the initial value of n is made as 1;

Step 2.2: from buyer's formation, duplicate n buyer's target information, suppose that this target demand is Rc _n, Td=Td+Rc _n, use variable Srp to write down this buyer's quotation per unit;

Step 2.3: if Td 〉=l * Tspc or n during greater than the target number in buyer's formation, forward step 2.4 to; Otherwise n=n+1 forwards step 2.2 to;

Step 2.4: n the buyer's bid power before keeping in the formation of buyer's target, notify other buyeies to withdraw from auction;

Step 3, auction phase: finish operation and accounts settling phase in the traditional auction;

Use the turn-based auction process, the flow process of each bout is as follows:

Step 3.1:, calculate the price Sup=max (Rup that starts auction of seller j according to start auction reference price and each seller's reservation price _j, Srp), determine the initial duration T of each bout auction _Ori, snipe supervision time T _CheckWith snipe time expand T _MoreIf (apart from the T before this bout End of Auction _CheckAuction platform is received target in time, then thinks " sniping " phenomenon has taken place, with the duration prolongation T of this bout _More);

Step 3.2: timer is set, makes it through T _OriTrigger;

Step 3.3: platform receives buyer's target, and buyer's target according to seller's difference of investing, is used the descending sort of different target formations according to the ability quotation Bup of unit;

Step 3.4: timer is to after date, and whether the time of arrival of checking last target is at the current T of distance _CheckTime range in, if time of arrival in this scope, then timer is set to through T _MoreTrigger the back, and flow process turns to step 3.3; If not in this scope, check whether this bout receives new target time of arrival, if receive new target, win mark and confirm, announce the set of triumph target to each buyer, flow process turns to step 3.2; If do not receive new target at this bout, the auction phase finishes, and notifies each the buyer auction result and settles accounts;

It is as follows wherein to win the mark confirmation method:

Step 3.4.1 wins the mathematical model that mark is confirmed

Each seller will determine and announce victor's set of this bout according to buyer's target that this bout is received in every bout; Suppose seller pid _jReceive m buyer's target at the k bout, this m buyer is respectively pid _J1, pid _J2Λ, pid _Jm, establish buyer pid _JiWhether that wins is designated x _Ji, then the mathematical model of the victory of this auction mechanism mark affirmation problem is:

$\mathrm{Maximize}:\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Bup}}_{\mathrm{ji}}\×{\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})$

s.t.x x _ji∈{0，1}

$\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j---\left(3.1\right)$

Step 3.4.2 makes amendment to traditional genetic algorithm and is used for finding the solution the victory mark affirmation problem of each seller's correspondence, and its step is as follows:

Step 3.4.2.1 chromosome coding

Use the two-dimensional variable length structure of arrays, wherein on behalf of a seller's victory mark, each row confirm result, the every i column element x during j is capable _JiWhether representative wins to i the buyer that this seller j submits a tender; Element value uses the 0-1 coding, and on behalf of this buyer, 1 win, and 0 representative is not won;

Step 3.4.2.2 initialization population

After setting population scale, produce each chromosome successively; When determining the element value of each row, need to guarantee $\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rpc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j;$

The step 3.4.2.3 value function that suits

The transaction value sum of selecting each seller for use as just when;

Step 3.4.2.4 selects, intersects, makes a variation

Step 3.4.2.4.1 selection operation uses the roulette back-and-forth method in the traditional genetic algorithm:

Step 3.4.2.4.2 interlace operation be will be correlated with successively chromosomal each the row in element carry out uniform crossover operator; Some row in the chromosome that the process interlace operation obtains may not satisfy Make with the following method this row is revised: each element during from left to right traversal is gone successively, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.4.3 mutation operation is to be unit with the element in the row, and whether each element that calculates successively in this row by the variation probability morphs, when element morphs with this element value step-by-step negate; During concrete operations, from left to right successively each element in the row is carried out mutation operation, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.5 union operation and algorithm flow

Through intersection and chromosome that variation obtains in certain several seller may appear and transaction value be higher than current optimum chromosome, use this moment union operation that optimum chromosome and selected chromosome are carried out line by line relatively and will be better than optimum chromosomal those row merging in the optimum chromosome; The overall flow of genetic algorithm is as follows:

Step 3.4.2.5.1: set population scale Y and maximum iteration time Q, with current iteration number of times q=0;

Step 3.4.2.5.2: the initialization population, as current population P _Now, be worth the highest chromosome as current optimum chromosome C with wherein suitable _Best

Step 3.4.2.5.3: to P _NowIn chromosome select, make a variation and intersect to produce new population, in the process that produces new population, use union operation to generate the more excellent chromosome C in this generation _Better, with new population as current population, with the more excellent chromosome C in this generation _BetterWith current optimum chromosome C _BestCarry out union operation, q=q+1;

Step 3.4.2.5.4: if q＜Q forwards step 3.4.2.5.3 to; Otherwise, output C _BestAs separating of problem, algorithm finishes.

Grid resource scheduling method of the present invention is mainly used in the grid resource scheduling platform, by the demand of gridding resource both parties being obtained and being coordinated, distribute by carry out resource supply and demand based on the mode of the auction mechanism of upwards offering simultaneously, finally form the scheduling of resource timetable for grid resource scheduling platform actual schedule.Grid resource scheduling of the present invention once contrasted as the grid resource scheduling method of finding the solution the auction mechanism that wins the mark affirmation with branch-and-bound method in specific implementation process.Suppose that the buyer is positioned between [5,200] for the demand of storage capacity, wherein the ratio that demand is positioned at [5,50] and demand is positioned at buyer's number of [50,200] is 1: 1, and the unit of demand is GB/.Each seller provides the ability of 500GB/, and its reserve price is positioned between [30,35], the unit of value be the unit/(year * GB).Use even distribution to produce the buyer and the seller's primary data at random, win the comparison of marking the auction mechanism of confirming by grid resource scheduling method of the present invention with branch-and-bound method as finding the solution, found that grid resource scheduling method of the present invention all shows good at aspects such as improving grid resource allocation efficient, the maximization of resource provider interests.

Claims (1)

1. grid resource scheduling method based on the auction mechanism of upwards offering simultaneously is characterized in that: upwards the asked price auction is set to regularly hold simultaneously, and once auction is divided into preparatory stage, screening phase and auction phase, comprises the steps:

Step 1, preparatory stage: the trust and the announcement stage of finishing traditional auction;

Auction platform is accepted all sellers' trust on a specified date, writes down and add up ability supply and reserve price that each seller submits to; The announcement stage openly specifically the auction in each seller the ability supply and the screening phase concluding time;

Step 2, screening phase: when the buyer who takes part in auction is too much, auction platform need filter out that part of buyer that most probable is won, and it is long and total business volume increases few situation to prevent submit a tender duration of causing auction of the too much buyer to eliminate other participants;

In the screening phase, the bidder is carried out authentication, registration, after the bank freezing guaranty money, carry out taking turns screening process on the net; Each buyer can only throw a deutero-albumose in the screening phase, indicates ability need and bid in the target, need not indicate in this target towards supplier sign; Suppose that it is the right that l times the overall supplies and the highest that part of buyer that bids continue to submit a tender that auction platform keeps aggregate demand, the screening process that auction platform carries out after the screening phase expires is as follows:

Step 2.1: the overall supplies Tspc that counts all sellers, descending according to the ability quotation Bup of buyer unit rearranges buyer's target, ascending order according to Rc when Bup is identical is arranged, the aggregate demand that variable Td represents current buyer's set is set, buyer's target number that on behalf of inspected, n cross, the initial value of Td is made as 0, and the initial value of n is made as 1;

Step 2.2: from buyer's formation, duplicate n buyer's target information, suppose that this target demand is Rc _n, Td=Td+Rc _n, use variable Srp to write down this buyer's quotation per unit;

Step 2.3: if Td 〉=l * Tspc or n during greater than the target number in buyer's formation, forward step 2.4 to; Otherwise n=n+1 forwards step 2.2 to;

Step 2.4: n the buyer's bid power before keeping in the formation of buyer's target, notify other buyeies to withdraw from auction;

Step 3, auction phase: finish operation and accounts settling phase in the traditional auction;

Use the turn-based auction process, the flow process of each bout is as follows:

Step 3.1:, calculate the price Sup=max (Rup that starts auction of seller j according to start auction reference price and each seller's reservation price _j, Srp), determine the initial duration T of each bout auction _Ori, snipe supervision time T _CheckWith snipe time expand T _MoreIf (apart from the T before this bout End of Auction _CheckAuction platform is received target in time, then thinks " sniping " phenomenon has taken place, with the duration prolongation T of this bout _More);

Step 3.2: timer is set, makes it through T _OriTrigger;

Step 3.3: platform receives buyer's target, and buyer's target according to seller's difference of investing, is used the descending sort of different target formations according to the ability quotation Bup of unit;

Step 3.4: timer is to after date, and whether the time of arrival of checking last target is at the current T of distance _CheckTime range in, if time of arrival in this scope, then timer is set to through T _MoreTrigger the back, and flow process turns to step 3.3; If not in this scope, check whether this bout receives new target time of arrival, if receive new target, win mark and confirm, announce the set of triumph target to each buyer, flow process turns to step 3.2; If do not receive new target at this bout, the auction phase finishes, and notifies each the buyer auction result and settles accounts;

It is as follows wherein to win the mark confirmation method:

Step 3.4.1 wins the mathematical model that mark is confirmed

Each seller will determine and announce victor's set of this bout according to buyer's target that this bout is received in every bout; Suppose seller pid _jReceive m buyer's target at the k bout, this m buyer is respectively bid _J1, bid _J2Λ, bid _Jm, establish buyer bid _JiWhether that wins is designated x _Ji, then the mathematical model of the victory of this auction mechanism mark affirmation problem is:

$\mathrm{Maximize}:\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Bup}}_{\mathrm{ji}}\×{\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})$

s.t. x _ji∈{0，1}

$\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j---\left(3.1\right)$

Step 3.4.2 makes amendment to traditional genetic algorithm and is used for finding the solution the victory mark affirmation problem of each seller's correspondence, and its step is as follows:

Step 3.4.2.1 chromosome coding

Use the two-dimensional variable length structure of arrays, wherein on behalf of a seller's victory mark, each row confirm result, the every i column element x during j is capable _JiWhether representative wins to i the buyer that this seller j submits a tender; Element value uses the 0-1 coding, and on behalf of this buyer, 1 win, and 0 representative is not won;

Step 3.4.2.2 initialization population

After setting population scale, produce each chromosome successively; When determining the element value of each row, need to guarantee $\underset{1\≤i\≤m}{\mathrm{\Σ}}({\mathrm{Rpc}}_{\mathrm{ji}}\×x_{\mathrm{ji}})\≤{\mathrm{Spc}}_j;$

The step 3.4.2.3 value function that suits

The transaction value sum of selecting each seller for use as just when;

Step 3.4.2.4 selects, intersects, makes a variation

Step 3.4.2.4.1 selection operation uses the roulette back-and-forth method in the traditional genetic algorithm:

Step 3.4.2.4.2 interlace operation be will be correlated with successively chromosomal each the row in element carry out uniform crossover operator; Some row in the chromosome that the process interlace operation obtains may not satisfy

Make with the following method this row is revised: each element during from left to right traversal is gone successively, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.4.3 mutation operation is to be unit with the element in the row, and whether each element that calculates successively in this row by the variation probability morphs, when element morphs with this element value step-by-step negate; During concrete operations, from left to right successively each element in the row is carried out mutation operation, and the accumulative total element value is each buyer's purchase volume of 1; If outright purchase exceeds seller's supply after adding the current buyer's purchase volume, then this element value is set to 0;

Step 3.4.2.5 union operation and algorithm flow

Through intersection and chromosome that variation obtains in certain several seller may appear and transaction value be higher than current optimum chromosome, use this moment union operation that optimum chromosome and selected chromosome are carried out line by line relatively and will be better than optimum chromosomal those row merging in the optimum chromosome; The overall flow of genetic algorithm is as follows:

Step 3.4.2.5.1: set population scale Y and maximum iteration time Q, with current iteration number of times q=0;

Step 3.4.2.5.2: the initialization population, as current population P _Now, be worth the highest chromosome as current optimum chromosome C with wherein suitable _Best

Step 3.4.2.5.3: to P _NowIn chromosome select, make a variation and intersect to produce new population, in the process that produces new population, use union operation to generate the more excellent chromosome C in this generation _Better, with new population as current population, with the more excellent chromosome C in this generation _BetterWith current optimum chromosome C _BestCarry out union operation, q=q+1;

Step 3.4.2.5.4: if q＜Q forwards step 3.4.2.5.3 to; Otherwise, output C _BestAs separating of problem, algorithm finishes.

Images