IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v38y2016i1d10.1007_s00291-015-0411-1.html
   My bibliography  Save this article

Request evaluation strategies for carriers in auction-based collaborations

Author

Listed:
  • Margaretha Gansterer

    () (University of Vienna)

  • Richard F. Hartl

    (University of Vienna)

Abstract

Abstract In the highly competitive shipping and transportation industry, companies need to achieve a maximum level of efficiency in order to stay in business. To reach this goal they can, for instance, participate in collaborative networks and trade their transportation requests among each other. This is commonly done by using auction-based exchange systems. A critical part here is the formation of the request candidate set, which is the bundle of requests that should be offered to other carriers. Therefore, we develop and evaluate different request evaluation strategies for carriers participating in auction-based collaborations. For our investigations, we use a framework that is based on an exchange mechanism presented in the literature. The goal is to maximize the total network profit while enabling the carriers to reveal as little as possible of their private information. We did several adaptions to the existing framework to improve the performance and to make it applicable to larger test cases. For instance, the exact and thus costly tour building method is replaced by a heuristic approach. We achieve comparable results while the runtime is reduced by several orders of magnitude. Thus, we are able to handle problems with an increased number of transportation requests. Different strategies for the evaluation of pickup and delivery requests are assessed based on their effect on the total profit of the collaborative carrier network.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:orspec:v:38:y:2016:i:1:d:10.1007_s00291-015-0411-1
    DOI: 10.1007/s00291-015-0411-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-015-0411-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    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. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    2. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    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. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    5. Yossi Sheffi, 2004. "Combinatorial Auctions in the Procurement of Transportation Services," Interfaces, INFORMS, vol. 34(4), pages 245-252, August.
    6. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    7. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    8. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
    9. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    10. Ozlem Ergun & Gultekin Kuyzu & Martin Savelsbergh, 2007. "Reducing Truckload Transportation Costs Through Collaboration," Transportation Science, INFORMS, vol. 41(2), pages 206-221, May.
    11. Krajewska, Marta Anna & Kopfer, Herbert, 2009. "Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 741-751, September.
    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. repec:eee:transe:v:107:y:2017:i:c:p:60-80 is not listed on IDEAS
    2. repec:eee:ejores:v:268:y:2018:i:1:p:1-12 is not listed on IDEAS
    3. repec:spr:cejnor:v:26:y:2018:i:2:d:10.1007_s10100-017-0503-x is not listed on IDEAS
    4. Alf Kimms & Herbert Kopfer, 2016. "Collaborative planning in transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 1-2, January.

    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:orspec:v:38:y:2016:i:1:d:10.1007_s00291-015-0411-1. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.