A Solution Procedure for Minimum Convex-Cost Network Flow Problems
Dewan F Wahid, Ganesh C Ray, Farjana Habiba
TL;DR
This paper introduces a heuristic algorithm for solving Minimum Convex-Cost Network Flow Problems, combining network simplex concepts, convex simplex methods, and problem decomposition to improve solution efficiency.
Contribution
It develops a novel heuristic algorithm that integrates network simplex and convex simplex methods with problem decomposition for MC-CNFP.
Findings
The algorithm effectively solves MC-CNFPs with improved efficiency.
It demonstrates the integration of NSM and CSM concepts in a heuristic framework.
The approach offers a practical solution for complex convex network flow problems.
Abstract
This paper presents a heuristic algorithm to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex Simplex Method (CSM) of Zangwill, the decomposition of the convex simplex method and non-linear transformation problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Advanced Manufacturing and Logistics Optimization · Scheduling and Optimization Algorithms