%0 Journal Article
%T Multiple Traveling Salesman Problem and Its Application to Hot Rolling Planning<br>热轧计划中的多旅行商问题及其计算方法*
%A HUANG Ke-wei
%A WANG Ding-wei
%A <br>黄可为
%A 汪定伟
%J 计算机应用研究
%D 2007
%I 
%X The hot rolling planning problem was modeled by MTSP(multiple traveling salesman problem).A hybrid genetic algorithm to solve the problem was designed.Through the simulated computation on the real data from a large steel milling plant,the results show that the recommended algorithm can achieve the better milling plan.The MTSP model and hybrid algorithm can solve the hot milling planning problem satisfactorily.
%K MTSP(multiple traveling salesman problem)
%K mathematical model
%K hot rolling planning
%K genetic algorithms<br>多旅行商问题
%K 数学模型
%K 热轧轧制计划
%K 遗传算法
%K 热轧计划
%K 多旅行商问题
%K 计算方法
%K Rolling
%K Planning
%K Application
%K Traveling
%K Salesman
%K Problem
%K 计划方案
%K 轧制
%K 遗传算法
%K 结果
%K 仿真测试
%K 实例数据
%K 钢厂
%K 混合
%K 问题设计
%K 建模
%K MTSP
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F6B89D448050AC0C3D&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=DF92D298D3FF1E6E&sid=BE33CC7147FEFCA4&eid=94E7F66E6C42FA23&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=3&reference_num=11