Reverse Supply Chain Network Design Problem
Abstract
The reverse supply chain network design problem is formulated as a bilevel model. In the upper level, the total cost incurred in the reverse supply chain network is minimized subject to the budget constraint, among others, whereas in the lower level the corresponding flow pattern in the network is characterized by the variable demand equilibrium conditions; this is essentially a variation of the Wardrop second principle. A sensitivity analysis–based algorithm, with special treatment of the material conversion factor at each recycler processor agent, or both, is proposed for solutions. A numerical example is then provided for demonstration.
Get full access to this article
View all access and purchase options for this article.
References
1. Chen H. K., Chou C. Y., and Lai C. T. A Bilevel Dynamic Signal Timing Optimization Problem. Proc., 2004 IEEE International Conference on Networking, Sensing and Control, March 21–23, Taipei, Taiwan, 2004.
2. Chen H. K., Hsiao S. Y., Liao M. F., and Hsueh C. F. Sensitivity Analysis for the Dynamic Capacitated Origin-Destination Estimation Problem. Journal of the Eastern Asia Society for Transportation Studies, Vol. 5, 2003, pp. 1278–1293.
3. Gao Z. Y., Wu J. J., and Sun H. J. Solution Algorithm for the Bi-level Discrete Network Design Problem. Transportation Research, Vol. 39B, 2005, pp. 479–495.
4. LeBlanc L. J., and Abdulaal M. Continuous Equilibrium Network Design Models. Transportation Research, Vol. 13B, 1979, pp. 19–32.
5. LeBlanc L. J., and Abdulaal M. A Comparison of User-Optimum Versus System-Optimum Traffic Assignment in Transportation Network Design. Transportation Research, Vol. 18B, 1984, pp. 115–112.
6. Poorzahedy H., and Turnquist M. A. Approximate Algorithms for the Discrete Network Design Problem. Transportation Research, Vol. 16B, 1982, pp. 45–55.
7. Steenbrink A. Transport Network Optimization in the Dutch Integral Transportation Study. Transportation Research, Vol. 8B, 1974, pp. 11–27.
8. Chen H. K. Formulating the Reverse Supply Chain Network Equilibrium Problem. Proc., First International Conference on Transportation and Logistics, Singapore, 2005.
9. Chen H. K., and Chou H. W. Supply Chain Network Equilibrium with Asymmetric Variable Demand and Cost Functions. Working Paper. National Central University, Taiwan, 2005.
10. Chen H. K., and Chou H. W. A Time-Dependent Supply Chain Network Equilibrium Problem. In Global Integrated Supply Chain Systems: Analysis and Design (Lan Y. C., and Unhelkar B., eds.), Idea Group Publishing, 2006.
11. Chen H. K., and Chou H. W. A Solution Algorithm for the Supply Chain Network Equilibrium Problem. Proc., Eighth Pacific-Asia Conference on Information Systems, Shanghai, China, 2004.
12. Nagurney A., Dong J., and Zhang D. A Supply Chain Network Equilibrium Model. Transportation Research, Vol. 38E, 2002, pp. 281–303.
13. Nagurney A., and Toyasaki F. Reverse Supply Chain Management and Electronic Waste Recycling: A Multitiered Network Equilibrium Framework for E-Cycling. Transportation Research, Vol. 41E, 2005, pp. 1–28.
14. Tobin R. L. Sensitivity Analysis for Variational Inequalities. Journal of Optimization Theory and Applications, Vol. 48, No. 1, 1986, pp. 191–204.
15. Tobin R. L., and Friesz T. Sensitivity Analysis for Equilibrium Network Flow. Transportation Science, Vol. 22, No. 4, 1988, pp. 242–250.
16. Yang H., and Bell M. G. H. Sensitivity Analysis of Network Traffic Equilibria Revisited: The Corrected Approach. Submitted to Transportation Science, 2005.
17. Lewis R. M., Torczon V., and Trosset M. W. Direct Search Methods: Then and Now. Journal of Computational and Applied Mathematics, Vol. 124, 2000, pp. 191–207.
18. Hooke R., and Jeeves T. A. Direct Search Solution of Numerical and Statistical Problems. Journal of the Association for Computing Machinery, Vol. 8, 1961, pp. 212–229.
19. Nelder J. A., and Mead R. A Simplex for Function Minimization. Computer Journal, Vol. 7, 1965, pp. 308–313.
20. Chen H. K., and Tsai C. Y. Comparison of Solution Algorithms for the Bilevel Discrete Network Design Problem (in Chinese). Presented at the Institute of Transportation 20th Annual Conference, Taiwan, Nov. 2005.
21. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall Inc., Englewood Cliffs, N.J., 1985.
22. Frank M., and Wolfe P. An Algorithm for Quadratic Programming. Naval Research Logistics Quarterly, Vol. 3, 1961, pp. 95–110.
23. Jayakrishnan R., Tsai W. K., Prashker J. N., and Rajadhyaksha S. Faster Path-Based Algorithm for Traffic Assignment. In Transportation Research Record 1443, TRB, National Research Council, Washington D.C., 1994, pp. 75–83.
24. Bar-Gera H. Origin-Based Algorithms for Transportation Network Modeling. Ph.D. thesis. University of Illinois, Chicago, 1999; available online as Technical Report 103, National Institute of Statistical Sciences, Research Triangle Park, N.C. http://www.niss.org/.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published: January 2006
Issue published: January 2006
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 31
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 2
- Study on continuous network design problem using simulated annealing a...
- Study on continuous network design problem using simulated annealing a...
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
