IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-22788-3_9.html
   My bibliography  Save this book chapter

Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks

In: Large Scale Optimization in Supply Chains and Smart Manufacturing

Author

Listed:
  • Minghui Lai

    (Southeast University)

  • Xiaoqiang Cai

    (The Chinese University of Hong Kong (Shenzhen) and The Shenzhen Research Institute of Big Data)

Abstract

The importance of collaborative logistics is getting widely recognized in recent years. However, strategic revealing of private information and disagreements on how savings are split would make any efforts of collaboration unsuccessful. The large-scale nature of real-life transportation networks further complicates the implementation of collaboration, as the associated optimization problems are usually NP-hard. The academic community has developed a variety of methodologies by using operations research tools and algorithmic mechanism design to resolve these issues. We summarize the state-of-the-art progress in the literature and introduce the iterative mechanism design theories. The iterative mechanism design models consider private information and propose decentralized approximation algorithms to achieve a system-wide objective while eliciting truthful information through the iterations. Hence, iterative mechanism design effectively reduces computational and communication difficulties. We then apply the methodology to a truckload pickup-and-delivery collaboration problem as an example. Numerical results on large-scale instances are reported, verifying the effectiveness of the methodologies.

Suggested Citation

  • Minghui Lai & Xiaoqiang Cai, 2019. "Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks," Springer Optimization and Its Applications, in: Jesús M. Velásquez-Bermúdez & Marzieh Khakifirooz & Mahdi Fathi (ed.), Large Scale Optimization in Supply Chains and Smart Manufacturing, pages 257-282, Springer.
  • Handle: RePEc:spr:spochp:978-3-030-22788-3_9
    DOI: 10.1007/978-3-030-22788-3_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:spochp:978-3-030-22788-3_9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.