Abstract
Freight business is a huge market with strong competition. In many companies, planning and routing software has been introduced, and optimization potentials have been widely exploited. To further improve efficiency, especially the small and medium sized carriers have to cooperate beyond enterprise boundaries. A promising approach to exchange transportation requests between freight carriers is provided by combinatorial auctions and exchanges. They allow bundles of items to be traded, thereby allowing participants to express complex synergies.
In this paper we discuss various goals for a combinatorial request exchange in freight logistics and provide the reasoning for our design decisions. All goals aim to improve usefulness in a practical environment of less-than-truckload (LTL) carriers. We provide experimental results for both generated and real-life data that show significant savings and are often close to a heuristic solution for the global optimization problem. We study how bundling and restricting the number of submitted bids affect the solution quality.
Part of this work was funded by Stiftung Rheinland-Pfalz für Innovation research grant 961 - 386261/864.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abrache, J., Crainic, T., Gendreau, M., Rekik, M.: Combinatorial auctions. Annals of Operations Research 153(1), 131–164 (2007)
Ackermann, H., Ewe, H., Küfer, K.H., Schröder, M.: Modeling profit sharing in combinatorial exchanges by network flows. Tech. Rep. 205, Fraunhofer Institute for Industrial Mathematics (2011), http://www.itwm.fraunhofer.de/en/press-and-media/reports-of-the-itwm.html
An, N., Elmaghraby, W., Keskinocak, P.: Bidding strategies and their impact on revenues in combinatorial auctions. Journal of Revenue and Pricing Management 3(4), 337–357 (2005)
Clarke, E.H.: Multipart pricing of public goods. Publ. Choice 18, 19 (1971)
Conen, W., Sandholm, T.: Preference elicitation in combinatorial auctions. In: EC 2001: Proceedings of the 3rd ACM conference on Electronic Commerce, pp. 256–259. ACM, New York (2001)
Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)
Day, R.W.: Expressing preferences with price-vector agents in combinatorial auctions. Ph.D. thesis, University of Maryland (2004)
DSLV Deutscher Speditions- und Logistikverband e.V.: Zahlen, Daten, Fakten aus Spedition und Logistik (May 2010)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (January 1979)
Goossens, D., Spieksma, F.: The matrix bid auction: micro-economic properties and expressiveness. Tech. Rep. urn:hdl:123456789/120980, Katholieke Universiteit Leuven (2006), http://ideas.repec.org/p/ner/leuven/urnhdl123456789-120980.html
Groves, T.: Incentives in teams. Econometrica 41(4), 617–631 (1973)
Gujo, O., Schwind, M., Vykoukal, J., Weiß, K., Stockheim, T., Wendt, O.: ComEx: Kombinatorische Auktionen zum innerbetrieblichen Austausch von Logistikdienstleistungen. Wirtschaftsinformatik (1), 201–218 (2007)
Hsieh, F.S.: Combinatorial reverse auction based on revelation of lagrangian multipliers. Decision Support Systems 48(2), 323–330 (2010)
Krajewska, M.A., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectrum 28(3), 301–317 (2006)
Lee, C.G., Kwon, R.H., Ma, Z.: A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transportation Research Part E: Logistics and Transportation Review 43(2), 173–191 (2007)
Moulin, H.: Fair division and collective welfare. MIT Press, Cambr (2003)
Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. Journal of Economic Theory 29(2), 265–281 (1983)
Nisan, N.: Bidding and allocation in combinatorial auctions. ACM Conference on Electronic Commerce, 1–12 (2000)
Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)
Pan, M., Chen, F., Yin, X., Fang, Y.: Fair profit allocation in the spectrum auction using the Shapley value. In: Proc. of the 28th IEEE Conf. GLOBECOM 2009, pp. 4028–4033. IEEE Press, USA (2009)
Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving budget-balance with vickrey-based payment schemes in combinatorial exchanges. Tech. rep., IBM Research Report RC 22218 (2001); updated (March 2002)
Plummer, C.L.: Bidder Response to Combinatorial Auctions in Truckload Procurement. Master’s thesis, Massachusetts Institute of Technology (2003)
Rassenti, S.: 0-1 Decision Problems with Multiple Resource Constraints: Algorithms and Applications. Ph.D. thesis, University of Arizona (1981)
Schwind, M., Gujo, O., Vykoukal, J.: A combinatorial intra-enterprise exchange for logistics services. Inf. Syst. E-Business Mngmnt. 7(4), 447–471 (2009)
Shapley, L.S.: A value for n-person games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II, Annals of Mathematical Studies, vol. 28, pp. 307–317. Princeton University Press, Princeton (1953)
Tsung-Sheng, C.: Decision support for truckload carriers in one-shot combinatorial auctions. Transport. Research Part B: Methodological 43(5), 522–541 (2009)
Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance 16(1), 8–37 (1961)
de Vries, S., Vohra, R.V.: Combinatorial auctions. INFORMS J. Comput. 15(3), 284–309 (2003)
Wang, X., Xia, M.: Combinatorial bid generation problem for transportation service procurement. Transportation Research Record: Journal of the Transportation Research Board (1923), 189–198 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ackermann, H., Ewe, H., Kopfer, H., Küfer, KH. (2011). Combinatorial Auctions in Freight Logistics. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-24264-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24263-2
Online ISBN: 978-3-642-24264-9
eBook Packages: Computer ScienceComputer Science (R0)