Skip to Main content Skip to Navigation
Journal articles

A memetic algorithm for the optimal winner determination problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-amu.archives-ouvertes.fr/hal-01479563
Contributor : William Domingues Vinhas Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 8:39:18 PM
Last modification on : Friday, August 5, 2022 - 2:54:44 PM

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Links full text

Identifiers

Citation

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

Share

Metrics

Record views

80