IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i7p1007-d1365460.html
   My bibliography  Save this article

An Effective Two-Stage Algorithm for the Bid Generation Problem in the Transportation Service Market

Author

Listed:
  • Shiying Liu

    (School of Economics and Management, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)

  • Fang Yang

    (Key Laboratory of Big Data Intelligent Computing, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)

  • Tailin Liu

    (School of Economics and Management, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)

  • Mengli Li

    (School of Modern Posts, Chongqing University of Posts and Telecommunications, Chongqing 400065, China)

Abstract

This study designs a two-stage algorithm to address the bid generation problem of carriers when adding new vehicle routes in the presence of the existing vehicle routes to provide transportation service. To obtain the best auction combination and bid price of the carrier, a hybrid integer nonlinear programming model is introduced. According to the characteristics of the problem, a set of two-stage hybrid algorithms is proposed, innovatively integrating block coding within a genetic algorithm framework with a depth-first search approach. This integration effectively manages routing constraints, enhancing the algorithm’s efficiency. The block coding and each route serve as decision variables in the set partition formula, enabling a comprehensive exploration of potential solutions. After a simulation-based analysis, the algorithm has been comprehensively validated analytically and empirically. The improvement of this research lies in the effectiveness of the proposed algorithm, i.e., the ability to handle a broader range of problem scales with less time in addressing complex operator bid generation in combinatorial auctions.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:1007-:d:1365460
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/1007/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/1007/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Margaretha Gansterer & Richard F. Hartl, 2018. "Centralized bundle generation in auction-based collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 613-635, July.
    2. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    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. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    2. Scherr, Yannick Oskar & Gansterer, Margaretha & Hartl, Richard F., 2024. "Request acceptance with overbooking in dynamic and collaborative vehicle routing," European Journal of Operational Research, Elsevier, vol. 314(2), pages 612-629.
    3. Gansterer, Margaretha & Hartl, Richard F. & Savelsbergh, Martin, 2020. "The value of information in auction-based carrier collaborations," International Journal of Production Economics, Elsevier, vol. 221(C).
    4. Nuraiman, Dian & Ozlen, Melih & Hearne, John, 2020. "A spatial decomposition based math-heuristic approach to the asset protection problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    5. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    6. Vangerven, Bart & Goossens, Dries R. & Spieksma, Frits C.R., 2017. "Winner determination in geometrical combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 258(1), pages 254-263.
    7. T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
    8. Erik Heilmann & Nikolai Klempp & Heike Wetzel, 2020. "Market design of regional flexibility markets: A classification metric for flexibility products and its application to German prototypical flexibility markets," MAGKS Papers on Economics 202002, Philipps-Universität Marburg, Faculty of Business Administration and Economics, Department of Economics (Volkswirtschaftliche Abteilung).
    9. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    10. Heilmann, Erik & Klempp, Nikolai & Wetzel, Heike, 2020. "Design of regional flexibility markets for electricity: A product classification framework for and application to German pilot projects," Utilities Policy, Elsevier, vol. 67(C).
    11. Anders Lunander & Sofia Lundberg, 2013. "Bids And Costs In Combinatorial And Noncombinatorial Procurement Auctions—Evidence From Procurement Of Public Cleaning Contracts," Contemporary Economic Policy, Western Economic Association International, vol. 31(4), pages 733-745, October.
    12. Mancini, Simona & Gansterer, Margaretha & Hartl, Richard F., 2021. "The collaborative consistent vehicle routing problem with workload balance," European Journal of Operational Research, Elsevier, vol. 293(3), pages 955-965.
    13. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    14. Bo Chen & Emilios Galariotis & Lijun Ma & Zijia Wang & Zhaobo Zhu, 2023. "On disclosure of participation in innovation contests: a dominance result," Annals of Operations Research, Springer, vol. 328(2), pages 1615-1629, September.
    15. F. Bonomo & J. Catalán & G. Durán & R. Epstein & M. Guajardo & A. Jawtuschenko & J. Marenco, 2017. "An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools," Annals of Operations Research, Springer, vol. 258(2), pages 569-585, November.
    16. 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.
    17. Rönnqvist, Mikael & D'Amours, Sophie & Carle, Marc-André & Azouzi, Riadh, 2018. "Timber selling policies using bundle-based auction: The case of public forests in Québec," Forest Policy and Economics, Elsevier, vol. 96(C), pages 9-18.
    18. Mercedes Landete & Juan Monge & Antonio Rodríguez-Chía, 2013. "Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem," Annals of Operations Research, Springer, vol. 207(1), pages 137-160, August.
    19. Remli, Nabila & Amrouss, Amine & El Hallaoui, Issmail & Rekik, Monia, 2019. "A robust optimization approach for the winner determination problem with uncertainty on shipment volumes and carriers’ capacity," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 127-148.
    20. Los, Johan & Schulte, Frederik & Spaan, Matthijs T.J. & Negenborn, Rudy R., 2020. "The value of information sharing for platform-based collaborative vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).

    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:gam:jmathe:v:12:y:2024:i:7:p:1007-:d:1365460. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.