考虑回收率提升效益的电子废弃物协作回收物流模式研究

doi:10.16381/j.cnki.issn1003-207x.2021.2444

Abstract

Abstract:

With the rapid economic growth， growing demand for high-tech products and decreasing service life of products， E-waste is surging. Due to its environmental pollution and the valuable resources contained， E-waste has become a focus. However， a very small percentage of used electronic products are recycled. One of the important reasons for this problem is the lack of economic and efficient recycling logistics mode. The existing E-waste recycling logistics mode ignores the collaboration between stakeholders， resulting in high cost and low recovery rate. Thus， a horizontal logistics cooperation is considered in which multiple enterprises collaboratively solve their logistics optimisation problem through the platform.In this study， this problem is modelled as an integer programming which minimizes vehicle routing costs and fixed costs for sub-alliances， named the multi-owner collaborative recycling vehicle routing problem model with time windows. Based on the model， the optimal results of routes planning can be solved. The total cost of each sub-alliance can also be quantified. Then， Shapley value method is used to allocate the total cost of the alliance. The recovery rate quantization function model in collaborative recycling logistics mode is constructed based on customer satisfaction and enterprise recovery efficiency.Through numerical experiments， the benefits of collaborative recycling are demonstrated and the influencing factors of cost saving and recovery rate are further discussed. The following conclusions are drawn： the cost of multi-owner collaborative recycling can reduced by 30%-40%. Compared with individual recycling， collaborative recovery rate can increase by more than 20%， and compared with traditional recovery， the recovery rate can even increase by more than 60%.Thus， the significant cost reduction and recovery rate improvement can be verified. In addition， the consideration of time windows can obtain higher recovery rate and collaboration shows to be particularly attractive for enterprises with more dispersed demand orders because of higher cost reduction.Collaborative recycling logistics mode proposed is an important supplement to the existing recycling mode， and its path optimization and cost allocation have wide application value in practical recycling. There are important reference value and practical significance for enterprises to choose collaborative recycling mechanism and relevant cost allocation.

Key words: collaborative recycling, cost allocation, time window, recovery rate

CLC Number:

Weizhen Rao,Shuqi Li,Zhixing Luo. Research on Collaborative Recycling Logistics Mode of E-waste Considering Recovery Rate Improvement[J]. Chinese Journal of Management Science, 2024, 32(9): 225-236.

Figures/Tables 18

符号	说明	符号	说明
$n$	所有加入协作回收的企业的数量或集合	$C j$	第 $j (1 ≤ j ≤ 2 n - 1)$ 个子联盟 $S j$ 企业待回收顾客集合
$m$	所有顾客的数量	$D j$	第 $j (1 ≤ j ≤ 2 n - 1)$ 个子联盟 $S j$ 企业回收中心集合
$m i$	第 $i$ 个企业的待回收顾客数量	$K j$	第 $j (1 ≤ j ≤ 2 n - 1)$ 个子联盟 $S j$ 所有企业的车辆集合
$N$	n个企业的待回收顾客集合 $N = {1,2, . . ., m}$	$f$	参与回收的每单位回收车辆的固定成本
$C i$	第 $i ? (1 ≤ i ≤ n)$ 个企业的待回收顾客集合 ${1,2, ?, m i}$	$v$	每单位运输距离产生的变动成本
$D$	n个企业回收中心集合， $D = {m + 1, m + 2, ?, m + n}$	$d s t$	任意两顾客或回收中心与顾客s、t之间的运输距离
$D i$	第 $i ? (1 ≤ i ≤ n)$ 个企业的回收中心集合 ${m + i}$	$d e f$	任意两回收中心间的运输距离
$K$	回收中心所派出的所有车辆的集合， $K = {1,2, ?, k}$	$T s t$	任意两顾客或回收中心个顾客s、t间的运输时间
$K i$	第 $i ? (1 ≤ i ≤ n)$ 个回收企业的车辆集合 ${1,2, ? k i}$	$a i$	第 $i ? (1 ≤ i ≤ m)$ 个顾客的到达时间
$Q$	回收车辆的最大载量	$s i$	第 $i ? (1 ≤ i ≤ m)$ 个顾客的服务时间
$L$	回收车辆允许的最大行驶距离	$e i$	第 $i ? (1 ≤ i ≤ m)$ 个顾客的最早到达时间
$q i$	第 $i ? (1 ≤ i ≤ m)$ 个顾客需求量，且 $0 ≤ q i ≤ Q$	$l i$	第 $i ? (1 ≤ i ≤ m)$ 个顾客的最晚到达时间
$S j$	第 $j (1 ≤ j ≤ 2 n - 1)$ 个企业子联盟，且 $S j ≠ ?$	$q ω$	第 $ω ? (ω ∈ C j)$ 个顾客的需求量
$x s t k$	0-1变量，等于1表示回收车辆 $k ∈ K j$ 经过弧(s, t)，其中 $s, t ∈ C j ? D j$ ，否则等于0	$Q e f$	需从回收中心 $e (e ∈ D j)$ 向回收中心 $f (f ∈ D j \ e)$ 调配的货物量
$y e f k$	0-1变量，等于1表示回收车辆 $k ∈ K j$ 经过弧(e, f)，其中 $e, f ∈ D j$ ，否则等于0	$Z ω e$	0-1变量，等于1表示顾客 $ω$ 由第 $e$ 个回收中心派出车辆服务，否则等于0

