Research ArticleOpen AccessGoogle Scholar indexed
Dual Based Procedures for Un-Capacitated Minimum Cost Flow Problem
Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India
Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India
- 1 Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India
- 2 Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India
American Journal of Operations Research·Volume 06 (2016)·Pages 468–479·Published 28 October 2016·DOI10.4236/ajor.2016.66043
Copy link · social · email
Abstract
In this article, we devise two dual based methods for obtaining very good solution to a single stage un-capacitated minimum cost flow problem. These methods are an improvement to the methods already developed by Sharma and Saxena [1]. We further develop a method to extract a very good primal solution from a given dual solution. We later demonstrate the efficacies and the significance of these methods on 150 random problems.
KeywordsMin Cost FlowTransshipmentDualPrimal
- Sharma, R.R.K. and Saxena, A. (2002) Dual Based Procedures for the Special Case of Transshipment Problem. Operation Research, 39, 177-188.
- Weintraub, A. (1974) A Primal Algorithm to Solve Network Flow Problems with Convex Costs. Management Science, 21, 87-97. https://doi.org/10.1287/mnsc.21.1.87
- Plotkin, S.A. and Tardos, E. (1990) Improved Dual Network Simplex. Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, San Francisco, 22-24 January 1990, 367-376.
- Ahuja, R.K. (1993) Network Flows. PhD Thesis, Technische Hochshule Darmstadt, Darmstadt.
- Juman, Z.A.M.S. and Hoque, M.A. (2015) An Efficient Heuristic to Obtain a Better Initial Feasible Solution to the Transportation Problem. Applied Soft Computing, 34, 813-826. https://doi.org/10.1016/j.asoc.2015.05.009
- Busaker, R.G. and Gowen, P.J. (1961) A Procedure for determining Minimal-Cost Flow Network Patterns. Tech. Rep. ORO-15, Operational Research Office, Johns Hopkins University, Baltimore.
- Edmonds, J. and Karp, R.M. (1972) Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Association for Computing Machinery Journal, 19, 248-264.
- Helgason, R.V. and Kennington, J.L. (1977) An Efficient Procedure for Implementing a Dual Simplex Network Flow Algorithm. AIIE Transactions, 9, 63-68. https://doi.org/10.1080/05695557708975122
- Orlin, J.B. (1984) Genuinely Polynomial Simplex and Non-Simplex Algorithms for Minimum Cost Problems. Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA.
- Ali, A.I., Padman, R. and Thiagarajan, H. (1989) Dual Algorithms for Pure Network Problems. Operations Research, 37, 159-171. https://doi.org/10.1287/opre.37.1.159
- Sharma, R.R.K. and Sharma, K.D. (2000) A New Dual Based Procedure for the Transportation Problem. European Journal of Operational Research, 122, 611-624. https://doi.org/10.1016/S0377-2217(99)00081-8
- Sharma, R.R.K. and Muralidhar, A. (2009) A New Formulation and Relaxation of the Simple Plant Location Problem. Asia-Pacific Journal of Operational Research, 26, 1-11. https://doi.org/10.1142/S0217595909002122
- Clasen, R.J. (1968) The Numerical Solution of Network Problems Using the Out-of-Kilter Algorithm. No. RM-5456-PR. RAND CORP Santa Monica.