winner determination in combinatorial auctions using hybrid ant colony optimization and multi-neighborhood local search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. the winner determination problem (wdp) in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under constraint, where each item can be allocated to at most one bidder. wdp is known as an np-hard problem with practical applications like electronic commerce, production management, games theory, and resource allocation in multi-agent systems. this has motivated the quest for efficient approximate algorithms in terms of both the solution quality and computational time. this paper proposes a hybrid ant colony optimization with a novel multi-neighborhood local search (aco-mnls) algorithm for solving wdp in combinatorial auctions. our proposed mnls algorithm uses the fact that using various neighborhoods in local search can generate different local optima for wdp and that the global optima of wdp is a local optima for a given neighborhood. therefore, the proposed mnls algorithm simultaneously explores a set of three different neighborhoods to get different local optima and to escape from the local optima. the comparisons between aco-mnls, genetic algorithm (ga), memetic algorithm (ma), stochastic local search (sls), and tabu search (ts) on various benchmark problems confirm the efficiency of the aco-mnls algorithm in terms of both the solution quality and computational time.