COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES

Oleg Gujo, Michael Schwind

Abstract

The exchange of cargo capacities is an approach that is well established in the practice of logistics. Few of these mostly web-based market places, however, are able to take synergies into consideration that can be generated by the appropriate combination of the transportation lanes of different carriers. One way to achieve this is to employ combinatorial auctions, that allow one to bid on bundles of lanes. This article describes a combinatorial auction for the intra-enterprise exchange of logistic services. In the real world case considered here, we implement and analyze such an exchange process in an enterprise that is related to the food sector and organized in a profit center structure. In the intra-enterprise exchange process, each profit 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. The cost calculation is based on the results of an integrated routing system, and the in and outsourcing process is managed by using the auction mechanism ComEx. For the purpose of customer retention the delivery contracts are kept by the corresponding profit center, the incentive for exchanging the customers is achieved by a cost-savings distribution mechanism. After a description of the web-based logistics auction together with the route optimization system DynaRoute, the article describes the search for a cost optimizing strategy that bundles the appropriate delivery contracts.

References

  1. Bullnheimer, B., Hartl, R., and Strauss, C. (1999). An improved ant system algorithm for the vehicle routing problem. An. of Operations Research, 89:319-328.
  2. Caplice, C. (1996). An Optimization Based Bidding Process: A New Framework for Shipper-Carrier Relationships. PhD thesis, MIT, Massachusetts.
  3. Caplice, C. and Sheffi, Y. (2003). Optimization-based procurement for transportation services. Journal of Business Logistics, 24(2).
  4. Elmaghraby, W. and Keskinocak, P. (2005). Combinatorial auctions in procurement. In Harrison, T. P., Lee, H. L., and Neale, J. J., editors, The Practice of Supply Chain Management: Where Theory and Application Converge, pages 245-258. Springer, Berlin.
  5. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. computers and Operations Research, 13(5):533-549.
  6. Gomber, P., Schmidt, C., and Weinhardt, C. (1999). Auctions in electronic commerce: Efficiency versus computational tractability. In Proceedings of the International Conference on Electronic Commerce 98, pages 43-48, Seoul, Korea.
  7. Krajewska, M. A. and Kopfer, H. (2006). ing freight forwarding enterprises. 28(3):301-436.
  8. Li, H. and Lim, A. (2003). Local search with annealinglike restarts to solve the VRPTW. European Journal of Operational Research, 150:115-127.
  9. McMillan, J. (1995). Why auction the spectrum? Telecommunications Policy, 19:191-199.
  10. Nisan, N. (2000). Bidding and allocation in combinatorial auctions. In Proceedings of the 2.nd ACM Conference on Electronic Commerce (ACM EC'00), Minneapolis, MN, pages 1-12. ACM.
  11. Pankratz, G. (1999). 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., and Wäscher, G., editors, Operations Research Proceedings, pages 443-448. Springer Verlag.
  12. Regan, A. and Song, J. (2003). An auction based collaborative carrier network. Transportation Research Part E: Logistics and Transportation Review.
  13. Schwind, M. (2005). Design of combinatorial auctions for allocation and procurement processes. In 7th International IEEE Conference on E-Commerce Technology 2005, München, Germany, pages 391-395.
  14. Schwind, M. and Gujo, O. (2005). An agent-based simulation environment for a combinatorial grid scheduler. Technical report, Institute of Information Systems, J. W. Goethe University, Frankfurt, Germany.
  15. Schwind, M., Weiss, K., and Stockheim, T. (2004). CAMeL - Eine Meta-Sprache f ür Kombinatorische Auktionen. Technical report, Institut f ür Wirtschaftsinformatik, Johann Wolfgang Goethe Universität, Frankfurt.
  16. Vries, S. D. and Vohra, R. (2001). Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3):284-309.
  17. Wendt, O. (1994). Naturanaloge Verfahren zur approximativen Lösung kombinatorischer Optimierungsprobleme. PhD thesis, University of Frankfurt, Germany.
  18. Wendt, O., Stockheim, T., and Weiss, K. (2005). Intelligente Tourenplanung mit DynaRoute. Wirtschaftsinformatik, 47(2):135-140.
Download


Paper Citation


in Harvard Style

Gujo O. and Schwind M. (2007). COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES . In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 4: ICEIS, ISBN 978-972-8865-91-7, pages 5-12. DOI: 10.5220/0002351500050012


in Bibtex Style

@conference{iceis07,
author={Oleg Gujo and Michael Schwind},
title={COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 4: ICEIS,},
year={2007},
pages={5-12},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002351500050012},
isbn={978-972-8865-91-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 4: ICEIS,
TI - COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES
SN - 978-972-8865-91-7
AU - Gujo O.
AU - Schwind M.
PY - 2007
SP - 5
EP - 12
DO - 10.5220/0002351500050012