Abstract
Transportation auctions are increasingly made online and the bidding time intervals are becoming much shorter. From the carriers’ perspective, bid determination problems need to be solved more quickly due to the increasing number of auctions in the online transportation marketplace for their survivability. In this research, we study the bid price determination problem of truckload (TL) carriers participating in multiple independent first-price sealed-bid single-request TL transportation auctions simultaneously. The carriers must win the right combination of auctions to ensure profitability. The high level of competition, the uncertainty of the outcomes of the auctions, and the independence of the auctions from each other constitute the main challenge in this setting. In order to solve this problem, we develop an efficient heuristic which identifies the auctions to participate and determines the carriers’ bids in the selected auctions. We demonstrate the efficiency and the effectiveness of our proposed heuristic by simulating a competitive auction-based transportation procurement marketplace under various parameter settings. The simulations show that our proposed heuristic performs close to an existing approach found in the literature with much less computational effort.
Similar content being viewed by others
References
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)
Bykowsky, M.M., Cull, R.J., Ledyard, J.O.: Mutually destructive bidding: The fcc auction design problem. J. Regul. Econ. 17(3), 205–228 (2000)
Chang, T.S.: Decision support for truckload carriers in one-shot combinatorial auctions. Transp. Res. Part B Methodol. 43(5), 522–541 (2009)
Ergun, O., Kuyzu, G., Savelsbergh, M.: Reducing truckload transportation costs through collaboration. Transp. Sci. 41(2), 206–221 (2007)
Figliozzi, M.A., Mahmassani, H.S., Jaillet, P.: Competitive performance assessment of dynamic vehicle routing technologies using sequential auctions. Transp. Res. Rec. 1882(1), 10–18 (2004)
Figliozzi, M.A., Mahmassani, H.S., Jaillet, P.: Quantifying opportunity costs in sequential transportation auctions for truckload acquisition. Transp. Res. Rec. 1964(1), 247–252 (2006)
Krishna, V.: Auction theory, San diego; London and Sydney (2002)
Kwasnica, A.M., Ledyard, J.O., Porter, D.P., DeMartini, C.: A new and improved design for multiobjectiterative auctions.In: Handbook of Spectrum Auction Design, pp. 391–417 (2017)
Kuyzu, G., Akyol, Ç.G., Ergun, Ö., Savelsbergh, M.: Bid price optimization for truckload carriers in simultaneous transportation procurement auctions. Transp. Res. Part B Methodol. 73, 34–58 (2015)
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 Logist. Transp. Rev. 43(2), 173–191 (2007)
Mesa-Arango, R., Ukkusuri, S.V.: Demand clustering in freight logistics networks. Transp. Res. Part E Logist. Transp. Rev. 81, 36–51 (2015)
Olcaytu, E., Kuyzu, G.: Synergy-based bidding method for simultaneous freight transportation auctions. Transp. Res. Proc. 30, 295–303 (2018)
Sheffi, Y.: Combinatorial auctions in the procurement of transportation services. Interfaces 34(4), 245–252 (2004)
Song, J., Regan, A.: Combinatorial auctions for transportation service procurement: the carrier perspective. Transp. Res. Rec. 1833(1), 40–46 (2003)
Triki, C.: Location-based techniques for the synergy approximation in combinatorial transportation auctions. Optim. Lett. 10(5), 1125–1139 (2016)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Olcaytu, E., Kuyzu, G. An efficient bidding heuristic for simultaneous truckload transportation auctions. Optim Lett 15, 459–468 (2021). https://doi.org/10.1007/s11590-020-01608-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01608-w