A Study on an Algorithm using Multicommodity Network Flow Model for Railroad Evacuation Routing Plan

철도사고 대피경로 탐색을 위한 다수상품 유통문제와 최단경로 해법 연구

  • 장병만 (서울산업대학교 공과대학 산업정보시스템공학과) ;
  • 김시곤 (서울산업대학교 철도전문대학원 철도정책경영학과)
  • Published : 2007.10.31

Abstract

This paper presents a study on a Dijkstra algorithm for shortest paths to destinations and a modified algorithm of Multicommodity Network Flow Problem Model with a network transformation for evacuation planning from railroad accident in a directed network.

References

  1. 장병만 (2001), '복수최단경로의 새로운 최적해법', 한국경영과학회지, 제26권 제3호, pp.79-94
  2. 장병만, 김시곤 (2006), '복수지점으로의 재난대피를 위한 복수 최단경로문제와 다수상품 유통문제 해법 연구', 한국LBS학회지 제4권 제1호, pp.39-50
  3. Ahuja, R.K, T.L Management and J.B Orlin (1993), Network Flows, Prentice Hall, Englewood Cliffs, NJ
  4. Choi, I.C and D.Goldfarb (1990), 'Solving multicommodity network flow problems by an interior point method,' SIAM Proceedings on Applied Mathematics, Vol.46, pp.58-69
  5. Hadjiconstantinou, E., and N. Christofides (1999), An efficient implementa -tion of an algorithm for finding K shortest paths, Networks, 34, pp.88-101 https://doi.org/10.1002/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1
  6. Casto, J. and N.Nabona (1996), 'An implementation of linear and nonlinear multicommodity network flows,' European Journal of Operations Research, Vol.92, pp.37-53 https://doi.org/10.1016/0377-2217(95)00137-9
  7. Garey, M R and D.S. Johnson (1979), Computers and intractability: A guide to the theory of NP-completeness, Freeman and company
  8. Lawler, E.,Combinatorial Optimization (1976):Networks and Matroids, Holt Reinhart and Winston, New York
  9. Dijkstra, E.W. (1959), A note on two problems in connection with graphs, Numerische Mathematik, 1, pp.269-271 https://doi.org/10.1007/BF01386390
  10. Qingsong Lu, Besty George and Shashi Shekhar (2005), 'Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results', 9th Int'l Symposium on Spartial and Temporal Databases, LNCS 3633, pp.291-307
  11. Katoh, N., T. Ibaraki, and H. Mine (1982), An efficient algo-rithm for K shortest simple paths, Networks, 12, pp.411-427 https://doi.org/10.1002/net.3230120406
  12. 임성묵, 설동렬, 박순달 (2001), '다수상품 유통문제를 위한 내부점 방법', 대한산업공학회지, 제27권, 제3호, pp.274-280