A New Hybrid Algorithm to Solve Winner Determination Problem in Multiunit Double Internet Auction

Algorithm 1

AUC-GAPSO algorithm.

Input:

population size:

Maximum number of generations:

Buyers input:

Sellers input:

Output:

Interesting Winners:

Algorithm:

(1) Initialize = 0 and CountPg = 0

(2) Find possible matches from and

(3) Generate population of size

(4) For each chromosome

 (4.1) Generate winners from chromosome

 (4.2) Calculate fitness of winners

 (4.3) Initialize , , Pi, Pg

(5) OldPg = Pg

(6) For each chromosome and

 (6.1) Select the best chromosomes to be copied into Pn

 (6.2) Mutate and crossover chromosome with

 (6.3) Add reproduced chromosome to Pn

 (6.4) Generate winners from reproduced chromosome

 (6.5) Calculate fitness of winners

 (6.6) Update , , Pi, Pg

(7) If OldPg = Pg then

    CountPg ++

   Else

    CountPg = 0

(8) ++

(9) If (( > ) or (CountPg > ())) then

   get the fittest chromosome from

    =

   Stop algorithm

   Else

   Go to Step (4)