%0 Journal Article
%T Dynamic scheduling problem with multi-spot producing<br>多点生产布局下的动态物流调度问题
%A ZHOU Yang
%A SUN Bin-feng
%A <br>周杨
%A 孙斌锋
%J 计算机应用研究
%D 2011
%I 
%X 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.
%K multi-spot producing
%K inventory routing problem
%K Benders decomposition method
%K dual theory<br>多点生产布局
%K 存储路径问题
%K 斑德分解法
%K 对偶理论
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE0721E28FB8AF434C2E5&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=708DD6B15D2464E8&sid=A8813D0561007999&eid=6B49F16AEA7E3E9B&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15