摘要
尽管有许多实际问题都可以建立单品种网络流规划模型,但是多品种问题则更为普遍,其中最典型的是运输中的多物资问题。本文通过引入修正费用的办法来解决多品种竞争问题。首先建立起多品种流最小费用问题的数学模型,然后根据弧在增广圈中出现的次数来确定流量调整量,得到了一种求解多品种最小费用流问题的方法。
The model of layout of single variety network flow is built for many actual problem, but variety problem is more universal. The most typical issue is multi-material. In this paper, multi variety competition is solved by revising expense. The math model about the issue of multi-variety minimum expenses flow is built, and then decide the value of flow adjusting, and finally, a new method of multi-variety minimum expenses flow is obtained.
出处
《物流科技》
2005年第7期27-30,共4页
Logistics Sci-Tech
关键词
多品种
最小费用流
增广圈
网络流
multi-variety
minimum expenses flow
augment cycle
network flow
