IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v32y2018i4-5p488-507.html
   My bibliography  Save this article

Selection model and algorithm of logistics corridor based on the network utility

Author

Listed:
  • Wenliang Bian
  • Lei Chen
  • Lina Chuan
  • Yong Zhao

Abstract

With the development of logistics industry in China, logistics networks become increasingly important. Especially, people who manages a nation-wide or world-wide company is eager to know how to make a better decision to choose corridors in complex networks. In order to help them to solve this problem, this paper expands two concepts of centrality, the node degree centrality and the edge betweenness centrality, as the basis for further analysis. Then, the network utility is defined based on which a logistics corridor selection model is proposed. Meanwhile, this model also takes not only the corridor's travel time and construction costs but its impact on the whole network into consideration. Subsequently, a combination algorithm among Dijkstra, Floyd and the ith shortest path algorithm is developed to solve the theoretical model. In addition, a numerical experiment is provided to verify the validity of the model and algorithm. The results from this paper implicate that managers can make a balance between operational factors and strategic factors to better solve the decision making problem in logistics network development by this feasible decision making model.

Suggested Citation

  • Wenliang Bian & Lei Chen & Lina Chuan & Yong Zhao, 2018. "Selection model and algorithm of logistics corridor based on the network utility," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 32(4/5), pages 488-507.
  • Handle: RePEc:ids:ijmtma:v:32:y:2018:i:4/5:p:488-507
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=93364
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmtma:v:32:y:2018:i:4/5:p:488-507. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    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.