IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-025-06492-0.html
   My bibliography  Save this article

Advanced synergy-driven algorithms for bid generation in transportation auctions

Author

Listed:
  • Md. Rakibul Hasan

    (Hamad Bin Khalifa University
    Hajee Mohammad Danesh Science and Technology University)

  • Chefi Triki

    (University of Kent)

  • Adel Elomri

    (Hamad Bin Khalifa University)

  • Abrar Tasneem Abir

    (Carnegie Mellon University Qatar)

Abstract

Securing transportation services is crucial for supply chain management (SCM), as it constitutes the most significant expense within this domain. Implementing an effective bid generation strategy in combinatorial auctions (CAs) as a procurement mechanism to secure these services is vital for enhancing SCM efficiency. This study presents an advanced approach for quantifying synergy within the transportation network, aiming to identify the optimal bundles of auctioned contracts (AC). An efficient synergy-based bid generation algorithm has been developed to determine the optimal bids to be submitted within a transportation CA framework. This approach addresses two scenarios: one that considers service time limitations and another that allows for flexibility in early time constraints for the AC. The study investigates the potential of implementing a discount system by achieving savings through a relaxed time approach. It also examines the system’s effectiveness in promoting more efficient transportation by minimizing travel distances on roadways in relaxed early-time cases. This research provides an efficient solution to the bid generation problem (BGP) with high dimensionality. Results indicate that the BGP having 550 booked contracts (BC), 800 AC, and 220 cities is solved within a reasonable timeframe. Furthermore, the study found that the computational complexity of the synergy-based BGP relies more on the ratio of the number of AC to BC rather than solely on the number of AC.

Suggested Citation

  • Md. Rakibul Hasan & Chefi Triki & Adel Elomri & Abrar Tasneem Abir, 2025. "Advanced synergy-driven algorithms for bid generation in transportation auctions," Annals of Operations Research, Springer, vol. 347(3), pages 1339-1384, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06492-0
    DOI: 10.1007/s10479-025-06492-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06492-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06492-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    2. Intissar Ben Othmane & Monia Rekik & Sehl Mellouli, 2019. "A profit-maximization heuristic for combinatorial bid construction with pre-existing network restrictions," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(12), pages 2097-2111, December.
    3. Triki, Chefi & Oprea, Simona & Beraldi, Patriza & Crainic, Teodor Gabriel, 2014. "The stochastic bid generation problem in combinatorial transportation auctions," European Journal of Operational Research, Elsevier, vol. 236(3), pages 991-999.
    4. Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
    5. Chang, Tsung-Sheng, 2009. "Decision support for truckload carriers in one-shot combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 522-541, June.
    6. Fang Yang & Yao-Huei Huang, 2021. "An optimization approach for winner determination problem considering transportation cost discounts," Journal of Global Optimization, Springer, vol. 80(3), pages 711-728, July.
    7. Garrido, Rodrigo A., 2007. "Procurement of transportation services in spot markets under a double-auction scheme with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1067-1078, November.
    8. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    9. Shiying Liu & Fang Yang & Tailin Liu & Mengli Li, 2024. "An Effective Two-Stage Algorithm for the Bid Generation Problem in the Transportation Service Market," Mathematics, MDPI, vol. 12(7), pages 1-12, March.
    10. Hammami, Farouk & Rekik, Monia & Coelho, Leandro 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, Elsevier, vol. 149(C), pages 204-229.
    11. Aghdas Badiee & Hamed Kalantari & Chefi Triki, 2023. "Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers’ collaboration networks," Annals of Operations Research, Springer, vol. 322(1), pages 345-383, March.
    12. Regan, A C & Song, Jiongjiong, 2003. "Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective," University of California Transportation Center, Working Papers qt7sq003mj, University of California Transportation Center.
    13. World Bank, "undated". "State and Trends of Carbon Pricing 2020 [Situación y tendencias de la fijación del precio al carbono 2020]," World Bank Publications - Reports 33809, The World Bank Group.
    14. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    15. Chefi Triki & Jamila Akil & Huda Al-Asmakh, 2023. "Optimisation models for the procurement through reverse combinatorial auctions in the logistics and food industries," International Journal of Procurement Management, Inderscience Enterprises Ltd, vol. 16(4), pages 530-548.
    16. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2015. "Demand clustering in freight logistics networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 36-51.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hammami, Farouk & Rekik, Monia & Coelho, Leandro 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, Elsevier, vol. 149(C), pages 204-229.
    2. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    3. Hammami, Farouk & Rekik, Monia & Coelho, Leandro 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, Elsevier, vol. 127(C), pages 150-177.
    4. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2015. "Demand clustering in freight logistics networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 36-51.
    5. Xu, Su Xiu & Zhao, Zhiheng & Huang, George Q. & Ding, Yifang & Li, Ming & Feng, Jianghong, 2025. "A meta-auction for on-demand transportation procurement in industry 5.0," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    6. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    7. Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
    8. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    9. Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
    10. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
    11. Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
    12. Su Xiu Xu & George Q. Huang & Meng Cheng, 2017. "Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration," Transportation Science, INFORMS, vol. 51(4), pages 1365-1386, November.
    13. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    14. Pueboobpaphan, Suthatip & Indra-Payoong, Nakorn & Opasanon, Sathaporn, 2019. "Experimental analysis of variable surcharge policy of taxi service auction," Transport Policy, Elsevier, vol. 76(C), pages 134-148.
    15. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2013. "Benefits of in-vehicle consolidation in less than truckload freight transportation operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 113-125.
    16. Jothi Basu, R. & Bai, Ruibin & Palaniappan, PL.K., 2015. "A strategic approach to improve sustainability in transportation service procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 152-168.
    17. Zhang, Huili & Luo, Kelin & Xu, Yao & Xu, Yinfeng & Tong, Weitian, 2022. "Online crowdsourced truck delivery using historical information," European Journal of Operational Research, Elsevier, vol. 301(2), pages 486-501.
    18. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    19. Yang, Fang & Huang, Yao-Huei, 2020. "Linearization technique with superior expressions for centralized planning problem with discount policy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 542(C).
    20. Lyu, Xiaohui & Chen, Haoxun & Wang, Nengmin & Yang, Zhen, 2019. "A multi-round exchange mechanism for carrier collaboration in less than truckload transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 38-59.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06492-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.