多点生产布局下的动态物流调度问题  

Dynamic scheduling problem with multi-spot producing

作　　者：周杨[1] 孙斌锋[1] 

机构地区：[1]湖南大学工商管理学院,长沙410079

出　　处：《计算机应用研究》2011年第11期4121-4124,4128,共5页Application Research of Computers

摘　　要：以烟草行业产业重组后出现的多点生产布局下的车辆集货过程为研究对象,为研究在生产点仓储能力限制下的高效率低成本的集货线路,构建了混合整数规划数学模型,针对模型中变量特征引入斑德分解法实现原问题的求解算法设计;并通过AMPL数学建模语言编程,与行业标准Cplex解法器进行对比分析,验证了算法的可行性和有效性,同时考察不同参数对原问题的影响。This paper chose the pick-up process using vehicles under multi-spot producing after reorganization in tobacco industry as the subject,and constructed a mixed integer programming in order to set up the low-cost routes.Considering the characteristics of variables in the MIP,introduced the Benders decomposition method to solve the original problem.With the AMPL mathematical modeling language,implemented the modified algorithm,and investigated several numerical examples with three different parameters,compared with the Cplex solver,to verify its feasibility and effectiveness.

关 键 词：多点生产布局 存储路径问题 斑德分解法 对偶理论 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]