Abstract
A carrier collaboration problem with pickup and delivery requests is considered, in which multiple carriers form an alliance to share their pickup and delivery requests and vehicle capacities in order to reduce their transportation costs and consequently increase their profits. A multi-round pricing-setting based combinatorial auction approach is proposed to solve the problem. In each round of the auction, the auctioneer updates the price for serving each request based on Lagrangian relaxation, and each carrier, who is a bidder, determines its requests to be outsourced and the requests to be acquired from other carriers by solving a request selection problem based on the prices. Different price adjustment methods are proposed and compared. Numerical experiments on randomly generated instances demonstrate the effectiveness of the approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ackermann H, Ewe H, Kopfer H, Kufer KH (2011a) Combinatorial auctions in freight logistics. In: Proceedings of the Second international conference on Computational logistics, pp 1–17
Ackermann H, Ewe H, Küfer K-H, Schröder M (2011b) Modeling profit sharing in combinatorial exchanges by network flows, ITWM Report. http://www.itwm.fraunhofer.de/fileadmin/ITWM-Media/Zentral/Pdf/Berichte_ITWM/2011/bericht_205.pdf
Agarwal R, Ergun O (2009) Mechanism design for a multicommodity flow game in service network alliances. Oper Res Lett 36(5):520–524
Agnetis A, Pacciarelli D, Pacifici A (2007) Combinatorial models for multi-agent scheduling problems, multiprocessor scheduling, theory and applications. I-Tech Education and Publishing, Vienna, pp 21–46
Ausubel L (2006) An efficient dynamic auction for heterogeneous commodities. Am Econ Rev 96(3):602–629
Berger S, Bierwirth C (2010) Solutions to the request reassignment problem in collaborative carrier networks. Transp Res Part E 46(5):627–638
Blumrosen L, Nisan N (2007) Combinatorial auctions. In: Nisan N, Roughgarden T, Tardos E, Vazirani V (eds) Algorithmic game theory. Cambridge University Press, Cambridge, pp 267–300
Dai B, Chen HX (2009) Mathematical model and solution approach for collaborative logistics in less than truckload (LTL) transportation. 39th International conference on computers and industrial engineering. Troyes, pp 767–772
Dai B, Chen HX (2009b) A Benders decomposition approach for collaborative logistics planning with LTL transportation. The third international conference on operations and supply chain management. Wuhan pp 565–573
Dai B, Chen HX (2011) A multi-agent and auction based framework and approach for carrier collaboration. Logist Res 3(2–3):101–120
Dai B, Chen HX (2012) Profit allocation mechanisms for carrier collaboration problem. Comput Ind Eng 62(2):633–643
Ergun Ö, Kuyzu G, Savelsbergh M (2007a) Shipper collaboration. Comput Oper Res 34(6):1551–1560
Ergun Ö, Kuyzu G, Savelsbergh M (2007b) Reducing truckload transportation costs through collaboration. Transp Sci 41(2):206–221
Fisher ML (2004) The lagrangian relaxation method for solving integer programming problems. Manag Sci 50(12 Supplement):1861–1871
Hernandez S, Peeta S, Kalafatas G (2011) A less-than-truckload carrier collaboration planning problem under dynamic capacities. Transp Res Part E Logist Transp Rev 47(6):933–946
Holguín-Veras J, Xu N, Jong G, Maurer H (2009) An experimental economics investigation of shipper-carrier interactions in the choice of mode and shipment size in freight transport. Netw Spat Econ. http://www.springerlink.com/content/m2m8h0077h83p102/
Houghtalen L, Ergun Ö, Sokol J (2007) Designing allocation mechanisms for carrier alliances, Unpublished. http://www.agifors.org/award/submissions2007/Houghtalen_paper.pdf
Kalagnanam J, Parkes DC (2004) Auction, bidding and exchange design. In: Simchi-Levi D, Wu SD, Shen ZM (eds) Handbook of quantitative supply chain analysis: modeling in the e-business era. Kluwer Academic Publishers, Berlin, pp 143–212
Krajewska MA, Kopfer H (2006) Collaborating freight forwarding enterprises: request allocation and profit sharing. OR Spectr 28(2):301–317
Kutanoglu E, Wu SD (1999) On combinatorial auction and lagrangean relaxation for distributed resource. IIE Trans 31(9):813–826
Kwon RH, Lee CG, Ma Z (2005) An integrated combinatorial auction mechanism for truckload transportation procurement. Working paper, Unpublished, University of Toronto, Canada. http://www.mie.utoronto.ca/labs/ilr/MultiRound.pdf
Lee CG, Kwon RH, Ma Z (2007) A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transp Res Part E 43(2):173–191
Luh PB, Yu DQ, Soorapanth S, Khibnik AI, Rajamani R (2005) A Lagrangian relaxation based approach to schedule asset overhaul and repair services. IEEE Trans Autom Sci Eng 2(2):145–157
Mes M (2008) Sequential auctions for full truckload allocation. PhD thesis, University of Twente, Enschede, Netherlands
Mes M, Van der Heijden M (2007) Pricing and scheduling strategies for carriers and shippers in sequential transportation auctions. In: Proceedings of the sixth triennial symposium on transportation analysis, Phuket Island
Parkes DC (2006) Iterative combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions, vol 2. MIT Press, Cambridge
Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. IseB 7(4):447–471
Sheffi Y (2004) Combinatorial auctions in the procurement of transportation services. Interfaces 34(4):245–252
Shoham Y, Brown KL (2009) Multiagent systems algorithmic, game-theoretic, and logical foundations. Cambridge University Press, UK, pp 329–381
Sun T, Zhao QC, Luh PB (2007) On the surrogate gradient algorithm for lagrangian relaxation. J Optim Theory Appl 133(3):413–416
Villahoz JJL, Martinez RO, Arauzo AA, Ordax JMG (2010). Price updating in combinatorial auctions for coordination of manufacturing multiagent systems. 8th International conference on practical applications of agents and multiagent systems, Springer, pp 201–207
Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284–309
Zhao X, Luh PB, Wang J (1999) Surrogate gradient algorithm for Lagrangian relaxation. J Optim Theory Appl 100(3):699–712
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dai, B., Chen, H. & Yang, G. Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests. Oper Res Int J 14, 361–386 (2014). https://doi.org/10.1007/s12351-014-0141-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-014-0141-1