...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers & operations research >An ant algorithm for the single row layout problem in flexible manufacturing systems
【24h】

An ant algorithm for the single row layout problem in flexible manufacturing systems

机译：柔性制造系统中单行布局问题的蚂蚁算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Single row machine layout problem is one of the most commonly used layout patterns, especially in flexible manufacturing systems. In this paper, this problem is formulated as a non-linear 0-1 programming model in which the distance between the machines is sequence dependent. An ant algorithm has been developed to solve this problem. A technique is proposed to efficiently implement the proposed algorithm. The performance of the proposed heuristic is tested over a number of problems selected from the literature. Computational results indicate that the proposed approach is more effective compared to many existing algorithms in this area.
机译：单行机器布局问题是最常用的布局模式之一，尤其是在柔性制造系统中。在本文中，此问题被表述为非线性0-1编程模型，其中机器之间的距离取决于序列。已经开发了一种蚂蚁算法来解决该问题。提出了一种有效地实现所提出的算法的技术。针对从文献中选择的许多问题，对提出的启发式算法的性能进行了测试。计算结果表明，与该领域的许多现有算法相比，所提出的方法更为有效。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号