IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v236y2014i3p991-999.html
   My bibliography  Save this article

The stochastic bid generation problem in combinatorial transportation auctions

Author

Listed:
  • Triki, Chefi
  • Oprea, Simona
  • Beraldi, Patriza
  • Crainic, Teodor Gabriel

Abstract

In this paper, we deal with the generation of bundles of loads to be submitted by carriers participating in combinatorial auctions in the context of long-haul full truckload transportation services. We develop a probabilistic optimization model that integrates the bid generation and pricing problems together with the routing of the carrier’s fleet. We propose two heuristic procedures that enable us to solve models with up to 400 auctioned loads.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:236:y:2014:i:3:p:991-999
    DOI: 10.1016/j.ejor.2013.06.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713005018
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.06.013?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. Gianfranco Guastaroba & Renata Mansini & M Grazia Speranza, 2009. "Modeling the Pre Auction Stage The Truckload Case," Lecture Notes in Economics and Mathematical Systems, in: Jo A.E.E. Nunen & M. Grazia Speranza & Luca Bertazzi (ed.), Innovations in Distribution Logistics, chapter 11, pages 219-233, Springer.
    2. M Rekik & S Mellouli, 2012. "Reputation-based winner determination problem for combinatorial transportation procurement auctions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(10), pages 1400-1409, October.
    3. Lee, Chi-Guhn & Kwon, Roy H. & Ma, Zhong, 2007. "A carrier's optimal bid generation problem in combinatorial auctions for transportation procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 173-191, March.
    4. Pittawat Ueasangkomsate & Manoj Lohatepanont, 2012. "Bidding Strategies for Carrier in Combinatorial Transportation Auction," International Journal of Business Research and Management (IJBRM), Computer Science Journals (CSC Journals), vol. 3(1), pages 1-17, February.
    5. R. H. Kwon & G. Anandalingam & L. H. Ungar, 2005. "Iterative Combinatorial Auctions with Bidder-Determined Combinations," Management Science, INFORMS, vol. 51(3), pages 407-418, March.
    6. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    7. 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.
    8. 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.
    9. Ghiani, Gianpaolo & Manni, Emanuele & Quaranta, Antonella & Triki, Chefi, 2009. "Anticipatory algorithms for same-day courier dispatching," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 96-106, January.
    10. Warren B. Powell, 1996. "A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers," Transportation Science, INFORMS, vol. 30(3), pages 195-219, August.
    11. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    12. Peter Cramton & Yoav Shoham & Richard Steinberg (ed.), 2006. "Combinatorial Auctions," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262033429, April.
    13. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    14. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    15. Bezalel Gavish, 2003. "Combinatorial Auctions Mathematical Formulations And Open Issues," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 2(01), pages 5-27.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    2. Karaenke, Paul & Bichler, Martin & Merting, Soeren & Minner, Stefan, 2020. "Non-monetary coordination mechanisms for time slot allocation in warehouse delivery," European Journal of Operational Research, Elsevier, vol. 286(3), pages 897-907.
    3. Chen, Haoxun, 2016. "Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 152-172.
    4. 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.
    5. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    6. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    7. 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.
    8. 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).
    9. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
    10. Kangye Tan & Fang Xu & Xiaozhao Fang & Chunsheng Li, 2023. "Research on Location Selection for Urban Networks of Less-than-Truckload Express Enterprises Based on Improved Immune Optimization Algorithm," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    11. Mansouri, Bahareh & Hassini, Elkafi, 2015. "A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions," European Journal of Operational Research, Elsevier, vol. 244(2), pages 565-575.
    12. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    13. 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.
    14. 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.
    15. 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.
    16. Song, Zhuzhu & Tang, Wansheng & Zhao, Ruiqing, 2018. "Cooperation mode for a liner company with heterogeneous ports: Business cooperation vs. port investment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 513-533.
    17. Wang, Junjin & Liu, Jiaguo & Wang, Fan & Yue, Xiaohang, 2021. "Blockchain technology for port logistics capability: Exclusive or sharing," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 347-392.
    18. 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.
    19. 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.
    20. 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.
    21. Song, Zhuzhu & Tang, Wansheng & Zhao, Ruiqing, 2019. "Encroachment and canvassing strategy in a sea-cargo service chain with empty container repositioning," European Journal of Operational Research, Elsevier, vol. 276(1), pages 175-186.
    22. Margaretha Gansterer & Richard F. Hartl, 2016. "Request evaluation strategies for carriers in auction-based collaborations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 3-23, January.
    23. 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.

    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. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    7. 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.
    8. 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.
    9. 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.
    10. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    11. 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.
    12. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    13. 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.
    14. Farnia, Farnoush & Frayret, Jean-Marc & Beaudry, Catherine & Lebel, Luc, 2015. "Time-based combinatorial auction for timber allocation and delivery coordination," Forest Policy and Economics, Elsevier, vol. 50(C), pages 143-152.
    15. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    16. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    18. Dirk Briskorn & Kurt Jørnsten & Jenny Nossack, 2016. "Pricing combinatorial auctions by a set of linear price vectors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1043-1070, October.
    19. 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.
    20. 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.

    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:eee:ejores:v:236:y:2014:i:3:p:991-999. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.