一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决，考虑一类带配送中心的运输问题，若仍采用表上作业法，会使问题复杂化，文中采用一种构造辅助网络的方法：在运输网络中将每个配送中心均拆分成2个点，连接两点形成新弧，构造出新的网络，并给每条弧赋予参数，将此类运输问题转换为最小费用流模型来解决，可以使问题模型和运算简单化．在此基础上，考虑运输网络中配送中心和边的容量扩张问题．

On capacity expansion model of transportation problem with distribution center

The classical transportation problem can be generally solved by a simple solution--the table algorithm, but if the table algorithm is still used to solve type of transportation problem with distribution center, the model and calculation will complicate. In order to solve this question, an auxiliary network method is proposed, namely the every distribution center in the transportation network is split into two nodes which are linked to form new arcs in the new network, and each are is enduedwith parameters. Thus this type of transportation problem is turned into the minimum cost flow problem, which simplifies the model and calculation. And then the capacity expansion problems of the distribution center and the edges in the transportation network are also considered.