Browse > Article

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

Chang, Byung-Man (서울산업대학교 공과대학 산업정보시스템공학과)
Kim, Si-Gon (서울산업대학교 철도전문대학원 철도정책경영학과)
Publication Information
Journal of the Korean Society for Railway / v.10, no.5, 2007 , pp. 569-575 More about this Journal
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.
Keywords
Railroad Evacuation Planning; Multicommodity Network Flow Problem; Dijkstra Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 장병만 (2001), '복수최단경로의 새로운 최적해법', 한국경영과학회지, 제26권 제3호, pp.79-94
2 장병만, 김시곤 (2006), '복수지점으로의 재난대피를 위한 복수 최단경로문제와 다수상품 유통문제 해법 연구', 한국LBS학회지 제4권 제1호, pp.39-50
3 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
4 Hadjiconstantinou, E., and N. Christofides (1999), An efficient implementa -tion of an algorithm for finding K shortest paths, Networks, 34, pp.88-101   DOI   ScienceOn
5 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
6 Ahuja, R.K, T.L Management and J.B Orlin (1993), Network Flows, Prentice Hall, Englewood Cliffs, NJ
7 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   DOI   ScienceOn
8 Dijkstra, E.W. (1959), A note on two problems in connection with graphs, Numerische Mathematik, 1, pp.269-271   DOI
9 Garey, M R and D.S. Johnson (1979), Computers and intractability: A guide to the theory of NP-completeness, Freeman and company
10 Lawler, E.,Combinatorial Optimization (1976)：Networks and Matroids, Holt Reinhart and Winston, New York
11 임성묵, 설동렬, 박순달 (2001), '다수상품 유통문제를 위한 내부점 방법', 대한산업공학회지, 제27권, 제3호, pp.274-280
12 Katoh, N., T. Ibaraki, and H. Mine (1982), An efficient algo-rithm for K shortest simple paths, Networks, 12, pp.411-427   DOI   ScienceOn