%0 Journal Article
%T Novel ant colony optimization algorithm for Job-Shop scheduling problem<br>一种求解Job-Shop调度问题的新型蚁群算法
%A LI Sheng
%A ZHOU Ming
%A XU Yang
%A <br>李胜
%A 周明
%A 许洋
%J 计算机应用研究
%D 2010
%I 
%X Aiming at the problem of all possible states and the inventory holding cost not completely considered in general dynamic facility location model, this paper developed a new model. Firstly, obtained the formula of inventory cost in per period with storage and traffic capacity constraints through two steps approximately method. Then, gave the formulas of opening, operation, closing and reopening cost in planning horizon, and developed a new dynamic facility location model. Finally, solved the model by genetic algorithm, clone selection algorithm, particle swarm optimization respectively, and compared the capacities of finding optimal solution, stability, counting speed and astringency between these algorithms. The results of numerical example show that the model is effective and the genetic algorithm is the most suitable for the problem.
%K colony optimization
%K Job-Shop scheduling problem
%K parameter setting<br>蚁群优化
%K 作业车间调度问题
%K 参数设置
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C84DBCDF8B05B8E22783311697C9753E&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=708DD6B15D2464E8&sid=7A54DBF4F861EC00&eid=BE5590E73A4B1C7D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=18