Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective
Abstract
The procurement of transportation services is an important task for shippers because of the need to control costs while providing high service levels. When shippers need to transport goods and materials, they seek transportation services from outside companies and typically issue a request for quotes from a group of carriers. The shippers then assign contracts on the basis of negotiated service charges. This process is similar to a simple sealed-bid auction in which each bidder submits a sealed bid for a single item. In the past, when shippers needed to procure transportation services for a set of distinctive delivery routes (called lanes), they would obtain quotes for each lane individually and repeat the simple auction process for each lane. Alternatively, they might negotiate for bundles of lanes with a single carrier at a time. However, in the last several years, software has been developed to enable shippers to make all lanes available for bidding simultaneously and to enable carriers to simultaneously bid on combinations of individual lanes. This method of awarding contracts, conventionally called a combinatorial auction, has resulted in significant cost savings for shippers. This research examines the benefits of combinatorial auctions primarily from the carrier's perspective. On the basis of a simple simulation model, preliminary findings suggest that carrier benefits can also be significant.
Get full access to this article
View all access and purchase options for this article.
References
1. Ledyard J., Olson M., Porter D., Swanson J., and Torma D. First Use of a Combined Value Auction for Transportation Services. Interfaces, 2002 (in press).
2. de Vries S., and Vohra R. V. Combinatorial Auction: A Survey. INFORMS Journal on Computing, 2001 (in preparation).
3. Caplice C. An Optimization-Based Bidding Process: A New Framework for Shipper-Carrier Relationship. Ph.D. dissertation. Massachusetts Institute of Technology, Cambridge, Mass. 1996.
4. Song J., and Regan A. C. Transition or Transformation? Emerging Freight Transportation Intermediaries. Transportation Research Record: Journal of the Transportation Research Board 1763, TRB, National Research Council, Washington, D.C., 2001, pp. 1–5.
5. Bykowsky M. M., Cull J., and Ledyard J. O. Mutually Destructive Bidding: The FCC Design Problem. Journal of Regulatory Economics, Vol. 3, No. 3, 2000, pp. 205–228.
6. Federal Communications Commission. Auctions wireless.fcc.gov/auctions/31/.
7. Banks J. S., Ledyard J. O., and Porter D. P. Allocating Uncertain and Unresponsive Resources: An Experimental Approach. Rand Journal of Economics, Vol. 20, No. 1, 1989, pp. 1–25.
8. Rassenti S. J., Smith V. L., and Bulfin R. L. A Combinatorial Auction Mechanism for Airport Time Slot Allocation. Bell Journal of Economics, Vol. 13, 1982, pp. 402–417.
9. Kelly F., and Steinberg R. A Combinatorial Auction with Multiple Winners for Universal Service. Management Science, Vol. 46, No. 5, 2000, pp. 586–596.
10. Business Case: Saving Money for Volvo with a Combinatorial Auction. www.tradeextensions.com/press/volvoPackCase.html.
11. DeMartini C., Kwasnica A. M., Ledyard J. O., and Porter D. A New and Improved Design for Multi-Object Iterative Auctions. Social Science Working Paper No. 1054. California Institute of Technology, Pasadena, 1999.
12. Nisan N. Bidding and Allocation in Combinatorial Auctions. Presented at 2nd ACM Conference on Electronic Commerce, Association of Computing Machinery, Minneapolis, Minn., Oct. 17-20, 2000.
13. Rothkopf M., Pekec A., and Harstad R. M. Computationally Manageable Combinational Auctions. Management Science, Vol. 44, No. 8, 1998, pp. 1131–1147.
14. Leyton-Brown K., Shoham Y., and Tennenholtz M. An Algorithm for Multi-Unit Combinatorial Auctions. Presented at 17th National Conference on Artificial Intelligence, Austin, Tex., July 30–Aug. 3, 2000.
15. Gonen R., and Lehmann D. Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. Presented at 2nd ACM Conference on Electronic Commerce Minneapolis, Minn., Oct. 17-20, 2000.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published: January 2003
Issue published: January 2003
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 109
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 88
- A benders decomposition algorithm for a bid generation problem in the ...
- Designing mechanisms for crowdsourced urban parcel delivery
- Research on truckload transportation procurement: A review, framework,...
- Combinatorial-Based Auction For The Transportation Procurement: An Opt...
- Transportation Service Procurement Auctions in Cyber-Physical Internet
- An exact method for the combinatorial bids generation problem with unc...
- Last-mile drone delivery combinatorial double auction model using mult...
- A Bid Generation Problem in Truckload Transportation Service Procureme...
- Crowd logistics: Understanding auction-based pricing and couriers’ str...
- Combinatorial versus sequential auctions to allocate PPP highway proje...
- Pricing Dynamics in the Truckload Sector: The Moderating Role of the E...
- Exact and hybrid heuristic methods to solve the combinatorial bid cons...
- An efficient bidding heuristic for simultaneous truckload transportati...
- Rule-based incentive mechanism design for a decentralised collaborativ...
- Combinatorial Auction for Truckload Transportation Service Procurement...
- A bid generation problem for combinatorial transportation auctions con...
- COMBIMA: truthful, budget maintaining, dynamic combinatorial market
- Winner determination problem in multiple automated guided vehicle cons...
- A profit-maximization heuristic for combinatorial bid construction wit...
- A multi-round exchange mechanism for carrier collaboration in less tha...
- Exact and heuristic solution approaches for the bid construction probl...
- Freight transportation service procurement: A literature review and fu...
- A bi-level programming for transportation services procurement based o...
- Price optimization for transportation service procurement with fuzzy r...
- Operational flexibility in the truckload trucking industry
- Sourcing truckload capacity in the transportation spot market: A frame...
- Making the most of fleets: A profit-maximizing multi-vehicle pickup an...
- Influence of non-price and environmental sustainability factors on tru...
- Achieving Economic and Environmental Sustainabilities in Urban Consoli...
- Pricing and Segmentation of Stochastic Demand in Less-Than-Truckload C...
- Optimization of Container Multimodal Transport Service Based on Segmen...
- Auction-based transportation procurement in make-to-order systems
- Review of Full Truckload Transportation Service Procurement
- Demand clustering in freight logistics networks
- Combinatorial auctions of railway track capacity in vertically separat...
- A product bundle determination model for multi-product supplier select...
- Bid price optimization for truckload carriers in simultaneous transpor...
- A strategic approach to improve sustainability in transportation servi...
- A Rolling Horizon Auction Mechanism and Virtual Pricing of Shipping Ca...
- Goal Orientation and Preparation Process in Online Reverse Auctions:
- A supplier pre-selection model for multiple products with synergy effe...
- The stochastic bid generation problem in combinatorial transportation ...
- A Sampling-Based Stochastic Winner Determination Model for Truckload S...
- Mechanism design for enterprise transportation outsourcing based on co...
- Optimal auctions for transportation service procurement in an infinite...
- Predictive Analytics to Improve Pricing and Sourcing in Third-Party Lo...
- The Role of Collaborative Procurement of Transportation Services in Im...
- Dedicated Transportation Subnetworks: Design, Analysis, and Insights
- Benefits of in-vehicle consolidation in less than truckload freight tr...
- Choice of item pricing feedback schemes for multiple unit reverse comb...
- Transportation service procurement in periodic sealed double auctions ...
- Benefits of in-Vehicle Consolidation in Less than Truckload Freight Tr...
- Shipper/Carrier Interactions Data Collection: Web-Based Respondent Cus...
- Truthful multi-unit transportation procurement auctions for logistics ...
- The freight allocation problem with lane cost balancing constraint
- Rearch on Winning Decision’s Optimizing Algorithm for Combinatorial Bi...
- Evaluation of Distance-Based and Cordon-Based Urban Freight Road Prici...
- Dedicated Transportation Subnetworks: Design, Analysis, and Insights
- Oil product transportation with combinatorial auctions
- A transportation service procurement problem with combinatorial auctio...
- Lane-Exchange Mechanisms for Truckload Carrier Collaboration
- Supply Chain Broker Operations: Network Perspective
- Auctions and bidding
- Auctions and bidding: A guide for computer scientists
- Shipper And Carrier Collaboration
- GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination...
- Tâtonnement Mechanisms for Combinatorial Exchanges
- Solving a bi-objective winner determination problem in a transportatio...
- An iterative auction mechanism for combinatorial exchanges
- Look-ahead strategies for dynamic pickup and delivery problems
- A stochastic programming winner determination model for truckload proc...
- Intelligent freight-transportation systems: Assessment and the contrib...
- Solving Truckload Procurement Auctions Over an Exponential Number of B...
- Approximately Efficient Iterative Mechanisms for Combinatorial Exchang...
- Dynamic threshold policy for delaying and breaking commitments in tran...
- A Computational Analysis of Linear Price Iterative Combinatorial Aucti...
- Collaboration in Cargo Transportation
- Modeling the Pre Auction Stage The Truckload Case
- Transportation Procurement with Seasonally Varying Shipper Demand and ...
- The lane covering problem with time windows
- Real time simulation of auctioning and re-scheduling processes in hybr...
- Reducing Truckload Transportation Costs Through Collaboration
- A carrier’s optimal bid generation problem in combinatorial auctions f...
- Simplified Bidding and Solution Methodology for Truckload Procurement ...
- Approximation algorithms for the bid construction problem in combinato...
- Iterative Combinatorial Auctions with Bidder-Determined Combinations
- Combinatorial Bid Generation Problem for Transportation Service Procur...
- Ein Pareto-Optimierungsverfahren für ein mehrkriterielles Gewinnerermi...
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
