Bi-objective supply chain planning in a fuzzy environment

被引:8
|
作者
Ahmadizar, Fardin [1 ]
Zeynivand, Mehdi [1 ]
机构
[1] Univ Kurdistan, Dept Ind Engn, Sanandaj, Iran
关键词
Supply chain planning; cross-docking; JIT; fuzzy numbers; chance-constrained programming; STOCHASTIC-PROGRAMMING APPROACH; DISTRIBUTION NETWORK DESIGN; OPTIMIZATION; UNCERTAINTY; SIMULATION; DECISIONS; DEMAND; PROFIT; MODEL;
D O I
10.3233/IFS-120723
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a fuzzy bi-objective mixed integer linear programming formulation and solution methodology for a multi-echelon, multi-product and multi-period supply chain planning. The supply chain is a network of suppliers, plants, distribution centers, cross-docks and retailers. Products are delivered to retailers through cross-docks or directly from manufacturing plants. Cross-docking as an efficient logistic strategy is an intermediate level that involves receiving products from various resources (distribution centers), sorting and then shipping them to their destinations (retailers). The aim of this paper is to present a model that minimizes the total cost and develops a just-in-time (JIT) distribution for the supply chain. The proposed model integrates procurement, production and distribution plans in the tactical level under fuzzy supply, production and demand by considering cross-docking and direct shipments simultaneously. Triangular fuzzy numbers are adapted to represent fuzzy parameters. Moreover, the fuzzy chance-constrained programming is applied to transform the fuzzy model into an auxiliary crisp model.
引用
收藏
页码:153 / 164
页数:12
相关论文
共 50 条
  • [1] Bi-objective Multistage Decentralized Supply Chain Planning
    Haque, Marjia
    Paul, Sanjoy Kumar
    Sarker, Ruhul
    Essam, Daryl
    [J]. 2020 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2020, : 766 - 770
  • [2] Bi-objective optimization modeling for biomass supply chain planning
    Wang, Chia-Nan
    Cao, Thi-Be-Oanh
    Nguyen, Duc Duy
    Dang, Thanh-Tuan
    [J]. MEASUREMENT & CONTROL, 2024, 57 (08): : 1087 - 1098
  • [3] A Bi-objective Model for Collaborative Planning in Dyadic Supply Chain
    Ben Abdallah, Hamza
    Cheikhrouhou, Naoufel
    Bahroun, Zied
    Rached, Mansour
    [J]. PROCEEDINGS OF THE 2013 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2013, : 633 - 638
  • [4] Supply chain modeling in uncertain environment with bi-objective approach
    Mahnam, Mehdi
    Yadollahpour, Mohammad Reza
    Famil-Dardashti, Vahid
    Hejazi, Seyed Reza
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) : 1535 - 1544
  • [5] Bi-objective closed-loop supply chain network design with risks in a fuzzy environment
    Dai, Zhuo
    Dai, Hong-mei
    [J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2016, 33 (03) : 169 - 180
  • [6] Bi-objective Framework for Planning a Supply Chain Process in Reconfigurable Manufacturing Systems
    Belaiche, L.
    Kahloul, L.
    Benharzallah, S.
    Hafidi, Y.
    [J]. IFAC PAPERSONLINE, 2019, 52 (13): : 1675 - 1680
  • [7] A fuzzy bi-objective MILP approach to integrate sales, production, distribution and procurement planning in a FMCG supply chain
    Yaser Nemati
    Mohammad Hosein Alavidoost
    [J]. Soft Computing, 2019, 23 : 4871 - 4890
  • [8] A fuzzy bi-objective MILP approach to integrate sales, production, distribution and procurement planning in a FMCG supply chain
    Nemati, Yaser
    Alavidoost, Mohammad Hosein
    [J]. SOFT COMPUTING, 2019, 23 (13) : 4871 - 4890
  • [9] A bi-objective optimization model for tactical planning in the pome fruit industry supply chain
    Catala, Luis P.
    Susana Moreno, M.
    Blanco, Anibal M.
    Alberto Bandoni, J.
    [J]. COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2016, 130 : 128 - 141
  • [10] A bi-objective supply chain design problem with uncertainty
    Cardona-Valdes, Y.
    Alvarez, A.
    Ozdemir, D.
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (05) : 821 - 832