Computationally Manageable Combinational Auctions
Management Science
Permutation-based evolutionary algorithms for multidimensional knapsack problems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
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
Combinatorial auctions for supply chain formation
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
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
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
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
A comparison of messy GA and permutation based GA for job shop scheduling
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Heuristics for a bidding problem
Computers and Operations Research
Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.01 |
The paper presents a study on the application of messy genetic algorithms for the winner determination problem in the combinatorial auction realm. Messy genetic algorithms operate explicitly on building blocks in order to obtain good solutions. Since the winner determination is a constrained problem, the Ordering Messy Genetic Algorithm is used in order to preserve the validity of chromosomes. Experiments on instances generated with the CATS system are presented to illustrate and compare the effectiveness of the approach. The approach is compared against a simple genetic algorithm, which is a random-key genetic algorithm. Other well-known algorithms from literature are used in experiments. Conclusions are drawn on the advantages of using a messy genetic algorithm for this problem.