Solving truckload procurement auctions over an exponential number of bundles

Transportation Science

Volumn 43, Issue 4, 2009, Pages 493-510

  Chen, Richard Li Yang ^a   Beygi, Shervin Ahmad ^a   Cohn, Amy ^a   Beil, Damian R ^b   Sinha, Amitabh ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Combinatorial auctions; Implicit bidding approach; Network flows; Truckload procurement

Indexed keywords

NUMERICAL METHODS; SHIPS; TRUCKS;

COMBINATORIAL AUCTION; COMPUTATIONAL RESULTS; ECONOMIES OF SCOPE; EXPONENTIAL NUMBERS; IMPLICIT BIDDING APPROACH; NETWORK FLOWS; PROCUREMENT AUCTION; TRUCKLOAD PROCUREMENT;

COMMERCE;

EID: 73349135642     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0273     Document Type: Article

References (50)

1. Abrache, J., B. Bourbeau, T. G. Crainic, M. Gendreau. 2004. A new bidding framework for combinatorial e-auctions. Comput. Oper. Res. 31(8) 1177-1204.
2. Ahuja, R., T. Magnanti, J. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
3. American Trucking Association. 2007. U.S. Freight Transportation Forecast to 2017, Arlington, VA.
4. Aviv, Y. 2004. Collaborative forecasting and its impact on supply chain performance. D. Simchi-Levi, S. D. Wu, Z.-J. Shen, eds. Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. Springer Science & Business Media, Inc., New York.
5. Balas, E., M. Padberg. 1976. Set partitioning: A survey. SIAM Rev. 18(4) 710-760.
6. Ballou, R. H. 1992. Business Logistics Management. Prentice Hall, Inc. Englewood Cliffs, NJ.
7. Banks, J., J. Ledyard, D. Porter. 1989. Allocating uncertain and unresponsive resources: An experimental approach. RAND J. Econom. 20(1) 1-25.
8. Bykowsky, M., R. Cull, J. Ledyard. 2000. Mutually destructive bidding: The FCC auction design problem. J. Regulatory Econom. 17(3) 205-228.
9. Caplice, C., Y. Sheffi. 2003. Optimization based-procurement for transportation services. J. Bus. Logist. 24(2) 109-128.
10. Caplice, C., Y. Sheffi. 2006. Combinatorial auctions for truckload transportation. P. Cramton, R. Steinberg, Y. Shoham, eds. Combinatorial Auctions. MIT Press, Cambridge, MA.
11. Chang, T. 2009. Decision support for truckload carriers in one-shot combinatorial auctions. Transportation Res. Part B 43(5) 522-541.
12. Chopra, S., P. Meindl. 2007. Supply Chain Management: Strategy, Planning and Operation. Prentice Hall of India, New Dehli, India.
13. Cohn, A. 2009. Parameter files. http://www-personal.umich.edu/∼ amycohn/papers.html.
14. Costello, B. 2003. Motor carrier update. Technical report, NASEOSummer Transportation Fuels Outlook Conference, Washington, DC.
15. Cramton, P., R. Steinberg, Y. Shoham. 2006. Combinatorial Auctions. MIT Press, Cambridge, MA
16. de Vries, S., R. Vohra. 2003. Combinatorial auctions: A survey. INFORMS J. Comput. 15(3) 284-309.
17. Elmaghraby, W., P. Keskinocak. 2002. Combinatorial auctions in procurement. Technical report, The Logistics Institute, Georgia Institute of Technology, Atlanta.
18. Ergun, O., G. Kuyzu, M. Savelsbergh. 2007a. Reducing truckload transportation costs through collaboration. Transportation Sci. 41(2) 206-221.
19. Ergun, O., G. Kuyzu, M. Savelsbergh. 2007b. Shipper collaboration. Comput. Oper. Res. 341551-1560.
20. Even, S., A. Itai, A. Shamir. 1976. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4) 691-703.
21. Figliozzi, M., H. Mahmassani, P. Jaillet. 2006. Analysis and evaluation of incentive-compatible dynamic mechanisms for carrier collaboration. Transportation Res. Record 196634-40.
22. Figliozzi, M., H. Mahmassani, P. Jaillet. 2007. Pricing in dynamic vehicle routing problems. Transportation Sci. 41(3) 302-318.
23. Franklin, M., M. Reiter. 1996. The design and implementation of a secure auction service. IEEE Trans. Software Engrg. 22(5) 302-312.
24. Fujishima, Y., K. Leyton-Brown, Y. Shoham. 1999. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proc. Sixteenth Internat. Joint Conf. Artificial Intelligence, Stockholm. Morgan Kaufmann Publishers, San Francisco.
25. Foster, J., S. Strasser. 1991. Carrier/modal selection factors: The shipper/carrier paradox. Transportation Res. Forum 31206-212.
26. Günlük, O., L. Ladányi, S. de Vries. 2005. A branch-and-price algorithm and new test problems for spectrum auctions. Management Sci. 51(3) 391-406.
27. Guo, Y., A. Lim, B. Rodrigues, Y. Zhu. 2006. Carrier assignment models in transportation procurement. J. Oper. Res. Soc. 57(12) 1504-1510.
28. Houghtalen, L., O. Ergun, J. Sokol. 2008. Designing mechanisms for the management of carrier alliances. Working paper, Georgia Institute of Technology, Atlanta.
29. Kelly, F., R. Steinberg. 2000. A combinatorial auction with multiple winners for universal service. Management Sci. 46(4) 586-596.
30. Krajewska, M., H. Kopfer. 2006. Collaborating freight forwarding enterprises. OR Spectrum 28301-317.
31. Kudo, M. 1998. Secure electronic sealed-bid auction protocol with public key cryptography. IEICE Trans. Fundamentals Electronics Comm. Comput. Sci. E81-A(1) 20-27.
32. Ledyard, J., M. Olson, D. Porter, J. Swanson, D. Torma. 2002. The first use of a combined-value auction for transportation services. Interfaces 32(5) 4-12.
33. Lee, C.-G., R. H. Kwon, Z. Ma. 2007. A carrier's optimal bid generation problem in combinatorial auctions for transportation procurement. Transportation Res. Part E 43173-191.
34. Lucking-Reiley, D. 2000. Auctions on the Internet: What's being auctioned, and how? J. Indust. Econom. 48(3) 227-252.
35. Nemhauser, G., L. Wolsey. 1999. Integer and Combinatorial Optimization. John Wiley and Sons, New York.
36. Nisan, N. 2000. Bidding and allocation in combinatorial auctions. Proc. 2nd ACM Conf. Electronic Commerce, 2001, 1-12.
37. Nisan, N., I. Segal. 2006. The communication requirements of efficient allocations and supporting prices. J. Econom. Theory 129(2006) 192-224.
38. Pekec, A., M. Rothkopf. 2003. Combinatorial auction design. Management Sci. 49(11) 1485-1503.
39. Plummer, C. 2002. Bidder response to combinatorial auctions in truckload procurement. Master dissertation, Massachusetts Institute of Technology, Cambridge.
40. Raychaudhuri, S., D. Veeramani. 2006. Bidding strategies in multi- round combinatorial auctions for transportation services. Technical report, Department of Industrial Engineering, University of Wisconsin, Madison.
41. Ronen, A. 2006. Incentive compatibility in computationally feasible combinatorial auctions. P. Cramton, R. Steinberg, Y. Shoham, eds. Combinatorial Auctions. MIT Press, Cambridge, MA.
42. Rothkopf, M., A. Pekec, R. Harstad. 1998. Computationally manageable combinatorial auctions. Management Sci. 44(8) 1131-1147.
43. Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 1531-54.
44. Sandholm, T., S. Suri, D. Gilpin, D. Levine. 2005. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Sci. 51(3) 374-390.
45. Sheffi, Y. 2004. Combinatorial auctions in the procurement of transportation services. Interfaces 34(4) 245-252.
46. Song, J., A. Regan. 2003. An auction based-collaborative carrier network. Transportation Res. Record 43173-191.
47. Song, J., A. Regan. 2004. Combinatorial auctions for transportation service procurement: The carrier perspective. Transportation Res. Record 183340-46.
48. Song, J., A. Regan. 2005. Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation constracts. Transportation Res. Part B 39912-933.
49. Wang, X., M. Xia. 2005. Combinatorial bid generation problem for transportation service procurement. Transportation Res. Record 1923189-198.
50. Zurel, E., N. Nisan. 2001. An efficient approximate allocation algorithm for combinatorial auctions. Proc. 3rd ACM Conf. Electronic Commerce, ACM, New York.