j	BS	$S j$	$d (j)$	$n v$	$C (S j)$
1	[0 0 0 1]	$4$	414.96	4	807.48
2	[0 0 1 0]	$3$	527.02	3	622.70
3	[0 0 1 1]	$3, ? 4$	812.93	6	1228.73
4	[0 1 0 0]	$2$	655.30	4	846.09
5	[0 1 0 1]	$2, ? 4$	817.47	6	1264.12
6	[0 1 1 0]	$2,3$	778.82	5	1043.78
7	[0 1 1 1]	$2, ? 3, ? 4$	972.92	7	1494.00
8	[1 0 0 0]	$1$	345.39	3	639.67
9	[1 0 0 1]	$1, ? 4$	657.46	5	1083.71
10	[1 0 1 0]	$1, ? 3$	492.18	5	1013.51
11	[1 0 1 1]	$1, ? 3, ? 4$	728.25	7	1456.46
12	[1 1 0 0]	$1, ? 2$	588.41	5	1077.65
13	[1 1 0 1]	$1, ? 2, ? 4$	888.01	8	1608.73
14	[1 1 1 0]	$1, ? 2, ? 3$	379.34	7	1439.41
15	[1 1 1 1]	$1, ? 2, ? 3, ? 4$	667.42	9	1836.46

分摊方法	指标	企业1	企业2	企业3	企业4
Shapley值法	C_i	639.67	846.09	622.70	807.48
	$φ i$	401.08	517.51	375.70	542.16
	$S C i$	238.59	328.58	247.00	265.32
	$S R i$ (%)	37.30	38.84	39.67	32.86

j	BS	$S j$	$d (j)$	$n v$	$C (S j)$
1	[0 0 0 1]	$4$	351.12	3	625.56
2	[0 0 1 0]	$3$	318.98	3	609.49
3	[0 0 1 1]	$3, ? 4$	501.67	5	1000.83
4	[0 1 0 0]	$2$	370.51	3	635.25
5	[0 1 0 1]	$2, ? 4$	501.64	4	850.82
6	[0 1 1 0]	$2,3$	475.41	4	837.70
7	[0 1 1 1]	$2, ? 3, ? 4$	667.39	6	1233.69
8	[1 0 0 0]	$1$	319.73	3	609.87
9	[1 0 0 1]	$1, ? 4$	473.13	4	836.57
10	[1 0 1 0]	$1, ? 3$	465.04	4	832.52
11	[1 0 1 1]	$1, ? 3, ? 4$	641.18	6	1220.59
12	[1 1 0 0]	$1, ? 2$	504.19	4	852.09
13	[1 1 0 1]	$1, ? 2, ? 4$	676.26	6	1238.13
14	[1 1 1 0]	$1, ? 2, ? 3$	633.88	6	1216.94
15	[1 1 1 1]	$1, ? 2, ? 3, ? 4$	806.66	8	1603.33

方法	指标	企业1	企业2	企业3	企业4	总成本
Shapley值法	$φ i$	401.08	517.51	375.70	542.16	1836.45
Shapley值法	$φ i'$	381.31	397.38	404.68	419.96	1605.33

