Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 480127, 13 pages
http://dx.doi.org/10.1155/2014/480127
Research Article

On the Transformation Mechanism for Formulating a Multiproduct Two-Layer Supply Chain Network Design Problem as a Network Flow Model

School of Transportation, Traffic and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 610031, China

Received 5 July 2013; Revised 15 December 2013; Accepted 29 December 2013; Published 20 February 2014

Academic Editor: Dongdong Ge

Copyright © 2014 Mi Gan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. Altiparmak, M. Gen, L. Lin, and I. Karaoglan, “A steady-state genetic algorithm for multi-product supply chain network design,” Computers and Industrial Engineering, vol. 56, no. 2, pp. 521–537, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. W. Wilhelm, D. Liang, B. Rao, D. Warrier, X. Zhu, and S. Bulusu, “Design of international assembly systems and their supply chains under NAFTA,” Transportation Research E, vol. 41, no. 6, pp. 467–493, 2005. View at Publisher · View at Google Scholar · View at Scopus
  3. M. S. Daskin, A. P. Hurter, and M. G. VanBuer, “Toward an intergrated model of facility location and transportation network design,” Working Paper, The Transportation Center, Northwestern University, 1993. View at Google Scholar
  4. S. Melkote and M. S. Daskin, “An integrated model of facility location and transportation network design,” Transportation Research A, vol. 35, no. 6, pp. 515–538, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Nagurney, T. Woolley, and Q. Qiang, “Multiproduct supply chain horizontal network integration: models, theory, and computational results,” International Transactions in Operational Research, vol. 17, no. 3, pp. 333–349, 2010. View at Publisher · View at Google Scholar
  6. A. Nagurney, A. H. Masoumi, and M. Yu, “Supply chain network operations management of a blood banking system with cost and risk minimization,” Computational Management Science, vol. 9, no. 2, pp. 205–231, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. R. Z. Farahani, S. Rezapour, T. Drezner, and S. Fallah, “Competitive supply chain network design: an overview of classifications, models, solution techniques and applications,” Omega, 2013. View at Publisher · View at Google Scholar
  8. K. E. Caggiano, P. L. Jackson, J. A. Muckstadt, and J. A. Rappold, “Efficient computation of time-based customer service levels in a multi-item, multi-echelon supply chain: a practical approach for inventory optimization,” European Journal of Operational Research, vol. 199, no. 3, pp. 744–749, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. P. Tsiakis, N. Shah, and C. C. Pantelides, “Design of multi-echelon supply chain networks under demand uncertainty,” Industrial and Engineering Chemistry Research, vol. 40, no. 16, pp. 3585–3604, 2001. View at Google Scholar · View at Scopus
  10. R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan, “Finding minimum-cost flows by double scaling,” Mathematical Programming, vol. 53, no. 1–3, pp. 243–266, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. R. K. Ahuja and J. B. Orlin, “Equivalence of the primal and dual simplex algorithms for the maximum flow problem,” Operations Research Letters, vol. 20, no. 3, pp. 101–108, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. A. V. Goldberg and R. E. Tarjan, “Finding minimum-cost circulations by successive approximation,” Mathematics of Operations Research, vol. 15, no. 3, pp. 430–466, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. A. Jabbarzadeh, S. G. J. Naini, H. Davoudpour, and N. Azad, “Designing a supply chain network under the risk of disruptions,” Mathematical Problems in Engineering, vol. 2012, Article ID 234324, 23 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. M. Abbasi, R. Hosnavi, and M. Mohammadi, “Designing a fuzzy strategic integrated multiechelon agile supply chain network,” Journal of Optimization, vol. 2013, Article ID 543604, 16 pages, 2013. View at Publisher · View at Google Scholar
  15. G. Zhou, Y. Yang, and J. Cao, “Competition and integration in closed-loop supply chain network with variational inequality,” Mathematical Problems in Engineering, vol. 2012, Article ID 524809, 21 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. F. Hanssmann, “Optimal inventory location and control in production and distribution networks,” Operations Research, vol. 7, pp. 483–498, 1959. View at Publisher · View at Google Scholar · View at MathSciNet
  17. A. M. Geoffrion and G. W. Graves, “Multicommodity distribution system design by Benders decomposition,” Management Science, vol. 20, no. 5, pp. 822–844, 1974. View at Google Scholar · View at Scopus
  18. V. Jayaraman and H. Pirkul, “Planning and coordination of production and distribution facilities for multiple commodities,” European Journal of Operational Research, vol. 133, no. 2, pp. 394–408, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. R. B. Handfield and E. L. Nichols Jr., Supply Chain Redesign: Transforming Supply Chains into Integrated Value Systems, Financial Times Prentice Hall Books, FT Press, Prentice Hall, Upper Saddle River, NJ, USA, 2002.
  20. S. S. Syam, “A model and methodologies for the location problem with logistical components,” Computers and Operations Research, vol. 29, no. 9, pp. 1173–1193, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. Y. J. Jang, S. Y. Jang, B. M. Chang, and J. Park, “A combined model of network design and production/distribution planning for a supply network,” Computers and Industrial Engineering, vol. 43, no. 1-2, pp. 263–281, 2002. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Syarif, Y. Yun, and M. Gen, “Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach,” Computers and Industrial Engineering, vol. 43, no. 1-2, pp. 299–314, 2002. View at Publisher · View at Google Scholar · View at Scopus
  23. V. Jayaraman and A. Ross, “A simulated annealing methodology to distribution network design and management,” European Journal of Operational Research, vol. 144, no. 3, pp. 629–645, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. W. C. Yeh, “A hybrid heuristic algorithm for the multistage supply chain network problem,” International Journal of Advanced Manufacturing Technology, vol. 26, no. 5-6, pp. 675–685, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. W. C. Yeh, “An efficient memetic algorithm for the multi-stage supply chain network problem,” International Journal of Advanced Manufacturing Technology, vol. 29, no. 7-8, pp. 803–813, 2006. View at Publisher · View at Google Scholar · View at Scopus
  26. C. J. Solo, Multi-objective, integrated supply chain design and operation under uncertainty [Ph.D. thesis], The Pennsylvania State University, 2009.
  27. H. Y. Mak, Integrated supply chain design under uncertainty [Ph.D. thesis], University of California, Berkeley, Berkeley, Calif, USA, 2009.
  28. F. Pan and R. Nagi, “Multi-echelon supply chain network design in agile manufacturing,” Omega, vol. 41, no. 6, pp. 969–983, 2013. View at Publisher · View at Google Scholar
  29. R. K. Ahuja and H. W. Hamacher, “A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy,” Networks, vol. 45, no. 1, pp. 36–41, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  30. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows—Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, USA, 1993. View at MathSciNet
  31. P. T. Sokkalingam and P. Sharma, “A combinatorial arc tolerance analysis for network flow problems,” Journal of Applied Mathematics and Decision Sciences, vol. 2005, no. 2, pp. 83–94, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  32. Y. Sheffi, Transportation network equilibrium with discrete choice models [Ph.D. thesis], Civil Engineering Department, Massachusetts Institute of Technology, Cambridge, Mass, USA, 1978.
  33. A. Nagurney and J. F. Smith, Supernetworks: Decision-Making for the Information Age, Edward Elgar Publishing, 2002.
  34. A. Nagurney, “Optimal supply chain network design and redesign at minimal total cost and with demand satisfaction,” International Journal of Production Economics, vol. 128, no. 1, pp. 200–208, 2010. View at Publisher · View at Google Scholar · View at Scopus
  35. P. T. Sokkalingam and P. Sharma, “A combinatorial arc tolerance analysis for network flow problems,” Journal of Applied Mathematics and Decision Sciences, vol. 2005, no. 2, pp. 83–94, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  36. U. S. Palekar, M. H. Karwan, and S. Zionts, “A branch-and-bound method for the fixed charge transportation problem,” Management Science, vol. 36, no. 9, pp. 1092–1105, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  37. N. Jawahar and A. N. Balaji, “A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge,” European Journal of Operational Research, vol. 194, no. 2, pp. 496–537, 2009. View at Publisher · View at Google Scholar · View at Scopus