IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v99y2025ics0038012125000473.html
   My bibliography  Save this article

Fairness-oriented multi-objective optimization of supply chain planning under uncertainties

Author

Listed:
  • Yang, Zijing
  • Liu, Songsong

Abstract

Fair strategies in the supply chain planning are important to the sustainability development of supply chains. This work addresses the fairness-oriented multi-objective optimization of the production, distribution and capacity planning problem of multi-period, multi-product global supply chains under uncertainties, to optimize cost, responsiveness and customer service level, simultaneously. A fuzzy-based optimization model is established and transformed into a deterministic mixed integer linear programming (MILP) formulation, in which a new formulation method is developed to transform the variables with fuzzy parameters in the index into a definite form. In addition, to achieve sustainable development of the supply chain, Nash bargaining method is used for the proportionally fair strategies between the multiple objectives. Finally, a numerical case is used to demonstrate the applicability of the proposed model and solution approach. The computational results are shown to be Pareto-optimal. The fair solutions under different allowed degrees of uncertainty are compared through the Monte Carlo simulation. In addition, the obtained solutions are shown to be fairer than those from alternative solution method and capacity expansion strategy.

Suggested Citation

  • Yang, Zijing & Liu, Songsong, 2025. "Fairness-oriented multi-objective optimization of supply chain planning under uncertainties," Socio-Economic Planning Sciences, Elsevier, vol. 99(C).
    • Handle: RePEc:eee:soceps:v:99:y:2025:i:c:s0038012125000473
    DOI: 10.1016/j.seps.2025.102198
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012125000473
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2025.102198?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
    ---><---

    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:eee:soceps:v:99:y:2025:i:c:s0038012125000473. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    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.