A new primal-dual genetic algorithm: case study for the winner determination problem

Authors:
Madalina Raschip;Cornelius Croitoru
Affiliations:
“Al.I.Cuza” University of Iasi, Romania;“Al.I.Cuza” University of Iasi, Romania
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 18
Cited 1

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
An efficient approximate allocation algorithm for combinatorial auctions

Proceedings of the 3rd ACM conference on Electronic Commerce
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
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
PDGA: the primal-dual genetic algorithm

Design and application of hybrid intelligent systems
Heuristics for a bidding problem

Computers and Operations Research
A New and Improved Design for Multiobject Iterative Auctions

Management Science
Analysis of greedy heuristics and weight-coded eas for multidimensional knapsack problems and multi-unit combinatorial auctions

Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
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
Greedy approximation via duality for packing, combinatorial auctions and routing

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

A genetic algorithm hybridized with the discrete lagrangian method for trap escaping

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new evolutionary computing strategy which uses the linear programming duality information to help the search for optimum solutions of hard optimization problems. The algorithm is restarted several times when it is stuck into a local optima. At each restart, the appropriate dual space is constructed. A new population of primal individuals is generated using the information from dual solutions and is considered for next iterations. The pursued goal was not to find the best algorithm for solving winner determination problem, but to prove the method's viability using the problem as a case study. Experiments on realistic instances were performed.