【摘要】 研究了带容量限制的带固定费用和可变费用的最小费用流问题,发现该问题是混合0-1整数规划问题,不存在多项式算法.在研究了最优解的结构后,结合最优解的结构特点为之设计了遗传算法,然后构造了一个100个节点的特殊网络,用计算机做了100例计算,验证了该算法具有很好的近似比和很快的收敛速度.更多还原

【Abstract】 The author study the minimum cost flow problem with not only fixed cost but also variable cost,and they found it be a mixed 0-1 linear program,and it does not have polynomial time algorithm.So they study the optimal solution’s characters,and gave a genetic algorithm.Last,with an computer experiment they proved that the algorithm can get a rather good approximate solution and runs quickly.更多还原