Service-oriented bi-objective robust collection-disassembly problem with equipment selection

被引:11
作者
Liu, Xin [1 ]
Chu, Feng [2 ]
Dolgui, Alexandre [3 ]
Zheng, Feifeng [1 ]
Liu, Ming [4 ]
机构
[1] Donghua Univ, Glorious Sun Sch Business & Management, Shanghai, Peoples R China
[2] Univ Paris Saclay, Univ Evry, IBISC, Evry, France
[3] CNRS, IMT Atlantique, LS2N, Nantes, France
[4] Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Reverse logistics; disassembly planning; collection of EOL products; disassembly equipment selection; robust optimisation; multi-criteria decision making; bi-objective optimisation; SAMPLE AVERAGE APPROXIMATION; INVENTORY ROUTING PROBLEM; LINE BALANCING PROBLEM; CHAIN DESIGN PROBLEM; SUPPLY CHAIN; OPTIMIZATION; UNCERTAINTY; ALGORITHM; PRODUCTS; LEVEL;
D O I
10.1080/00207543.2020.1723815
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The collection-disassembly problem plays an important role in a reverse supply chain. It coordinates the collection and disassembly activities for end-of-life (EOL) products. Most existing works consider the deterministic problems. However, in practice, demands of reusable components in EOL products may be uncertain. Besides, it is usually difficult to exactly obtain probability distributions of uncertain demands, due to inadequate historical data. This paper studies a collection-disassembly problem under partial known distributional information of component demands, in which equipments of the disassembly site, corresponding to different disassembly capacities, have to be selected. The objectives are to minimise the system cost and to maximise the customer service level. For the problem, a novel distributionally robust bi-objective formulation is proposed. Based on the Monte Carlo simulation and an ambiguity set, a sample average approximation (SAA) model and an approximated mixed integer programming (MIP) model are constructed, respectively. Then the two approximated formulations are solved, via the epsilon-constraint framework, and compared in numerical experiments.
引用
收藏
页码:1676 / 1690
页数:15
相关论文
共 42 条
[31]   Disassembly line balancing problem: a review of the state of the art and future directions [J].
Ozceylan, Eren ;
Kalayci, Can B. ;
Gungor, Askiner ;
Gupta, Surendra M. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (15-16) :4805-4827
[32]   Fuzzy mathematical programming approaches for reverse supply chain optimization with disassembly line balancing problem [J].
Ozceylan, Eren ;
Paksoy, Turan .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2014, 26 (04) :1969-1985
[33]   Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications [J].
Pagnoncelli, B. K. ;
Ahmed, S. ;
Shapiro, A. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2009, 142 (02) :399-416
[34]   A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty [J].
Sun, Hua ;
Gao, Ziyou ;
Szeto, W. Y. ;
Long, Jiancheng ;
Zhao, Fangxia .
NETWORKS & SPATIAL ECONOMICS, 2014, 14 (3-4) :409-433
[35]   Multicriteria scheduling problems: A survey [J].
T'kindt, V ;
Billaut, JC .
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (02) :143-163
[36]   A Hybrid Taguchi-Immune approach to optimize an integrated supply chain design problem with multiple shipping [J].
Tiwari, M. K. ;
Raghavendra, N. ;
Agrawal, Shubham ;
Goyal, S. K. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) :95-106
[37]   Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning [J].
Tuncel, Emre ;
Zeid, Abe ;
Kamarthi, Sagar .
JOURNAL OF INTELLIGENT MANUFACTURING, 2014, 25 (04) :647-659
[38]   Distributionally robust simple integer recourse [J].
Xie W. ;
Ahmed S. .
Computational Management Science, 2018, 15 (3-4) :351-367
[39]   AMBIGUOUS CHANCE-CONSTRAINED BINARY PROGRAMS UNDER MEAN-COVARIANCE INFORMATION [J].
Zhang, Yiling ;
Jiang, Ruiwei ;
Shen, Siqian .
SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (04) :2922-2944
[40]   Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks [J].
Zhang, Yiling ;
Shen, Siqian ;
Erdogan, S. Ayca .
OPTIMIZATION LETTERS, 2018, 12 (07) :1503-1521