Some further results on minimum distribution cost flow problems |
| |
Authors: | Haiyan Lu Enyu Yao Liqun Qi |
| |
Affiliation: | (1) Department of Mathematics, Zhejiang University, Hangzhou, 310027, China;(2) Department of Information & Computing Science, Southern Yangtze University, Wuxi, 214122, China;(3) Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong, China |
| |
Abstract: | Manufacturing network flow (MNF) is a generalized network model that can model more complicated manufacturing scenarios, such as the synthesis of different materials to one product and/or the distilling of one material to many different products. Minimum distribution cost flow problem (MDCF) is a simplified version of MNF optimization problems, in which a general supplier wants to proportionally distribute certain amount of a particular product from a source node to several retailers at different destinations through a distribution network. A network simplex algorithm has been outlined in recent years for solving a special case of MDCF. In this paper, we characterize the network structure of the bases of the MDCF problem and develop a primal simplex algorithm that exploits the network structure of the problem. These results are extensions of those of the ordinary network flow problems. In conclusion, some related interesting problems are proposed for future research. This research is partially supported by the National Natural Science Foundation of China (No. 10371028) and a grant from Southern Yangtze University (No. 0003182). |
| |
Keywords: | Manufacturing network flow Minimum cost network flow Network simplex algorithm Networks with side constraints |
本文献已被 SpringerLink 等数据库收录! |
|