References 32

1	胡秀芳. 联合国发布《2020年全球电子废弃物监测》报告人均年产生电子废物7.3公斤［EB/OL］. （2020-07- 14）［2022-4-17］..
	Hu X F. The United Nations has released the “Global E-Waste Monitor 2020” report showing that the average person generates 7.3 kilograms of electronic waste per year.［EB/OL］.（2020-07-14）［2022-4-17］..
2	Liu S， He L， Shen Z J M. On-time last-mile delivery： Order assignment with travel-time predictors［J］. Management Science， 2021， 67（7）： 4095-4119.
3	李勇建，冯立攀，赵秀堃，等. 新运营时代的逆向物流研究进展与展望［J］. 系统工程理论与实践， 2020， 40（8）： 2008-2022.
	Li Y J， Feng L P， Zhao X K， et al. Overview on reverse logistics management research in new era of operations management［J］.Systems Engineering—Theory & Practice， 2020， 40（8）： 2008-2022.
4	Savaskan R C， Bhattacharya S， Van Wassenhove L N. Closed-loop supply chain models with product remanu- facturing［J］. Management Science， 2004， 50（2）： 239-252.
5	夏西强，朱庆华. 政府不同补贴策略对单/双渠道回收影响研究［J］. 中国管理科学， 2021， 29（11）： 88-98.
	Xia X Q， Zhu Q H. Study on the impact of different government subsidy strategies on single/double recycling channels［J］. Chinese Journal of Management Science， 2021， 29（11）： 88-98.
6	蒲松，夏嫦. 基于二阶段随机规划的城市医疗废弃物回收网络设计［J］. 中国管理科学， 2021， 29（5）： 166-172.
	Pu S， Xia C. A two-stage stochastic programming approach for urban medical waste recycling network design［J］. Chinese Journal of Management Science， 2021， 29（5）： 166-172.
7	Wang Y， Ma X L， Liu M W， et al. Cooperation and profit allocation in two-echelon logistics joint distribution network optimization［J］. Applied Soft Computing， 2017， 56： 143-157.
8	Ghosh D， Gouda S， Shankar R， et al. Strategic decision making under subscription-based contracts for remanufacturing［J］. International Journal of Production Economics， 2018， 200： 134-150.
9	Defryn C， Sörensen K. Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation［J］. European Journal of Operational Research， 2018， 267（3）： 891-903.
10	Van Zon M， Spliet R， Van den Heuvel W. The joint network vehicle routing game［J］. Transportation Science， 2021， 55（1）： 179-195.
11	Tian F， Sošić G， Debo L. Manufacturers’ competition and cooperation in sustainability： Stable recycling alliances［J］. Management Science， 2019， 65（10）： 4733-4753.
12	徐小峰，林姿汝，周鹏. 多油品供给受限下多油库被动配送车辆路径问题研究［J］. 中国管理科学， 2021， 29（5）： 157-165.
	Xu X F， Lin Z R， Zhou P. Research on vehicle routing problem of multiple oil depot passive distribution under multi oil supply constraints［J］. Chinese Journal of Management Science， 2021， 29（5）： 157-165.
13	徐小峰，姜明月，邓忆瑞. 整合逆向物流协同配送动态路径优化问题研究［J］. 管理科学学报， 2021， 24（10）： 106-126.
	Xu X F， Jiang M Y， Deng Y R. Dynamic vehicle routing problem with simultaneous pickup and delivery in collaborative distribution under demand concurrent［J］. Journal of Management Sciences in China， 2021， 24（10）： 106-126.
14	Lu Z， Ma C L， Wang K， et al. Multi-depot multi-trip vehicle routing problem with time windows and release dates［J］. Transportation Research Part E： Logistics and Transportation Review， 2020， 135： 101866.
15	Yang F， Dai Y， Ma Z J. A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas［J］. Transportation Research. Part E， Logistics and Transportation Review， 2020， 141： 102024.
16	Song R D， Lau H C， Luo X， et al. Coordinated delivery to shopping malls with limited docking capacity［J］. Transportation Science， 2022， 56（2）： 501-527.
17	饶卫振，徐丰，朱庆华，等. 依托平台协作配送成本分摊的有效方法研究［J］. 管理科学学报， 2021， 24（9）： 105-126.
	Rao W Z， Xu F， Zhou Q H， et al. Fair and effective cost-sharing method for collaborative distribution based on a third-party platform［J］. Journal of Management Sciences in China， 2021， 24（9）： 105-126.
