Abstract
The crucial idea behind DE is the scheme of generating mutant vectors using the weighted difference of other vectors randomly chosen from the population. This mutation operation relies on arithmetic operations (add, subtract, multiply, etc.) rather than general data manipulation operations (sort, swap, permute, etc.). It cannot be directly extended to the discrete combinatorial space.
In this chapter, we apply parameter adaptive differential evolution to a seminal combinatorial optimization problem of winner determination in Combinatorial Auctions (CAs). To adapt JADE to this problem, we use a rank-based representation scheme that produces only feasible solutions and a regeneration operation that constricts the search space. It is shown that JADE compares favorably to the classic DE algorithm, a local stochastic search algorithm Casanova, and a genetic algorithm based approach SGA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zhang, J., Sanderson, A.C. (2009). Application to Winner Determination Problems in Combinatorial Auctions. In: Adaptive Differential Evolution. Adaptation Learning and Optimization, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01527-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-01527-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01526-7
Online ISBN: 978-3-642-01527-4
eBook Packages: EngineeringEngineering (R0)