【摘要】 分析了钢铁企业产成品转库问题的特点,通过将转库任务分解的方法将原问题转化为具有最迟访问时间约束和同时访问车辆数限制的车辆路径优化问题,建立了转换后问题的0-1规划数学模型,针对模型的特点设计了迭代局域搜索算法.算法初始解由贪婪算法生成,局域搜索过程采用4种常用局域搜索算子的混合,摄动过程采用变强度的2-opt*算子.该算法可以同时实现转库车辆指派和车辆路径优化.通过仿真生成的算例对模型和算法进行了验证.实验结果表明,该模型和算法是解决该类问题的有效方法.更多还原

【Abstract】 The characteristics of finished product re-depositing problems in steel plants are analyzed.After transportation tasks being decomposed,the original problems are transferred to vehicle routing problems with constraints of latest visiting time and of number of vehicles which are simultaneously visiting the same warehouse.Consequently,a 0-1 program model is presented,and an iterated local search(ILS) algorithm is designed to solve the problems.The initial solution is generated by a greedy heuristic approach.Local search procedure is designed by combining four well-known local search operators.Perturbation operator adopts variable intension 2-opt* operator.The vehicle dispatching and vehicle route optimizing can simultaneously be done with the algorithm.The model and algorithm are tested by citing randomly generated problem instances.Computational results show that the model and algorithm are effective for solving this kind of problems.更多还原