摘要
为钢铁企业原料存储分配问题建立了以降低成本并保持原料成分稳定为目标函数的非线性数学模型,并提出了改进禁忌搜索算法进行求解.该算法利用基于随机k ick移动的迭代局域搜索策略作为跳出局部最优的策略,其中迭代局域搜索策略的邻域以环交换移动产生.通过150组随机数据的实验证明,引入迭代局域搜索策略的禁忌搜索算法具有较强的全局搜索能力,是解决该类实际工业问题的快速有效的近优算法.
A nonlinear mathematical model is presented for the storage space allocation problem in material yards of integrated iron and steel plants with the objective function of reducing transportation costs and keeping material components. An improved tabu search algorithm is developed to solve it by using an iterated local search strategy based on random kick moves as a method to escape from local optima. The neighborhood in iterated local search is generated by cyclic exchange moves. The test with 150 random data sets shows that the tabu search with iterated local search strategy achieving global diversification is a fast and effective near optimal algorithm to solve such practical industry problems.
出处
《控制与决策》
EI
CSCD
北大核心
2006年第6期656-660,665,共6页
Control and Decision
基金
国家杰出青年科学基金项目(70425003)
国家自然科学基金项目(70171030
60274049)
高等学校优秀青年教师教学科研奖励计划项目(教育司[2002]383)
霍英东青年教师基金项目(81073)
关键词
钢铁企业
kick移动
环交换
迭代局域搜索
禁忌搜索
Iron and steel industry
Kick move
Cyclic exchange
Iterated local search
Tabu search
