Abstract
The exchange of cargo capacities is well established in the practice of logistics. However, there are few e-market places that consider the synergies that can be generated by finding the appropriate combination of lanes for different carriers. One way to do this is to employ combinatorial auctions that allow one to bid on bundles of lanes. This article describes the design, implementation, and analysis of a combinatorial intra-enterprise exchange for logistics services. The enterprise regarded here is organized in a profit center structure, while each center is able to release delivery contracts for outsourcing if the geographic location of a customer allows a reduced-cost delivery by another profit center in the neighborhood. Our combinatorial exchange ComEx uses the results of an integrated routing system DynaRoute for cost calculation in the in and outsourcing process. We focus on the comparison of two clustering mechanisms used to form bids in the auction.
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.
References
Bullnheimer, B., Hartl, R., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89, 319–328 (1999)
Caplice, C.: An Optimization Based Bidding Process: A New Framework for Shipper-Carrier Relationships. PhD thesis, MIT, Massachusetts (1996)
Caplice, C., Sheffi, Y.: Optimization-based procurement for transportation services. Journal of Business Logistics 24(2) (2003)
Elmaghraby, W., Keskinocak, P.: Combinatorial auctions in procurement. In: Harrison, T., Lee, H., Neale, J. (eds.) The Practice of Supply Chain Management: Where Theory and Application Converge, pp. 245–258. Springer, Berlin (2005)
Glover, F.: Future paths for integer programming and links to artificial intelligence. computers and Operations Research 13(5), 533–549 (1986)
Gomber, P., Schmidt, C., Weinhardt, C.: Auctions in electronic commerce: Efficiency versus computational tractability. In: Proceedings of the International Conference on Electronic Commerce 98, Seoul, Korea, pp. 43–48 (1999)
Gujo, O., Schwind, M., Vykoukal, J.: The Design of Incentives in a Combinatorial Exchange for Intra-Enterprise Logistic Services. In: IEEE Joint Conference on E-Commerce Technology and Enterprise Computing, E-Commerce and E-Services, Tokyo, Japan (2007)
Knaak, N., Kruse, S., Page, B.: An Agent-Based Simulation Tool for Modelling Sustainable Logistics Systems. In: Proceedings of the iEMSs Third Biennial Meeting: Summit on Environmental Modelling and Software. International Environmental Modelling and Software Society (2006)
Krajewska, M., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectrum 28(3), 301–436 (2006)
Li, H., Lim, A.: Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research 150, 115–127 (2003)
McMillan, J.: Why auction the spectrum? Telecommunications Policy 19, pp. 191–199 (1995)
Pankratz, G.: Analyse kombinatorischer Auktionen für ein Multi-Agentensystem zur Lösung des Groupage-Problems kooperierender Speditionen. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Wascher, G. (eds.) Operations Research Proceedings, pp. 443–448. Springer, Heidelberg (1999)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of the 2nd ACM Conference on Electronic Commerce (ACM EC 2000), pp. 1–12. ACM, Minneapolis (2000)
Regan, A., Song, J.: An auction based collaborative carrier network. Transportation Research Part E: Logistics and Transportation Review (2003)
Schwind, M.: Design of combinatorial auctions for allocation and procurement processes. In: 7th International IEEE Conference on E-Commerce Technology 2005, pp. 391-395. München, Germany (2005)
Schwind, M., Gujo, O.: An agent-based simulation environment for a combinatorial grid scheduler. Technical report, Institute of Information Systems, J. W. Goethe University. Frankfurt, Germany (2005)
Schwind, M., Weiss, K., Stockheim, T.: CAMeL - Eine Meta-Sprache für Kombinatorische Auktionen. Technical report, Institut für Wirtschaftsinformatik, Johann Wolfgang Goethe Universität. Frankfurt (2004)
Vries, S., Vohra, R.: Combinatorial auctions: A survey. INFORMS Journal on Computing 15(3), 284–309 (2001)
Wendt, O.: Naturanaloge Verfahren zur approximativen Lösung kombinatorischer Optimierungsprobleme. PhD thesis, University of Frankfurt. Germany (1994)
Wendt, O., Stockheim, T., Weiss, K.: Intelligente Tourenplanung mit DynaRoute. Wirtschaftsinformatik 47(2), 135–140 (2005)
Wendt, O., König, W., Stockheim, T., Lanninger, V., Weiss, K.: Transportplanung der Zukunft - Prozess- und Kostenanalyse, Optimierungspotenziale und Outsourcing. Verlag Books on Demand (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gujo, O., Schwind, M. (2008). Bid Formation in a Combinatorial Auction for Logistics Services. In: Filipe, J., Cordeiro, J., Cardoso, J. (eds) Enterprise Information Systems. ICEIS 2007. Lecture Notes in Business Information Processing, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88710-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-88710-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88709-6
Online ISBN: 978-3-540-88710-2
eBook Packages: Computer ScienceComputer Science (R0)