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

A Double-Layer Combination Algorithm for Real-Time Information-Sharing Network Design Problem

Author

Listed:
  • Qi Sun
  • Liwen Jiang
  • Haitao Xu
  • Daniela Paolotti

Abstract

The accumulation of real-time data has attracted the attention of various industries because valuable information can be extracted from the effective model and method design. This paper designs a low-carbon model and focuses on the real-time information-sharing network in order to get sustainable strategies promptly and exactly. The design problem is concerned with determining optimal integration strategies on a series of multilocation, multipath, and multiwarehouse freight provided by an information-sharing network to find an effective balance between the total costs and carbon emission. Firstly, the biobjective information-sharing network model is established to describe real-time problem with total cost and carbon emission factor. Secondly, a double-layer bacterial foraging algorithm is divided into inner and outer layers to solve the model, in which the inner section solves the transportation and inventory problems, and the outer section solves the supplier location problem. The double-layer bacterial foraging algorithm realizes the optimization of multisource e-commerce information-sharing model through nesting inside and outside layers. Finally, double-layer bacterial foraging algorithm can be confirmed to get the global optimal solution rapidly based on test data and the e-business case study of Jingdong, China.

Suggested Citation

  • Qi Sun & Liwen Jiang & Haitao Xu & Daniela Paolotti, 2021. "A Double-Layer Combination Algorithm for Real-Time Information-Sharing Network Design Problem," Complexity, Hindawi, vol. 2021, pages 1-18, February.
  • Handle: RePEc:hin:complx:4856593
    DOI: 10.1155/2021/4856593
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4856593.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4856593.xml
    Download Restriction: no

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