×

Location-based techniques for the synergy approximation in combinatorial transportation auctions. (English) Zbl 1345.90009

Summary: The use of combinatorial auctions for the procurement of transportation services is investigated in this paper. We focus on the carrier viewpoint who is interested in submitting to the auction a selected bundle of loads that avoids some of the empty movement of the vehicles in his transportation network and that increases his profits. For this purpose we develop an optimization approach based on the use of the location techniques, usually used in the context of facility planning. Mathematically, this means maximizing the synergy among the bundle’s auctioned loads from one side and between the auctioned and the pre-existing loads from the other side. We show the validity of our approach by using first an illustrative example and then by applying it to solve a real-life problem related to a logistics company installed in the Arabic Gulf region.

MSC:

90B06 Transportation, logistics and supply chain management
91B26 Auctions, bargaining, bidding and selling, and other market models
90B85 Continuous location
Full Text: DOI

References:

[1] An, N., Elmaghraby, W., Keskinocak, P.: Bidding strategies and their impact on revenues in combinatorial auctions. J. Revenue Pricing Manag. 3(4), 337-357 (2005) · doi:10.1057/palgrave.rpm.5170119
[2] Caplice, C.: An optimization based bidding process: a new framework for shipper-carrier relationships, Ph.D. Thesis, Department of Civil and Environmental Engineering, School of Engineering, MIT (1996)
[3] Chang, T.S.: Decision support for truckload carriers in one-shot combinatorial auctions. Transp. Res. Part B 43, 522-541 (2009) · doi:10.1016/j.trb.2008.09.003
[4] Daskin, M.S.: Network and discrete location: models. In: Algorithms and Application, 2nd edn. Wiley, New Jersey (2013) · Zbl 1276.90038
[5] De Vries, S., Vohra, S.: Combinatorial a uctions: a survey. INFORMS J. Comput. 15(3), 284-309 (2003) · Zbl 1238.91003 · doi:10.1287/ijoc.15.3.284.16077
[6] Elmaghraby, W.; Keskinocak, P.; Harrison, TP (ed.); Lee, HL (ed.); Neale, JJ (ed.), Combinatorial auctions in procurement, 245-258 (2003), Norwell
[7] Ergun, O., Kuyzu, G., Savelsbergh, M.: Bid price optimization for simultaneous truckload transportation procurement auctions. In: Georgia Tech, Technical report. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.118.6096&rep=rep1&type=pdf (2007)
[8] Fernandes, I.F., Aloise, D., Aloise, D.J., Hansen, P., Liberti, L.: On the Weber facility location problem with limited distances and side constraints. Optim. Lett. 8(2), 407-424 (2014) · Zbl 1294.90033 · doi:10.1007/s11590-012-0538-9
[9] Ghiani, G., Manni, E., Triki, C.: The lane covering problem with time windows. J. Discret. Math. Sci. Cryptogr. 11(1), 67-81 (2008) · Zbl 1201.90053 · doi:10.1080/09720529.2008.10698167
[10] Gunluk, O., Ladanyi, L., De Vries, S.: A branch-and-price algorithm and new test problems for spectrum auctions. Manag. Sci. 51(3), 391-406 (2005) · Zbl 1232.90347 · doi:10.1287/mnsc.1040.0332
[11] Hale, T.S., Hale, L.C.: Aggregation technique for location problems with one-dimensional forbidden regions. Int. J. Ind. Eng. Theory Appl. Pract. 7(2), 133-139 (2000)
[12] Ivanova, E., Stoilov, T.: Solution of optimization continuous centre location problems as web service. In: Proceedings of the International Conference on Computer Systems and Technologies—CompSysTech’06, pp. IIIA.20-1-6. Veliko Tarnovo, Bulgaria (2006)
[13] Kelly, F., Steinberg, R.: A combinatorial auction with multiple winners for universal service. Manag. Sci. 46(4), 586-596 (2000) · Zbl 1231.91119 · doi:10.1287/mnsc.46.4.586.12054
[14] Klamroth, K.: Single-facility location problems with barriers. In: Springer Series in Operations Research. Springer, Berlin (2002) · Zbl 1027.90055
[15] Kwon, R.H., Lee, C.-G., Ma, Z.: An integrated combinatorial auction mechanism for truckload transportation procurement. In: Working Paper. University of Toronto, Toronto (2005) · Zbl 0900.90239
[16] Lee, H.L., Neale, J.J. (eds.): The practice of supply chain management, pp. 245-258. Kluwer, Norwell (2003)
[17] Lee, C.-G., Kwon, R.H., Ma, Z.: A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transp. Res. Part E 43, 173-191 (2007) · doi:10.1016/j.tre.2005.01.004
[18] Menezes, F.M.: On the optimality of Treasury Bill auctions. Econ. Lett. 49(3), 273-279 (1995) · Zbl 0900.90239 · doi:10.1016/0165-1765(95)00676-7
[19] Musmanno, R., Scordino, N., Triki, C., Violi, A.: A multistage formulation for gencos in a multi-auction electricity market. IMA J. Manag. Math. 21(2), 165-181 (2010) · Zbl 1202.91120 · doi:10.1093/imaman/dpp008
[20] Rassenti, S.J., Smith, L., Bulfin, R.L.: A combinatorial mechanism for airport time slot allocation. Bell J. Econ. 13, 402-417 (1982) · doi:10.2307/3003463
[21] Remli, N., Rekik, M.: A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes. Transp. Res. Part C 35, 204-217 (2013) · doi:10.1016/j.trc.2013.07.006
[22] Rodrigo, A.G.: Procurement of transportation services in spot markets under a double-auction scheme with elastic demand. Transp. Res. Part B 41(9), 1067-1078 (2007) · doi:10.1016/j.trb.2007.04.001
[23] Sarkar, A., Batta, R., Nagi, R.: Commentary on facility location in the presence of congested regions with the rectilinear distance metric. Soc. Econ. Plan. Sci. 38, 291-306 (2004) · doi:10.1016/S0038-0121(03)00025-9
[24] Sheffi, Y.: Combinatorial auction in the procurement of transportation service. Interface 34(4), 245-252 (2004) · doi:10.1287/inte.1040.0075
[25] Song, J., Regan, A.: Combinatorial auctions for transportation service procurement: the carrier perspective. Transp. Res. Rec. 40-46, 2004 (1833)
[26] Song, J., Regan, A.: Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transp. Res. Part B 39, 914-933 (2005) · doi:10.1016/j.trb.2004.11.003
[27] Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A.: Facilities Planning, 4th edn. Wiley, New York (2010)
[28] Triki, C., Conejo, A., Garces, L.: Short-term trading for electricity producers. In: Bertocchi, M.I., Consigli, G., Dempster, M.A.H. (eds.) Stochastic Optimization Methods in Finance and Energy, pp. 181-201. Springer, Berlin (2011) · Zbl 1405.91487
[29] Triki, C., Beraldi, P., Gross, G.: Optimal capacity allocation in multi-auction electricity markets under uncertainty. Comput. Oper. Res. 32(2), 201-217 (2005) · Zbl 1073.91046 · doi:10.1016/S0305-0548(03)00211-9
[30] Triki, C., Oprea, S., Beraldi, P., Crainic, T.: The stochastic bid generation problem in combinatorial transportation auctions. Eur. J. Oper. Res. 236, 991-999 (2014) · Zbl 1304.91087 · doi:10.1016/j.ejor.2013.06.013
[31] Ueasangkomsate, P., Lohatepanont, M.: Bidding strategies for carrier in combinatorial transportation auction. Int. J. Bus. Res. Manag. 3(1), 1-17 (2012)
[32] Wang, X., Xia, M.: Combinatorial bid generation problem for transportation service procurement. Transp. Res. Rec. 189-198, 2005 (1923)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.