IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04325718.html
   My bibliography  Save this paper

Optimizing a multi-echelon location-inventory problem with joint replenishment : A Lipschitz e-optimal approach using Lagrangian relaxation

Author

Listed:
  • Lin Wang
  • Sirui Wang
  • Yeming Gong

    (EM - EMLyon Business School)

  • Lu Peng

Abstract

"This paper investigates a supply network design problem for cross-border e-commerce. The supply chain consists of suppliers, regional distribution centers, and distribution centers. Our goal is to determine simultaneously location decisions of regional distribution centers, and the inventory decisions for coordinated replenishment and delivery. We formulate this problem as a mixed-integer non-linear program, and develop a Lipschitz optimization algorithm and an iterative heuristic to solve it. Moreover, we propose a tight lower bound via constructing a dual problem. Computational results show that both the Lipschitz optimization method and the heuristic can produce a near-optimal solution with a gap below 1%. Finally, we analyze the influence of integrated decision making and capacity constraints. An interesting finding is that the capacity of regional distribution centers has a critical influence, while the capacity of distribution centers is trivial. Integrated decision making can achieve remarkable cost savings only if the capacity constraints of regional distribution centers are loose. Nevertheless, capacity constraints of distribution centers make almost no impact. This result can be a good guide for a company's investment plan: one should give top priority to regional distribution centers, and give only low priority to distribution centers."

Suggested Citation

  • Lin Wang & Sirui Wang & Yeming Gong & Lu Peng, 2023. "Optimizing a multi-echelon location-inventory problem with joint replenishment : A Lipschitz e-optimal approach using Lagrangian relaxation," Post-Print hal-04325718, HAL.
  • Handle: RePEc:hal:journl:hal-04325718
    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.

    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:hal:journl:hal-04325718. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.