首页> 外文期刊>Engineering Applications of Artificial Intelligence >A heuristic algorithm combining Pareto optimization and niche technology for multi-objective unequal area facility layout problem
【24h】

A heuristic algorithm combining Pareto optimization and niche technology for multi-objective unequal area facility layout problem

机译:帕累托优化和小生境技术相结合的启发式算法解决多目标不等面积设施布局问题

获取原文
获取原文并翻译 | 示例
           

摘要

The unequal area facility layout problem (UA-FLP) is the problem of placing departments with different areas in a facility so that departments satisfy some given objectives and constraints. In this paper, two objectives including the material handling cost and the closeness rating are optimized. Based on the quasi-physical strategy, we introduce an extrusive elastic potential energy based on the overlapping distance between departments into the layout system. After a novel handling approach of the non-overlapping constraint formed by executing the gradient method with an adaptive step length and subsequent department deformation strategy is developed to deal with the interference among departments and between any department and the facility, the problem is first converted into an optimization problem without the non-overlapping constraint. Then, we use a new heuristic algorithm that combines the local search based on the Pareto optimization and the global optimum search based on the niche technology to obtain Pareto-optimal solutions of the problem. In the proposed heuristic algorithm, in order to overcome the shortcomings of low efficient search toward the diversity of solutions in classical Pareto optimization method, we propose a heuristic layout updating strategy and a niche technology. To improve the convergence of the algorithm to the Pareto front, a mechanism of evolution of population named a feasible layout bank in the algorithm based on the local search and global optimum search is proposed. Two sets of representative instances from the literature with the size of the problem up to 62 departments are tested. The experimental results show that the proposed heuristic algorithm is an effective method for solving the multi-objective UA-FLP.
机译:不等面积的设施布局问题(UA-FLP)是将不同区域的部门放置在设施中,以使部门满足某些给定的目标和约束的问题。在本文中,优化了两个目标,包括物料搬运成本和紧密度等级。基于准物理策略,我们将基于部门之间重叠距离的挤出弹性势能引入布局系统。开发出一种新颖的处理方法,该方法通过执行具有自适应步长的梯度方法形成不重叠约束,并随后采用部门变形策略来处理部门之间以及任何部门与设施之间的干扰,首先将问题转化为没有非重叠约束的优化问题。然后,我们使用一种新的启发式算法,该算法结合了基于Pareto优化的局部搜索和基于小生境技术的全局最优搜索,以获得该问题的Pareto最优解。在所提出的启发式算法中,为了克服传统的帕累托优化方法中针对解决方案多样性的低效率搜索的缺点,我们提出了一种启发式布局更新策略和一种利基技术。为了提高算法到帕累托前沿的收敛性,提出了一种基于局部搜索和全局最优搜索的种群进化机制,即可行布局库。测试了来自文献的两组具有代表性的实例,问题的规模多达62个部门。实验结果表明,所提出的启发式算法是解决多目标UA-FLP的有效方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号