一类转库问题流向优化问题的模型与解法

The Modeling and Solution for Optimal Problem of the Re-Deposit Direction

转库是大型企业物流管理工作中的重要环节·针对企业决策支持系统的子系统转库作业日计划问题进行了分析 ,为一类转库流向问题建立了优化模型具有特殊约束 0 - 1整数线性规划问题 (0 - 1ILP) ·分析了具体问题的性质·为求解这类NP -难问题 ,给出了一种在实际中行之有效的求解问题的算法降维替换算法·以SAS语言为环境 ,用实际问题作为计算算例 ,对这种算法的优点进行了总结 :该算法在实际应用中是切实可行的 ,在时间上是节约的 。

The subsystem of decision making support system of an enterprise redeposit task day plan was analyzed. An optimal model for a kind of re deposit direction problem,the 0 1integer programming problem with special restrictive conditions,was set up. An effective algorithm,reductive dimension and replacement variable algorithm, was given to solve this kind of NP hard problems. Some practical problems were calculated by using SAS (Statistic Analysis System) software. The algorithm is feasible, time saving, and especially suitable for solving large size problems.