Computationally Manageable Combinational Auctions
Management Science
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Genetic Algorithms for Tracking Changing Environments
Proceedings of the 5th International Conference on Genetic Algorithms
Restart Scheduling for Genetic Algorithms
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Optimization Using Distributed Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
Heuristics for a bidding problem
Computers and Operations Research
Proceedings of the 9th annual conference on Genetic and evolutionary computation
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
INFORMS Journal on Computing
A memetic algorithm for the optimal winner determination problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Emerging Trends in Soft Computing - Memetic Algorithms; Guest Editors: Yew-Soon Ong, Meng-Hiot Lim, Ferrante Neri, Hisao Ishibuchi
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
A unified view on hybrid metaheuristics
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
A new primal-dual genetic algorithm: case study for the winner determination problem
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
This paper introduces a genetic algorithm enhanced with a trap escaping strategy derived from the dual information presented as discrete Lagrange multipliers. When the genetic algorithm is trapped into a local optima, the Discrete Lagrange Multiplier method is called for the best individual found. The information provided by the Lagrangian method is unified, in the form of recombination, with the one from the last population of the genetic algorithm. Then the genetic algorithm is restarted with this new improved configuration. The proposed algorithm is tested on the winner determination problem. Experiments are conducted using instances generated with the combinatorial auction test suite system. The results show that the method is viable.