18	Shapley L S. A value for n-person games［J］. Contributions to the Theory of Games，1953， 28： 307-317.
19	Schmeidler D. The nucleolus of a characteristic function game［J］. Siam Journal on Applied Mathematics，1969， 17（6）： 1163-1170.
20	Chen M Z， Zhang S， Zhang W Y， et al. Colla- borative vehicle routing problem with rough location usi- ng extended ant colony optimization algorithm［J］. Journal of Intelligent & Fuzzy Systems， 2019， 37（2）： 2385-2402.
21	饶卫振，朱庆华，金淳，等. 协作车辆路径成本分摊问题的B-T Shapley方法［J］. 管理科学学报， 2019， 22（1）： 107-126.
	Rao W Z， Zhu Q H， Jin C， et al. A binary tree shapely method for cost sharing of the collaborative vehicle routing problem［J］. Journal of Management Sciences in China， 2019， 22（1）： 107-126.
22	李欣，穆东. 动力电池闭环供应链回收定价与协调机制研究［J］. 软科学， 2018， 32（11）： 124-129.
	Li X， Mu D. Recycling price decision and coordina- ted mechanism of electrical vehicle battery closed-loop supply chain［J］. Soft Science， 2018， 32（11）： 124-129.
23	Shapley L S. Cores of convex games［J］. International Journal of Game Theory， 1971， 1（1）： 11-26.
24	胡石清. 社会合作中利益如何分配？——超越夏普利值的合作博弈 “宗系解”［J］. 管理世界， 2018， 34（6）： 83-93.
	Hu S Q. How to distribute the benefits in social coop- eration？ “The Clique Solution” of cooperative game surp- assing shapley value［J］. Management World， 2018， 34（6）： 83-93.
25	郑小雪，刘志，李登峰，等. 基于多选择目标规划方法的生产者责任组织成本分摊合作博弈研究［J］. 系统工程理论与实践， 2021， 41（10）： 2512-2523.
	Zheng X X， Liu Z， Li D F， et al. Research on cooperative game for cost sharing of producer responsibility organization based on multi-choice goal programming method［J］. Systems Engineering—Theory & Practice， 2021， 41（10）： 2512-2523.
26	Ferrell W， Ellis K， Kaminsky P， et al. Horizontal collaboration： Opportunities for improved logistics planning［J］. International Journal of Production Research， 2020， 58（14）： 4267-4284.
27	Krajewska M A， Kopfer H， Laporte G， et al. Horizontal cooperation among freight carriers： Request allocation and profit sharing［J］. Journal of the Operational Research Society， 2008， 59（11）： 1483-1491.
28	Gansterer M， Hartl R F. Collaborative vehicle routing： A survey［J］. European Journal of Operational Research， 2018， 268（1）： 1-12.
29	Luo Z X， Qin H， Zhang D Z， et al. Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost［J］. Transportation Research Part E： Logistics and Transportation Review， 2016， 85： 69-89.
30	张杨，但斌，高华丽. 客户满意度视角下面向产品服务系统订单的调度问题研究［J］. 管理工程学报， 2021， 35（5）： 202-211.
	Zhang Y， Dan B， Gao H L. The order scheduling problem of product-service system from the perspective of customer satisfaction［J］.Journal of Industrial Engineering and Engineering Management， 2021， 35（5）： 202-211.
31	陈萍，李航.基于时间满意度的O2O外卖配送路径优化问题研究［J］.中国管理科学，2016，24（S1）： 170-176.
	Chen P， Li H. Optimization model and algorithm b- ased on time satisfaction for O2O food delivery［J］. Chinese Journal of Management Science，2016，24（S1）： 170-176.
32	Sarath P， Bonda S， Mohanty S， et al. Mobile phone waste management and recycling： Views and trends［J］. Waste Management， 2015， 46： 536-554.

协作回收模式	价格满意度	时间满意度	回收效率	回收率
考虑时间窗	0.6359	1.0000	0.9450	0.7592
不考虑时间窗	0.6359	0.6614	1.0000	0.6476

