...
首页> 外文期刊>International Journal of Applied Engineering Research >Quadrative Assignment Problems (QAP) using Ant Colony Optimization (ACO)
【24h】

Quadrative Assignment Problems (QAP) using Ant Colony Optimization (ACO)

机译:使用蚁群优化(ACO)的二次分配问题(QAP)

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

获取外文期刊封面封底 >>

       

摘要

During the last few decades, the human beings desire efficient and effective optimization of problems. This paper discussed the optimization of quadrative assignment problem. Ant colony optimization is used in this paper for better outcome. The paper is based on the development of a mathematical model to tackle the problems of allocation of distributors and wholesalers/retailers. Simulation is done on 15 distributors and 15 wholesalers/retailers and a matrix of 15 x 15 has been prepared for the distances between them. The GUI is designed for the Assignment Problem using MATLAB. The article covers both situations of Assignment Problem i.e. Maximization or Minimization. In this paper, the simulation has been done on data based of Laxmi Plywood, Yamuna Nagar.
机译:在过去的几十年中,人类渴望有效和有效地优化问题。 本文讨论了Quadriative分配问题的优化。 本文使用蚁群优化以获得更好的结果。 本文基于发展数学模型,以解决分销商和批发商/零售商分配问题。 仿真在15分销商和15个批发商/零售商和15×15的矩阵上进行了准备,用于它们之间的距离。 GUI专为使用MATLAB的分配问题而设计。 文章涵盖了分配问题的两种情况,即最大化或最小化。 在本文中,已经在基于Laxmi胶合板,Yamuna Nagar的数据上完成了模拟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号