检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与设计》2009年第11期2766-2768,2809,共4页Computer Engineering and Design
摘 要:考虑到战术仓库的需求率具有时变性的特点,应用供应链管理的思想研究了一个战役仓库、多个战术仓库组成的树型多级库存优化问题,建立了战役仓库采用延迟化订货策略、战术仓库分别采用等间隔或等量订货策略时的模型,并采用自适应遗传算法实现了模型的求解,实例验证了模型及算法的有效性。实验结果表明,战术仓库采用延迟订货策略,战术仓库采用等量订货策略时总费用最低。Considering the time-varying demand of the tactical warehouses, the optimization of multi-level tree-structured inventory being composed of one campaign storage and multiple tactical warehouses is investigated by supply chain management. Under the hypothesis that the ordering policy of campaign storage is of postponement and the tactical warehouses is of equal interval or equal quantity respectively, optimization models are established and solved using adaptive genetic algorithm. An example is given to illustrate the effectiveness ofthe models and algorithm. The result shows that the total expense is the lowest when the ordering policy of campaign storage is of postponement and the tactical warehouses is of equal quantity.
关 键 词:树型多级库存 时变需求 延迟策略 自适应遗传算法 修补算子
分 类 号:O227[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30