An efficient generalized network-simplex-based algorithm for manufacturing network flows

作者：Venkateshan Prahalad^*; Mathur Kamlesh; Ballou Ronald H

来源：Journal of Combinatorial Optimization, 2008, 15(4): 315-341.

DOI：10.1007/s10878-007-9080-6

• network flows
• manufacturing networks
• generalized network-simplex method

Fang and Qi (Optim. Methods Softw. 18:143-165, 2003) introduced a new generalized network flow model called manufacturing network flow model for manufacturing process modeling. A key distinguishing feature of such models is the assembling of component raw-materials, in a given proportion, into an end-product. This assembling operation cannot be modeled using usual generalized networks (which allow gains and losses in flows), or using multi-commodity networks (which allow flows of multiple commodity types on a single arc). The authors developed a network-simplex-based algorithm to solve a minimum cost flow problem formulated on such a generalized network and indicated systems of linear equations that need to be solved during the course of the network-simplex-based solution procedure. In this paper, it is first shown how various steps of the network-simplex-based solution procedure can be performed efficiently using appropriate data structures. Further, it is also shown how the resulting system of linear equations can be solved directly on the generalized network.

• 出版日期2008-5