A Modeling Framework for the Planning of Strategic Supply Chain Viewed from Complex Network


Based on the theory of complex network, this paper focuses on the planning of logistics nodes for strategic supply chain. I propose a practical mathematical modeling framework that simultaneously captures many practical aspects but still understated in the existing literatures of network planning problems. Moreover, capacity expansion and reduction sce-narios are also analyzed as well as modular capacity shifts for the fluctuation of demands. So this paper is of impor-tance for the research of network planning in strategic supply chain systems.

Share and Cite:

J. Zheng, "A Modeling Framework for the Planning of Strategic Supply Chain Viewed from Complex Network," Journal of Service Science and Management, Vol. 2 No. 2, 2009, pp. 129-135. doi: 10.4236/jssm.2009.22016.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] J. L. Moreno, “Who shall survive,” Beacon House, Bea-con, NY, 1934.
[2] D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small world’ networks,” Nature, No. 393, pp. 440-442, 1998.
[3] D. Erlenkotter, “A comparative study of approaches to dynamic location problems,” European Journal of Opera-tional Research, Vol. 6, pp. 133-143, 1981.
[4] C. O. Fong and V. Srinivasan, “The multi-region dynamic capacity expansion problem-Parts I and II,” Operations Research, No. 29, pp. 787-816, 1981.
[5] C. O. Fong and V. Srinivasan, “The multi-region dynamic capacity expansion problem: An improved heuristic,” Management Science, No. 32, pp. 1140-1152, 1986.
[6] S. K. Jacobsen, “Heuristic procedures for dynamic plant location,” Technical Report of the Institute of Mathemati-cal Statistics and Operations Research, 1977.
[7] D. J. Sweeney and R. L. Tatham, “An improved long-run model for multiple warehouse location,” Management Sci-ence, No. 22, pp. 748-758, 1976.
[8] T. Bender, H. Hennes, J. Kalcsics, M. T. Melo, and S. Nickel, “Location software and interface with GIS and supply chain management,” Berlin, Heidelberg: Springer, 2002.
[9] J. Kalcsics, T. Melo, S. Nickel, and V. Schmid-Lutz, “Facility location decisions in supply chain management,” Operations Research Proceedings, Vol. 3, pp. 467-472, 2000.
[10] Q. Wang, R. Batta, J. Bhadury, and C. M. Rump, “Budget constrained location problem with opening and closing of logistics nodes,” Computers and Operations Research, No. 30, pp. 2047-2069, 2003.
[11] M. Daskin, L. Snyder, and R. Berger, “Facility location in supply chain design,” Logistics Systems: Design and Op-timization, pp. 39–65, 2005.
[12] B. M. Beamon, “Supply chain design and analysis: Mod-els and methods,” International Journal of Production Economics, No. 55, pp.281–294, 1998.
[13] S. H. Owen and M. S. Daskin, “Strategic facility location: A review,” European Journal of Operational Research, No. 111, pp. 423–447, 1998.
[14] J.-F. Cordeau, F. Pasin, and M. M. Solomon, “An inte-grated model for logistics network design,” Annals of Op-erations Research, 144(1), pp. 59–82, 2006.
[15] G. Hamer-Lavoie and J. F. Cordeau, “Un mode`le pour la conception d’un re′seau de distribution avec localisation, affectation et stocks,” INFOR, No. 44, pp. 99–115, 2006.
[16] J. Dias, M. E. Captivo, and J. Climaco, “Capacitated dynamic location problems with opening, closure and re-opening of facilities,” IMA Journal of Management Mathematics, Vol. 17, No. 4, pp. 317–348, 2006.
[17] D. Vila, A. Martel, and R. Beauregard, “Designing logis-tics networks in divergent process industries: A method-ology and its application to the lumber industry,” Interna-tional Journal of Production Economics, 102(2), pp. 358–378, 2006.
[18] M. T. Melo, S. Nickel, and F. Saldanha da Gama, “Large-scale models for dynamic multi-commodity ca-pacitated facility location,” Technical Report 58, Fraun-hofer Institute for Industrial Mathematics (ITWM) Kaiserslautern, Germany, 2003.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.