Selecting unique suppliers through winner determination in combinatorial reverse auction: scatter search algorithm
نویسندگان
چکیده
منابع مشابه
An improved Ant Colony Algorithm for Optimal Winner Determination Problem in Reverse Combinatorial Auction
Reverse Combinatorial auctions, that is, auctions where bidders can bid on the supply right of combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. A common model is formulated for optimal the winner determination problem of reverse combinatorial auction. A PRIM (P...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملInteger Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we (i) compare recent algorithms fo...
متن کاملA Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
The bi-objective winner determination problem (2WDP-SC) of a combinatorial procurement auction for transport contracts is characterized by a set B of bundle bids, with each bundle bid b ∈ B consisting of a bidding carrier cb, a bid price pb, and a set τb of transport contracts which is a subset of the set T of tendered transport contracts. Additionally, the transport quality qt,cb is given whic...
متن کامل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 WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2017
ISSN: 2345-3605
DOI: 10.24200/sci.2017.4394