The bid generation problem in combinatorial auctions for transportation service procurement

Abstract: In this work, a probabilistic bid generation problem with the pricing of a bundle of lanes and carrier’s vehicle routing is considered as it is an importation in transportation service procurement. Depending on the network of the vehicle, there exist multiple lanes for traveling between two locations. To solve the bid generation problem efficiently, a two-phase method approach is presented. At the core of the procedure a feasible vehicle routing problem on a multidigraph is solved by an exhaustive search algorithm to enumerate all routes concerning routing constraints and treat each route as a decision variable in the set partitioning formulation. We examine our model both analytically and empirically using a simulation-based analysis.

How to cite this paper

 Yang, F., Li, S & Huang, Y. (2023). The bid generation problem in combinatorial auctions for transportation service procurement.International Journal of Industrial Engineering Computations , 14(3), 511-522.

Refrences

An, N., Elmaghraby, W., & Keskinocak, P. (2005). Bidding strategies and their impact on revenues in combinatorial auctions. Journal of Revenue and Pricing Management, 3(4), 337-357.
Caplice, C. (2007). Electronic markets for truckload transportation. Production and Operations Management, 16(4), 423-436.
Caplice, C., & Sheffi, Y. (2003). Optimization-based procurement for transportation services. Journal of Business Logistics, 24(2), 109-128.
Chang, T. S. (2009). Decision support for truckload carriers in one-shot combinatorial auctions. Transportation Research Part B: Methodological, 43(5), 522-541.
Garaix, T., Artigues, C., Feillet, D., & Josselin, D. (2010). Vehicle routing problems with alter- native paths: An application to on-demand transportation. European Journal of Operational Research, 204(1), 62-75.
Goldsby, T. J., & Eckert, J. A. (2003). Electronic transportation marketplaces: a transaction cost perspective. Industrial Marketing Management, 32(3), 187-198.
Guo, Y., Lim, A., Rodrigues, B., & Zhu, Y. (2006). Carrier assignment models in transportation procurement. Journal of the Operational Research Society, 57(12), 1472-1481.
Hammami, F., Rekik, M., & Coelho, L. C. (2019). Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet. Transportation Research Part E: Logistics and Transportation Review, 127, 150-177.
Hammami, F., Rekik, M., & Coelho, L. C. (2021). Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions. Transportation Research Part B: Methodological, 149, 204-229.
Kuyzu, G., Akyol, Ç. G., Ergun, Ö., & Savelsbergh, M. (2015). Bid price optimization for truckload carriers in simultaneous transportation procurement auctions. Transportation Research Part B: Methodological, 73, 34-58.
Ledyard, J. O., Olson, M., Porter, D., Swanson, J. A., & Torma, D. P. (2002). The first use of a combined-value auction for transportation services. Interfaces, 32(5), 4-12.
Lee, C.-G., Kwon, R. H., & Ma, Z. (2007). A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transportation Research Part E: Logistics and Transportation Review, 43(2), 173-191.
Lucking, R., D. (1999). Using field experiments to test equivalence between auction formats: Magic on the internet. American Economic Review, 89(5), 1063-1080.
Olcaytu, E., & Kuyzu, G. (2018). Synergy-based bidding method for simultaneous freight transportation auctions. Transportation research procedia, 30, 295-303.
Reinhardt, L. B., Jepsen, M. K., & Pisinger, D. (2016). The edge set cost of the vehicle routing problem with time windows. Transportation Science, 50(2), 694-707.
Sheffi, Y. (2004). Combinatorial auctions in the procurement of transportation services. Interfaces, 34(4), 245–252.
Song, J., & Regan, A. (2003). Combinatorial auctions for transportation service procurement: The carrier perspective. Transportation Research Record, 1833(1), 40-46.
Song, J., & Regan, A. (2005). Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transportation Research Part B: Methodological, 39(10), 914-933.
Soriano, A., Vidal, T., Gansterer, M., & Doerner, K. (2020). The vehicle routing problem with arrival time diversification on a multigraph. European Journal of Operational Research, 286(2), 564-575.
Ticha, H. B., Absi, N., Feillet, D., & Quilliot, A. (2017). Empirical analysis for the VRPTW with a multigraph representation for the road network. Computers & Operations Research, 88, 103-116.
Tikani, H., & Setak, M. (2019). Efficient solution algorithms for a time-critical reliable transportation problem in multigraph networks with fifo property. Applied Soft Computing, 74, 504-528.
Tikani, H., Setak, M., & Demir, E. (2021). A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. European Journal of Operational Research, 293(2), 703-730.
Triki, C. (2016). Location-based techniques for the synergy approximation in combinatorial transportation auctions. Optimization Letters, 10(5), 1125-1139.
Triki, C., Oprea, S., Beraldi, P., & Crainic, T. G. (2014). The stochastic bid generation problem in combinatorial transportation auctions. European Journal of Operational Research, 236(3), 991-999.
Wang, X., & Xia, M. (2005). Combinatorial bid generation problem for transportation service procurement. Transportation research record, 1923(1), 189-198.