%0 Journal Article
%T Pareto max-min ant system algorithm and its application to hot rolling batch planning problem<br>Pareto最大最小蚂蚁算法及其在热轧批量计划优化中的应用
%A JIA Shu-jin
%A ZHU Jun
%A DU Bin
%A YUE Heng
%A <br>贾树晋
%A 朱俊
%A 杜斌
%A 岳恒
%J 控制理论与应用
%D 2012
%I 
%X A Pareto concept-based max-min ant system algorithm for the bi-objective traveling salesman problem is proposed. By modifying the state transition rule, pheromone updating rule and the local search rule; as well as employing an adaptive-grid based diversity maintenance approach and the pheromone trail smoothing mechanism, we find the approximate Pareto front which is uniformly distributed on the objective space. Simulation on 6 benchmark functions and application to a hot rolling batch planning problem indicate that the proposed algorithm has desirable performance and practicability.
%K ant colony algorithm
%K bi-objective traveling salesman problem
%K multi-objective optimization
%K combinatorial optimization
%K hot rolling batch planning<br>蚁群算法
%K 双目标旅行商问题
%K 多目标优化
%K 组合优化
%K 热轧批量计划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=4B593C892672BD8C3030C99E85D3B2E8&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=0B39A22176CE99FB&sid=205BE674D84A456D&eid=3986B25773CB6C30&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=0