A bi-objective production planning for a flexible supply chain solved using NSGA-II and MOPSO

被引:4
|
作者
Karimi, S. K. [1 ]
Sadjadi, S. J. [1 ]
Naini, S. G. J. [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Ind Engn, Tehran, Iran
关键词
Flexibility; Supply Chain; Optimization; NSGA-II; MOPSO; Metaheuristic Methods; PARTICLE SWARM OPTIMIZATION; CONCEPTUAL-MODEL; FLEXIBILITY; DEFINITION; LOGISTICS; ALGORITHM; DECISION; AGILITY; DESIGN;
D O I
10.24867/IJIEM-2022-1-298
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Nowadays, rapid changes in customers' demands have redoubled the importance of new concepts such as supply chain flexibility and its application. The extent to which flexibility should be built into supply chains requires full consideration. Flexibility is defined as firms' quick and efficient response to changes. This paper quantifies the positive effects of adding different flexibility dimensions to a production planning bi-objective mathematical model. Four flexibility dimensions are proposed according to the needs of a production plant chosen as the case study. The objective functions are to minimize total costs along with the delivery time of the product, respectively. We also employ two metaheuristic algorithms, NSGA-II and MOPSO, to solve our proposed NP-hard model. Afterwards, we compare both solution strategies based on five criteria to achieve optimal results. Moreover, we compare the performance of both flexible and inflexible models in terms of costs. The results show that applying the flexible model causes a reduction of %22 in costs.
引用
收藏
页码:18 / 37
页数:20
相关论文
共 50 条
  • [21] Optimizing a bi-objective multi-product EPQ model with defective items, rework and limited orders: NSGA-II and MOPSO algorithms
    Pasandideh, Seyed Hamid Reza
    Niaki, Seyed Taghi Akhavan
    Sharafzadeh, Sharareh
    JOURNAL OF MANUFACTURING SYSTEMS, 2013, 32 (04) : 764 - 770
  • [22] Performance Comparison of NSGA-II and NSGA-III on Bi-objective Job Shop Scheduling Problems
    dos Santos, Francisco
    Costa, Lino A.
    Varela, Leonilde
    OPTIMIZATION, LEARNING ALGORITHMS AND APPLICATIONS, PT I, OL2A 2023, 2024, 1981 : 531 - 543
  • [23] Bi-objective optimization of integrating configuration generation and scheduling for reconfigurable flow lines using NSGA-II
    Dou, Jianping
    Li, Jun
    Su, Chun
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2016, 86 (5-8): : 1945 - 1962
  • [24] An enhanced NSGA-II algorithm for fuzzy bi-objective assembly line balancing problems
    Babazadeh, Hossein
    Alavidoost, M. H.
    Zarandi, M. H. Fazel
    Sayyari, S. T.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 123 : 189 - 208
  • [25] Novel NSGA-II and SPEA2 Algorithms for Bi-Objective Inventory Optimization
    Huseyinov, Ilham
    Bayrakdar, Ali
    STUDIES IN INFORMATICS AND CONTROL, 2022, 31 (03): : 31 - 42
  • [26] Bi-objective optimization of integrating configuration generation and scheduling for reconfigurable flow lines using NSGA-II
    Jianping Dou
    Jun Li
    Chun Su
    The International Journal of Advanced Manufacturing Technology, 2016, 86 : 1945 - 1962
  • [27] Redesigning a NSGA-II metaheuristic for the bi-objective Support Vector Machine with feature selection
    Alcaraz, Javier
    COMPUTERS & OPERATIONS RESEARCH, 2024, 172
  • [28] Simulation–optimization approach for the multi-objective production and distribution planning problem in the supply chain: using NSGA-II and Monte Carlo simulation
    Niloofar Nadim Kabiri
    Saeed Emami
    Abdul Sattar Safaei
    Soft Computing, 2022, 26 : 8661 - 8687
  • [29] Bi-objective optimization modeling for biomass supply chain planning
    Wang, Chia-Nan
    Cao, Thi-Be-Oanh
    Nguyen, Duc Duy
    Dang, Thanh-Tuan
    MEASUREMENT & CONTROL, 2024, 57 (08): : 1087 - 1098
  • [30] A Bi-objective Model for Collaborative Planning in Dyadic Supply Chain
    Ben Abdallah, Hamza
    Cheikhrouhou, Naoufel
    Bahroun, Zied
    Rached, Mansour
    PROCEEDINGS OF THE 2013 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2013, : 633 - 638