A memetic algorithm for the optimal winner determination problem - Aix-Marseille Université Accéder directement au contenu
Article Dans Une Revue Soft Computing Année : 2009

A memetic algorithm for the optimal winner determination problem

Résumé

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.
Fichier principal
Vignette du fichier
Boughaci2008.pdf (126.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01479563 , version 1 (12-01-2022)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

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⟩
90 Consultations
32 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More