Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Study on the Solution Method of Maximum Origin-Destination Flow Path in an Acyclic Network using Branch and Bound Method

분지한계기법을 이용한 무환네트위크에서 최대물동량경로의 해법에 관한 연구

  • 성기석 (강릉대학교 산업공학과) ;
  • 임준목 (강릉대학교 산업공학과)
  • Published : 1995.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

Keywords

References

  1. 서울대학교 박사학위논문 수송네트워크에서 최대물동량경로에 관한 연구 성기석
  2. 대한산업공학회지 v.16 no.2 수송네트워크에서 최대물동량 경로문제의 근사해법 성기석;박순달
  3. 한국경영과학회지 v.16 no.1 수송네트워크에서 최대물동량 경로문제의 최적해법 성기석;박순달
  4. 한국군사운영분석 학회지 v.18 no.2 유방향 네트워크에서 최대물동량 경로문제에 관한 연구 성기석;송성헌
  5. European J. of Operational Research v.21 The Maximum Covering/Shortest Path Problem : A Multiobjective Network Design and Routing Formulation Current,J.R.;C.S.Revelle;J.L.Cohon
  6. Transportation Science v.21 no.3 The Median Shortest Path Problem : A Multiobjective Approach to Analysis Cost vs. Accessibility in the Design of Transportation Networks Current,J.R.;C.S.Revelle;J.L.Cohon
  7. Networks v.14 Shortest Path Algorithms : Taxonomy and Annotation Deo,N.;C.Pang
  8. Computers and Intractability-A guide to the theory of NP-Completeness Garey,M.R.;D.S.Johnson
  9. Transportation Research­A v.15A Rail Freight Traffic Assignment Lansdowne,Z.F.
  10. Transportation Science v.18 Network Design and Transportation Planning: Models and Algorithms Magnanti,T.L.;R.T.Wong
  11. Combinatorial Optimization - Algorithms and Complexity Papadimitriou,C.H.;K.Steiglitz
  12. Transportation Research­B v.22B no.1 An Economic Theory of the Pubilc Transit Firm Talley,W.K.
  13. J. of the Asso. for Computing Machinery v.28 no.3 Fast Algorithms for Solving Path Problems Tarjan,R.E.