Solving large scale fixed charge network flow problems

被引:0
|
作者
Eksioglu, B [1 ]
Eksioglu, SD [1 ]
Pardalos, PM [1 ]
机构
[1] Univ Florida, Ctr Appl Optimizat, Gainesville, FL 32611 USA
关键词
fixed charge; nonconvex network flow problem; computational experiments; branch and bound; mixed integer programming; supply chain;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper presents an approximation algorithm to solve large scale Fixed Charge Network Flow Problems (FCNFP). Fixed charge type of cost functions are Wed to model several problems of Supply Chain such as production planning and inventory management, transportation, plant location, and lot sizing. Our algorithm-uses the Dynamic Slope Scaling Procedure (DSSP) to generate an initial solution to the problem, and then three different Local Search approaches contribute to finding a suboptimal solution. Computational experience with bipartite and layered networks are reported. The results indicate that our approach is suitable for large scale problems.
引用
收藏
页码:163 / 183
页数:21
相关论文
共 50 条