Designing Dynamic Demand Networks Considering Agility and Security Measures

Document Type : Research Paper

Authors

Young Researchers and Elite Club, Qazvin Branch, Islamic Azad University, Qazvin, I.R. Iran

Abstract

Responsibility in demand networks is one of the most important measures of performance. The concept of agility and flexibility in service and production. Variety and changes in demand need more flexible network design that can cope with potential shortage and delay. This paper presents new mathematical model to optimize the design of demand network when there are highly variable demands. It also takes security measures into the accounts that lead to the less discoverable nodes and centers in the network. The final mixed integer linear programming model has been applied on a real system and the results have been discussed at the end of the paper.

Keywords

Main Subjects

References

  1.  Cánez, L. E., Platts, K. W., and Probert, D. R. (2000). “Developing a framework for make-or-buy decisions.” Int J. of Oper & Prod Mgmt., Vol. 20, No. 11, 1313–1330.
  2.  Humphreys, P., McIvor, R., and Huang, G. (2002). “An expert system for evaluating the make or buy decision.” Comp & Ind Eng, Vol. 42, No. 2–4, 567–585.
  3.  Probert, D. (1997). Developing a make or buy strategy for manufacturing business, Institution of Electrical Engineers, London.
  4.  Fischer, D. and Hafen, U. (1997). “Immer wieder die gleichen Fehler.” io Management Zeitschrift Industrielle Organisation, Vol. 66, No. 6, 38–45.
  5.  Micklethwait, J. and Wooldridge, A. (1996). The Witch Doctors - What the Management Gurus are Saying, Why it Matters and How to Make Sense of it, Heinemann, London.
  6.  Capello, R. (1996). “Industrial Enterprises and Economic Space: the Network Paradigm.” Euro Plann Stud, Vol. 4, No. 4, 485–498.
  7.  Miles, R. E. and Snow, C. C. (1984). “Fit, Failure and the Hall of Fame.” California Mgmt. Rev, Vol. 26, No. 3, 11–28.
  8.  Friedrich, S. A. (2000). “Was ist “Core” und was ist “Non-Core”?” io Management, Vol. 69, No. 4, 18–23.
  9.  Nagel, R. N., Dove, R., Goldman, S., and Preiss, K. (1991). 21st Century Manufacturing Enterprise Strategy: An Industry Led View, Iacocca Institute/Lehigh University, Bethlehem, PA.
  10.  Burgess, T. F. (1994). “Making the Leap to Agility: Defining and Achieving Agile Manufacturing through Business Process Redesign and Business Network Redesign.” Int J.of Oper & Prod Mgmt., Vol. 14, No. 11, 23–34.
  11.  Katayama, H. and Bennett, D. J. (1999). “Agility, Adaptability and Leanness: A Comparison of Concepts and a Study of Practice.” Int J. of Prod Econ, Vol. 60–61 No. 1, 43–51.
  12.  Vinodh, S. (2011). “Axiomatic modelling of agile production system design.” Int J. of Prod Res, 49:11, 3251-3269.
  13.  Hale, T. S. and Moberg, C. R. (2003). “Location science research: a review.” Annals of Oper Res, 123, 21-35.
  14.  Current, J., Daskin, M., and Schilling, D. (2002). “Discrete network location models.” in Facility location: applications and theory, Z. Drezner and H. Hamacher (Eds), Springer-Verlag, Berlin, 81-118.
  15.  Sridharan, R. (1995). “The capacitated plant location problem”. Euro J. of Oper Res, 87: 203-21 3.
  16.  Drezner, Z., Klamroth, K., Schobel, A., and Wesolowsky, G. (2002). “The Weber problem”. in Facility Location: Applications and Theory, Z. Dezner & H. W. Hamacher (Eds), Springer-Verlag, Heidelberg: 1-36.
  17.  Cooper, L. (1963). “Location-allocation problems.” Oper Res, 11: 331-343.
  18.  Berman, O., Drezner, Z., and Wesolowsky, G. O. (2002). “The collection depots location problem on networks.” Naval Res Log, 49:.1 5-24.
  19.  Hakimi, S. L. (1964). “Optimum locations of switching centers and the absolute centers and medians of a graph.” Oper Res, 12: 450-459.
  20.  Hakimi, S. L. (1965). “Optimum distribution of switching centers in a communication network and some related graph theoretic problems.” Oper Res, 13: 462-475.
  21.  Mladenovic’, N., Labbe’, M., and Hansen, P. (2003). “Solving the p-center problem with tabu search and variable neighborhood search.” Networks, 42 (1): 48—64.
  22.  Murray, A. T. and Gerrard, R. A. (1997). “Capacitated service and regional constraints in location-allocation modeling.” Location Sci, 5 (2): 103-118.
  23.  Al-Sultan, K. S. and Al-Fawzan, M. A. (1999). “A tabu search approach to the uncapacitated facility location.” Annals of Oper Res, 86: 91—103.
  24.  Zhou, J. (2000). “Uncapacitated facility layout problem with stochastic demands”. Proc. of the 6th National Conf of Oper Res Society of China. Changsha, China, October 1O15, X. Hang, J. Wang, B. Liu & D. Liu. (Eds), Global-Link Publishing Company, Hong-Kong: 904-91 1. 131.
  25.  Ghosh, D. (2003). “Neighborhood search heuristics for the uncapacitated facility location problem.” Euro J. of Oper Res, 150: 150-1 62.
  26.  Church, R. L. and ReVelle, C. S. (1976). “Theoretical and computational links between the p-median location set-covering and the maximal covering location problem.” Geo. Analysis, 8: 406-415.
  27.  Campbell, J. F., Ernst, A. T., and Krishnamoorthy, M. (2002). “Hub location problems.” in Facility Location: Applications and Theory, Z. Dezner & H. W. Hamacher (Eds), Springer-Verlag, Heidelberg: 81-118.
  28.  Krarup, J., Pisinger, D., and Plasria, F. (2002). “Discrete location problems with push-pull objectives.” Disc. Appl. Math., 123: 267-378.
  29.  Jena, S. D., Cordeau, J. F., and Gendron, B. (2013). Dynamic Facility Location with Generalized Modular Capacities. Technical Report, CIRRELT‐2013‐18.
  30.  Boloori Arabani, A. and Farahani, R. Z. (2012). “Facility location dynamics: An overview of classifications and applications.” Comp & Ind. Eng., 62(1), 408-420.
  31.  Wesolowsky, G. O. (1973). “Dynamic facility location.” Mgmt. Sci, 19(11), 1241-1248.
  32.  Hwang, C. L., and Masud, Abu Syed Md. (1979). Multiple objective decision making, methods and applications : a state-of-the-art survey. Berlin ; New York: Springer-Verlag.
  33.  Venables, H. and Moscardini, A. (2006), An Adaptive Search Heuristic for the Capacitated Fixed Charge Location Problem; Ant Colony Optimization and Swarm Intelligence. Springer Berlin Heidelberg, 2006. 348-355.
  34.  Pisinger, D. (2006). "Upper bounds and exact algorithms for p-dispersion problems." Comp & Oper Res, 33(5), 1380-1398.
Advances in Industrial Engineering
Volume 49, Issue 1 - Serial Number 1
بهار و تابستان
April 2015
Pages 11-20

Files

Share

How to cite

Statistics