A memetic algorithm for the optimal winner determination problem

Dalila Boughaci (1, 2) , Belaïd Benhamou (1) , Drias Habiba (2)

1 LSIS - Laboratoire des Sciences de l'Information et des Systèmes
2 LRIA - Laboratoire de Recherche en Intelligence Artificielle [Alger]

In this paper, we propose a memetic algorithm for the optimal winner determination problem in combinatorial auctions. First, we investigate a new selection strategy based on both fitness and diversity to choose individuals to participate in the reproduction phase of the memetic algorithm. The resulting algorithm is enhanced by using a stochastic local search (SLS) component combined with a specific crossover operator. This operator is used to identify promising search regions while the stochastic local search performs an intensified search of solutions around these regions. Experiments on various realistic instances of the considered problem are performed to show and compare the effectiveness of our approach.

Domains: Computer Science [cs]

Dalila Boughaci, Belaïd Benhamou, Drias Habiba. A memetic algorithm for the optimal winner determination problem. Soft Computing, 2009, 13, pp.905-917. ⟨10.1007/s00500-008-0355-3⟩. ⟨hal-01479563⟩