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

  • 제27권2호
  • /
  • Pages.153-171
  • /
  • 2002
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

네트워크 문제 해결에 있어서 효과적인 pricing 방법에 관한 연구

An Efficient Pricing Strategy(PAPANET) for Solving Network Flow Problems

  • Kang, Moonsig (Assistant Professor, Dept. of Management Information System, Keimyung University)
  • 발행 : 2002.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we present an efficient pricing strategy, the pivot and probe Algorithm for Network Flow Problems(PAPANET), specifically for solving capacitated, linear network flow problem (NPs). The PAPANET begins with an initial relaxed network problem(RNP), consisting of all the nodes and initial candidate arcs(possibly a few least cost arcs form the original problem and a set of all the artificial and slack arcs). After an initial solution to the RNP is derived by pivoting, the PROBE procedure identifies a set of most violated arcs from the noncandidate arcs that are not considered to be in the current RNP, and adds them to the RNP. The procedure also discards a set of least favorable, zero flow, nonbasic arcs from the RNP. The new RNP is solved to optimality and the procedure continues until all of the dual constraints of the noncandidate arcs are satisfied by the dual solution to the RNP. The PAPANET effectively reduces the problem size, time per pivot, and solution CPU time by eliminating noncandidate arcs. Computational tests on randomly generated problems indicate that PAPANET achieves and average savings of 50-80% of the solution CPU time of that of a comparable standard network simplex implementation.

키워드

참고문헌

  1. Management Science v.39 no.1 The Solution of Multiperiod Network Flow Problems by Aggregation Aderohummu, R.S.;J.E. Aronson https://doi.org/10.1287/mnsc.39.1.54
  2. Annal fo operations Research v.20 A Survey of Dynamic Network Flows Aronson, J.E. https://doi.org/10.1007/BF02216922
  3. Naval Research Logistic Quarterly v.30 A Forward Simplex Algorithm for Solving Multiperiod Network Flow Problems Aronson, J.E.;B.D. Chen
  4. Naval Research Logistics Quarterly v.22 no.1 An Operator Theory of Parametric Programming for the Generalized Transportation Problem : 1. Basic Theory Balachandran, V.;G.L. Thompson https://doi.org/10.1002/nav.3800220108
  5. Infor. v.17 no.1 Enhancements of Spanning Tree Labelling Procedures for Network Optimization Barr, R.S.;Fred Glover;D. Klingman
  6. Operations Research v.42 no.1 Parallel Simplex for Large Pure Network Problem : Computational Testing and Sources of Speedup Barr, R.S.;B.A. Hickman https://doi.org/10.1287/opre.42.1.65
  7. Linear Programming and Network Flows(2nd ed.) Bazaraa, M.S.;J.J. Jarvis;H.D. Sherali
  8. Linear Network Optimization : Algorithms and Codes Bertsekas, D.P.
  9. Optimization Algorithms for Networks and Graphs(2nd ed.) Evans J.R.;E. Minieka
  10. J. Society of Industrial and Applied Mathematics v.9 no.1 An Out-of -Kilter Method for Minimal-Cost Flow Problems Fulkerson, D.R. https://doi.org/10.1137/0109002
  11. Network Models in Optimization and their Applications in Practice Glover, F.;D. Klingman;N.V. Phillips
  12. Mathematical Programming v.29 no.3 Computational Experience with Advanced Implementation of Decomposition Algorithms Ho, J.K.;E. Loute
  13. Presented at the Joint National Meeting of ORSA/TIMS Computational Analysis of Large-Scale Pure Networks Klingman, D.;J. Mote
  14. Management Science v.20 no.5 NETGEN : A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems Klingman, D.;A. Napier;J. Stutz https://doi.org/10.1287/mnsc.20.5.814
  15. Computers and Operations Research v.25 no.9 A Hybrid Algorithm for Solving Network Flow Problems with Side Constraints Mathies, S.;P. Mevert https://doi.org/10.1016/S0305-0548(98)00001-X
  16. Journal of Heuristics v.6 no.1 Heuristics for Solving Distribution Network Design in Telecommunication Network Design in Telecommunication Mateus, G.R.;H.P. Luna;A.B. Sirihal https://doi.org/10.1023/A:1009669927855
  17. European Journal of Operational Research v.129 no.3 Capacitated Facility Location/Network Design Problems Melkote, S.;M.S. Daskin https://doi.org/10.1016/S0377-2217(99)00464-6
  18. Algorithmic Enhancements of the Simplex Method Sethi, A.P.
  19. Redundancy in Mathematical Programming The Non-Candidate Constraint Method for Reducing the Size of a Linear Program Sethi, A.P.;G.L. Thompson;Karwan(ed.);Mark(ed.);Vahid Lotfi(ed.);Jan Telgen(ed.);Stanlet Zionts(ed.)
  20. Mathematical Programming v.29 no.2 The Pivot and Probe Algorithm for Solving a Linear Program Sethi, A.P.;G.L. Thompson https://doi.org/10.1007/BF02592222
  21. Working Paper No.1990-42 An Efficient Simplex Pricing Procedure Sethi, A.P.;G.L. Thompson;M.S. Hung
  22. Linear Programming Simonnard, M.A.
  23. Department of Management Sciences and Imformation Technology MINIC : MINImum Cost Network Flow Code Sun, M.
  24. Comput. & Ops. Res. v.13 no.1 Solution of Constrained Generalized Transportation Problems Using the Pivot and Probe Algorithm Thompson, G.L.;A.P. Sethi https://doi.org/10.1016/0305-0548(86)90059-6
  25. Transportation Research v.8C no.1 A Three-Stage Computational Approach to Network Matching Xiong, D.
  26. Journal of Computational and Applied Mathematics v.106 no.2 A Further Study on Inverse Linear Programming Problems Zhang, J.;Z. Liu https://doi.org/10.1016/S0377-0427(99)00080-1