检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谢谢[1] 周莉[2] 郑勇跃 XIE Xie;ZHOU Li;ZHENG Yongyue(Key Laboratory of Manufacturing Industrial and Integrated Automation,Shenyang University,Shenyang 110044,China;Institute of Social Credit,China National Institute of standardization,Beijing 100191,China;Center of Career Development,Liaoning Inspection,Examination & Certification Centre,Shenyang 110032,China)
机构地区:[1]沈阳大学装备制造综合自动化重点实验室,辽宁沈阳110044 [2]中国标准化研究院社会信用研究室,北京100191 [3]辽宁省检验检测认证中心事业发展中心,辽宁沈阳110032
出 处:《沈阳大学学报(自然科学版)》2019年第2期107-112,共6页Journal of Shenyang University:Natural Science
基 金:国家自然科学基金资助项目(71672117);中国博士后基金资助项目(2018M631816);辽宁省自然科学基金资助项目(201602526)
摘 要:研究了钢铁企业物流系统中的一类单吊机调度问题.在板坯仓库中,为了最小化全部板坯的总热量损失,通过优化吊机的操作,以确定阻碍板坯的倒垛位置和目标板坯的拣选顺序.针对这个问题,建立混合整数线性规划模型求解小规模问题的最优解,对中大规模问题,提出混合亚启发式算法,该算法首先由贪婪启发式求得初始解进一步使用变深度邻域搜索策领略改进解的质量.数值计算实验结果表明,所提出的混合整数线性规划模型和混合亚启发式算法是有效的.A single crane scheduling problem arising in the logistics system of steel production were studied.The studied problem here is to optimize shuffling operations needed in retrieving a sequence of required steel slabs from a warehouse served by a single crane for minimizing total temperature drop loss.A mixed integer linear programming(MILP)model of the problem was constructed for solving small scale problem optimally.For median or larger scale problem,a new hybrid metaheuristic which combines greedy heuristic and variable depth search that provides intensification for further exploration was proposed to further improve the heuristic solutions.Numerical experiments show that the proposed algorithms are effective.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145