Combinatorial Auctions with Transportation Cost
نویسندگان
چکیده
The ability to discover equilibrium prices efficiently makes auctions an effective way to trade goods. One of the recent trends in the development of auctions is combinatorial auctions. Combinatorial auctions allow the simultaneous sale of more than one item. In the existing literature, the factor of transportation cost has not been considered in combinatorial auctions. In this paper, we formulate the combinatorial double auction problem and propose an algorithm for finding approximate solutions. The algorithm is developed by applying the subgradient algorithm to iteratively adjust the shadow prices and proposing a heuristic algorithm for finding approximate solutions. A numerical example is used to illustrate the preliminary result.
منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کامل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...
متن کاملGRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions
The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper’s task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winne...
متن کاملSolving Truckload Procurement Auctions Over an Exponential Number of Bundles
Truckload carriers provide hundreds of $billions worth of services to shippers in the U.S. alone each year. Internet auctions provide these shippers with a fast, easy way to negotiate potential contracts with a large number of carriers. Combinatorial auctions have the added benefit of allowing multiple loads to be considered simultaneously in a single auction. This is important because it enabl...
متن کاملCombinatorial Auctions for Transportation Service Procurement: The Carrier Perspective
The procurement of transportation services is an important task for shippers because of the need to control costs at the same time as providing high service levels. When shippers with goods and/or materials to transport seek transportation services from outside companies they typically put out a request for quotes from a set of carriers. They then assign contracts based on negotiated service ch...
متن کامل