On the modeling and solution algorithm for the reverse logistics recycling flow equilibrium problem

被引:23
作者
Chen, Huey-Kuo [1 ]
Chou, Huey-Wen
Chiu, Yi-Chang
机构
[1] Natl Cent Univ, Dept Civil Engn, Chungli, Taiwan
[2] Natl Cent Univ, Dept Informat Management, Chungli, Taiwan
[3] Univ Arizona, Dept Civil Engn & Engn Mech, Tucson, AZ 85721 USA
关键词
reverse logistics; recycling; network equilibrium; variational inequality; nested diagonalization method; conversion factor; policy making;
D O I
10.1016/j.trc.2007.05.001
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper presents a study that characterizes, formulates, and solves the reverse logistic recycling flow equilibrium problem. The RLRFE problem is concerned with the recycling channel in which recyclable collectors, processors, landfills, and demand markets form a multi-tiered network to process the recycled material flows from sources deseither for landfills or demand markets. Motivated by a government policy making or enterprise conglomerate recycling system design and operation needs, the RLRFE problem is elaborated from a system-optimal perspective using the variational inequality (VI) approach. For each origin-destination (013) pair, the corresponding equilibrium conditions are established as a variation of the Wardrop second principle. In light of demand and cost function interactions, a nested diagonalization solution (ND) algorithm is proposed that gradually transforms the RLRFE problem into a traffic assignment model. To address multiple landfills in the recycling network and to understand how a variable-demand problem can be analyzed as a fixed-demand problem, we propose a supernetwork representation of the RLRFE problem. A numerical on a test case illustrates the model formulation and the proposed algorithm. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:218 / 234
页数:17
相关论文
共 31 条
[1]   ON CONVERGENCE OF THE PIES ALGORITHM FOR COMPUTING EQUILIBRIA [J].
AHN, BH ;
HOGAN, WW .
OPERATIONS RESEARCH, 1982, 30 (02) :281-300
[2]  
BARGERA H, 1999, THESIS U ILLINOIS CH
[3]  
CHEN H, 2005, 84 ANN M TRANSP RES
[4]  
Chen H. K., 2006, GLOBAL INTEGRATED SU, P217, DOI 10.4018/978-1-59140-611-2.ch014
[5]   Dynamic capacitated user-optimal departure time/route choice problem with time-window [J].
Chen, HK ;
Chang, MS ;
Wang, CY .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 132 (03) :603-618
[6]  
CHEN HK, 2004, P PAC AS C INF SYST
[7]   RELAXATION ALGORITHMS FOR THE GENERAL ASYMMETRIC TRAFFIC EQUILIBRIUM PROBLEM [J].
DAFERMOS, S .
TRANSPORTATION SCIENCE, 1982, 16 (02) :231-240
[8]  
FLORIAN M, 1981, PUBLICATION, V198
[9]   OPTIMAL TRAFFIC ASSIGNMENT WITH ELASTIC DEMANDS - A REVIEW .2. ALGORITHMIC APPROACHES [J].
GARTNER, NH .
TRANSPORTATION SCIENCE, 1980, 14 (02) :192-208
[10]  
Halluite J., 2005, Corporate Social Responsibility and Environmental Management, V12, P31, DOI 10.1002/csr.75