Abstract

This paper presents an approximation algorithm to solve large scale Fixed Charge Network Flow Problems (FCNFP). Fixed charge type of cost functions are used 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.KeywordsFixed ChargeNonconvex Network Flow ProblemComputational ExperimentsBranch and BoundMixed Integer ProgrammingSupply Chain

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.