A hybrid binary harmony search algorithm for solving the winner determination problem Online publication date: Sat, 29-Jun-2019
by Geng Lin; Zuoyong Li
International Journal of Innovative Computing and Applications (IJICA), Vol. 10, No. 1, 2019
Abstract: The winner determination problem (WDP) in combinatorial auctions is to determine an allocation of items to bidders such that each item is allocated to at most one bidder, and the auctioneer's revenue is maximised. This paper proposes a hybrid binary harmony search algorithm for the WDP. Firstly, to enhance the global search ability of the proposed algorithm, a modified harmony improvisation mechanism is developed with a modified memory consideration rule and an adaptive pitch adjustment scheme. Next, a repair operator is employed to guarantee the feasibility of the new candidate harmonies. Finally, a tabu search procedure is presented to improve the local search ability. These strategies make a good balance between intensification and diversification. In the experiments, the performance of the proposed algorithm is validated on five groups of 500 instances. Experimental results and comparisons show that the proposed algorithm is very efficient, and the tabu search procedure significantly improves the performance of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook