Reverse supply chain network design problem

Transportation Research Record

Volumn , Issue 1964, 2006, Pages 42-49

  Chen, Huey Kuo ^a   Chou, Huey Wen ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COST EFFECTIVENESS; PROBLEM SOLVING; RETAIL STORES; SENSITIVITY ANALYSIS;

BILEVEL MODEL; RECYCLER PROCESSOR AGENTS; SUPPLY CHAIN NETWORK; WARDROP SECOND PRINCIPLE;

REVERSE ENGINEERING;

EID: 33846875680     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1964-06     Document Type: Conference Paper

References (24)

1. Chen, H. K., C. Y. Chou, and C. T. Lai. 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., S. Y. Hsiao, M. F. Liao, and C. F. Hsueh. 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., J. J. Wu, and H. J. Sun. Solution Algorithm for the Bi-level Discrete Network Design Problem. Transportation Research, Vol. 39B, 2005, pp. 479-495.
4. LeBlanc, L. J., and M. Abdulaal. Continuous Equilibrium Network Design Models. Transportation Research, Vol. 13B, 1979, pp. 19-32.
5. LeBlanc, L. J., and M. Abdulaal. 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 M. A. Turnquist. 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 H. W. Chou. Supply Chain Network Equilibrium with Asymmetric Variable Demand and Cost Functions. Working Paper. National Central University, Taiwan, 2005.
10. Chen, H. K., and H. W. Chou. A Time-Dependent Supply Chain Network Equilibrium Problem. In Global Integrated Supply Chain Systems: Analysis and Design (Y. C. Lan and B. Unhelkar, eds.), Idea Group Publishing, 2006.
11. Chen, H. K., and H. W. Chou. A Solution Algorithm for the Supply Chain Network Equilibrium Problem. Proc., Eighth Pacific-Asia Conference on Information Systems, Shanghai, China, 2004.
12. Nagurney, A., J. Dong, and D. Zhang. A Supply Chain Network Equilibrium Model. Transportation Research, Vol. 38E, 2002, pp. 281-303.
13. Nagurney, A., and F. Toyasaki. 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 T. Friesz. Sensitivity Analysis for Equilibrium Network Flow. Transportation Science, Vol. 22, No. 4, 1988, pp. 242-250.
16. Yang, H., and M. G. H. Bell. Sensitivity Analysis of Network Traffic Equilibria Revisited: The Corrected Approach. Submitted to Transportation Science, 2005.
17. Lewis, R. M., V. Torczon, and M. W. Trosset. Direct Search Methods: Then and Now. Journal of Computational and Applied Mathematics, Vol. 124, 2000, pp. 191-207.
18. Hooke, R., and T. A. Jeeves. 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 R. Mead. A Simplex for Function Minimization. Computer Journal, Vol. 7, 1965, pp. 308-313.
20. Chen, H. K., and C. Y.Tsai. 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 P. Wolfe. An Algorithm for Quadratic Programming. Naval Research Logistics Quarterly, Vol. 3, 1961, pp. 95-110.
23. Jayakrishnan, R., W. K. Tsai, J. N. Prashker, and S. Rajadhyaksha. 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/.