.png){kind=icon}
.png){kind=icon}
Return
On the modeling and solution algorithm for the reverse logistics recycling flow equilibrium problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2007.05.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
reverse logistics
recycling
network equilibrium
variational inequality
nested diagonalization method
conversion factor
policy making
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.9
Papers:
4.7K
Citations:
3.2W
Organization
No organization information available