A memetic algorithm for the optimal winner determination problem

被引：29
|
作者：
Boughaci, Dalila [1 ,2 ]
Benhamou, Belaid [1 ]
Drias, Habiba [2 ]
机构：
[1] INCA LSIS, F-13013 Marseille, France
[2] LRIA USTHB, Algiers 16111, Algeria
来源：
SOFT COMPUTING | 2009年 / 13卷 / 8-9期
关键词：
AUCTIONS;
D O I：
10.1007/s00500-008-0355-3
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：905 / 917
页数：13
相关论文
共 50 条
  • [1] A memetic algorithm for the optimal winner determination problem
    Dalila Boughaci
    Belaïd Benhamou
    Habiba Drias
    Soft Computing, 2009, 13 : 905 - 917
  • [2] Algorithm for optimal winner determination in combinatorial auctions
    Sandholm, T
    ARTIFICIAL INTELLIGENCE, 2002, 135 (1-2) : 1 - 54
  • [3] An algorithm for optimal winner determination in combinatorial auctions
    Sandholm, T
    IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 542 - 547
  • [4] Iterated algorithm for the optimal winner determination in combined negotiations
    Aknine, S
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 949 - 950
  • [5] A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
    Anton V. Eremeev
    Yulia V. Kovalenko
    Memetic Computing, 2020, 12 : 23 - 36
  • [6] A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
    Eremeev, Anton, V
    Kovalenko, Yulia, V
    MEMETIC COMPUTING, 2020, 12 (01) : 23 - 36
  • [7] A hybrid ant colony algorithm for the winner determination problem
    Wu, Jun
    Fan, Mingjie
    Liu, Yang
    Zhou, Yupeng
    Yang, Nan
    Yin, Minghao
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (03) : 3202 - 3222
  • [8] Solving the Winner Determination Problem by a Distributed Genetic Algorithm
    Kristensen, Terje
    Rojas, Mauricio Enrique Mena
    2012 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE FOR FINANCIAL ENGINEERING & ECONOMICS (CIFER), 2012, : 405 - 412
  • [9] A Genetic Algorithm for the Winner Determination Problem in Combinatorial Auctions
    Uzunbayir, Serhat
    2018 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2018, : 127 - 132
  • [10] Hybrid Algorithm for Winner Determination Problem in Combinatorial Auctions
    Chen, Li
    Chen, Xiaoyun
    Hu, Shanli
    Lin, Yunguo
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 645 - +
12345