A genetic algorithm approach for optimising a closed-loop supply chain network with crisp and fuzzy objectives

被引:61
|
作者
Demirel, Neslihan [1 ]
Ozceylan, Eren [2 ]
Paksoy, Turan [2 ]
Gokcen, Hadi [1 ]
机构
[1] Gazi Univ, Dept Ind Engn, Ankara, Turkey
[2] Selcuk Univ, Dept Ind Engn, Konya, Turkey
关键词
genetic algorithm; incremental incentive; secondary market; mixed integer programming; closed-loop supply chain; fuzzy multi-objective; REVERSE LOGISTICS NETWORK; INTEGER PROGRAMMING-MODEL; AUTOMOTIVE INDUSTRY; DESIGN PROBLEM; PRODUCT; OPTIMIZATION; MULTIPRODUCT; STRATEGY; RECOVERY; VEHICLES;
D O I
10.1080/00207543.2013.879616
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper proposes a mixed integer programming model for a closed-loop supply chain (CLSC) network with multi-periods and multi-parts under two main policies as secondary market pricing and incremental incentive policies. In the first policy, customers order and receive products from distribution centres, but at next period, they can trade among themselves with used products that are returned in a secondary market. Financial incentives are offered to the customers to influence the returns, and the correct amount of collections at different prices is determined by the second policy. In addition to the base case (crisp) formulation, a fuzzy multi-objective extension is applied to solve CLSC network problem with fuzzy objectives to represent vagueness in real-world problems. Then, developed genetic algorithm approach is applied to solve real size crisp and fuzzy CLSC problems. The effectiveness of the proposed meta-heuristic approach is investigated and illustrated by comparing its results with GAMS-CPLEX on a set of crisp/fuzzy problems with different sizes.
引用
收藏
页码:3637 / 3664
页数:28
相关论文
共 50 条
  • [31] Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm
    Zhou Xian-cheng
    Zhao Zhi-xue
    Zhou Kai-jun
    He Cai-hong
    JOURNAL OF CENTRAL SOUTH UNIVERSITY, 2012, 19 (02) : 482 - 487
  • [32] Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm
    周鲜成
    赵志学
    周开军
    贺彩虹
    JournalofCentralSouthUniversity, 2012, 19 (02) : 482 - 487
  • [33] SUSTAINABLE CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR CONSTRUCTION MACHINERY RECOVERING
    Sadrnia, Abdolhossein
    Sani, Amirreza Payandeh
    Langarudi, Najme Roghani
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2021, 17 (05) : 2389 - 2414
  • [34] Optimizing the fuzzy closed-loop supply chain for electrical and electronic products
    Phan Nguyen Ky Phuc
    Yu, Vincent F.
    Chou, Shou-Yan
    2012 INTERNATIONAL CONFERENCE ON FUZZY THEORY AND ITS APPLICATIONS (IFUZZY2012), 2012, : 316 - 321
  • [35] A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design
    Yang, Yuxiang
    Huang, Zuqing
    Qiang, Qiang
    Zhou, Gengui
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (05)
  • [36] Optimizing the Fuzzy Closed-Loop Supply Chain for Electrical and Electronic Equipments
    Phan Nguyen Ky Phuc
    Yu, Vincent F.
    Chou, Shuo-Yan
    INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, 2013, 15 (01) : 9 - 21
  • [37] Shrimp closed-loop supply chain network design
    Mosallanezhad, Behzad
    Hajiaghaei-Keshteli, Mostafa
    Triki, Chefi
    SOFT COMPUTING, 2021, 25 (11) : 7399 - 7422
  • [38] Shrimp closed-loop supply chain network design
    Behzad Mosallanezhad
    Mostafa Hajiaghaei-Keshteli
    Chefi Triki
    Soft Computing, 2021, 25 : 7399 - 7422
  • [39] Designing an environmentally conscious tire closed-loop supply chain network with multiple recovery options using interactive fuzzy goal programming
    Subulan, Kemal
    Tasan, A. Serdar
    Baykasoglu, Adil
    APPLIED MATHEMATICAL MODELLING, 2015, 39 (09) : 2661 - 2702
  • [40] Application of optimization methods in the closed-loop supply chain: a literature review
    Oliveira, Luttiely Santos
    Machado, Ricardo Luiz
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (02) : 357 - 400