IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5065640.html
   My bibliography  Save this article

Fuzzy Reliability Optimization for 2-Hub Center Problem with Cluster-Based Policy and Application in Cross-Border Supply Chain Network Design Using TS Algorithm

Author

Listed:
  • Chenyi Yan
  • Xifu Wang
  • Kai Yang

Abstract

As information and communication technology evolves and expands, business and markets are linked to form a complex international network, thus generating plenty of cross-border trading activities in the supply chain network. Through the observations from a typical cross-border supply chain network, this paper introduces the fuzzy reliability-oriented 2-hub center problem with cluster-based policy, which is a special case of the well-studied hub location problem (HLP). This problem differs from the classical HLP in the sense that (i) the hub-and-spoke (H&S) network is grouped into two clusters in advance based on their cross-border geographic features, and (ii) a fuzzy reliability optimization approach based on the possibility measure is developed. The proposed problem is first modeled through a mixed-integer nonlinear programming (MINLP) formulation that maximizes the reliability of the entire cross-border supply chain network. Then, some linearization techniques are implemented to derive a linear model, which can be efficiently solved by exact algorithms run by CPLEX for only small instances. To counteract the difficulty for solving the proposed problem in realistic-sized instances, a tabu search (TS) algorithm with two types of move operators (called “Swap I” and “Swap II”) is further developed. Finally, a series of numerical experiments based on the Turkish network and randomly generated large-scale datasets are set up to verify the applicability of the proposed model as well as the superiority of the TS algorithm compared to the CPLEX.

Suggested Citation

  • Chenyi Yan & Xifu Wang & Kai Yang, 2020. "Fuzzy Reliability Optimization for 2-Hub Center Problem with Cluster-Based Policy and Application in Cross-Border Supply Chain Network Design Using TS Algorithm," Complexity, Hindawi, vol. 2020, pages 1-12, April.
  • Handle: RePEc:hin:complx:5065640
    DOI: 10.1155/2020/5065640
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/5065640.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/5065640.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/5065640?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
    ---><---

    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:hin:complx:5065640. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.