[1]	Weizhen Rao, Yue Chang, Peng Liu. Research on Cooperative Recycling Operation Method of New Energy Vehicle Power Battery [J]. Chinese Journal of Management Science, 2025, 33(9): 325-338.
[2]	Bing Su, Xiangwen Chen, Meng Zhang, Hao Ji, Lulu Sun, Yang Xu, Qing’e Guo, Guohui Lin. Research on Route Selection for Emergency Supply Distribution Based on Dual Losses of Shortage and Delay [J]. Chinese Journal of Management Science, 2025, 33(8): 209-217.
[3]	Shuai Zhang, Siliang Liu, Wenyu Zhang. Vehicle Routing Problems with Time Windows under the Collaborative Delivery Mode of Electric Vehicle-drone [J]. Chinese Journal of Management Science, 2025, 33(4): 131-141.
[4]	Jie Yang, Xin Zhang, Dengfeng Li. Cost Allocation Strategy of Joint Procurement with Level Coalition Structures and Uncertain Demand [J]. Chinese Journal of Management Science, 2025, 33(2): 195-206.
[5]	Yao Wen, Qingxian An, Yongli Li. Cost DEA Game and Cost Allocation Method Considering the Relative Competitiveness of Decision-making Units [J]. Chinese Journal of Management Science, 2025, 33(2): 71-83.
[6]	Daoping Wang,Ke Zhang,Yu Zhou. Differential Game of Closed-Loop Supply Chain with Dynamic Stochastic Recovery Rate under Reward-penalty Mechanism of Government [J]. Chinese Journal of Management Science, 2024, 32(5): 158-170.
[7]	Tingting Ji,Shoufeng Ji,Yongkang Hu,Pengyun Zhao. Distributor Delivery Strategies considering Lead Time and Demand-Supply Interactions under Four Carbon Constraints [J]. Chinese Journal of Management Science, 2024, 32(3): 266-277.
[8]	Jingqi Ding, Naiming Xie, Shaoxiang Zheng. Research of Hot Compression Molding Batch Scheduling for Aerospace Composite Manufacturing with Material External Time Window Constraints [J]. Chinese Journal of Management Science, 2024, 32(12): 130-139.
[9]	Xinyue Zhang,Peng Jin,Xiaoxuan Hu,Moning Zhu. Research on the Time-dependent Multi-depot Open Vehicle Routing Problem with Time Windows [J]. Chinese Journal of Management Science, 2024, 32(1): 146-157.
[10]	Xiao-yan GU,Liang CHEN,Qian LIU,Meng-di MU,Deng-sheng WU. Research on Grazing Path Planning with Time Window under Grass Livestock Balance Constraints [J]. Chinese Journal of Management Science, 2023, 31(8): 184-192.
[11]	HE Pei-yang, LI Kun-peng, TIAN Qian-nan. The Integrated Production and Transportation Scheduling Problem Based on 3D Printing Technology [J]. Chinese Journal of Management Science, 2023, 31(4): 239-249.
[12]	FAN Li-wei, DONG Huan-huan, JIAN Ling. A Decomposition Ensemble Model with Sliding Time Window for Forecasting Carbon Market Prices [J]. Chinese Journal of Management Science, 2023, 31(1): 277-286.
[13]	HUANG Xiao-ling, CHEN Huan-ping, GAO Xiao-nan, WANG Dan, LIU Jin-ping, CHEN Ji-hong. Deliverysplit Milkrun and Supplyhub Collaborate to Optimize Automobiles Parts Inbound logistics [J]. Chinese Journal of Management Science, 2022, 30(7): 59-68.
[14]	LI Nan, CHEN Mu-zi, YANG Xiao-guang. Research on the Influence Mechanism of Legal Environment on the Recovery of Non-performing Loans [J]. Chinese Journal of Management Science, 2022, 30(10): 60-71.
[15]	GUO Dong-wei, DING Gen-hong, LIU Wei. Improved Multi-Strategy Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows [J]. Chinese Journal of Management Science, 2020, 28(7): 204-211.

Research on Collaborative Recycling Logistics Mode of E-waste Considering Recovery Rate Improvement

RichHTML

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 18

References 32

Related Articles 15

Metrics

Comments

Recommended 0