首页> 外文会议>International Conference on Information Technologies >Adaptive Ant Colony Optimization Algorithm for Hierarchical Scheduling Problem
【24h】

Adaptive Ant Colony Optimization Algorithm for Hierarchical Scheduling Problem

机译:分层调度问题的自适应蚁群优化算法

获取原文

摘要

The paper deals with the scheduling problem relevant in many fields, such as project management, lesson scheduling or production scheduling. We propose to implement a hierarchical problem structure that puts the travelling salesman problem at the top and replaces the nested resource-constrained project scheduling problem with a simulation model. The paper considers using adaptive parameters control method for Ant Colony Optimization. The performance comparison with such algorithms as Lin-Kernighan heuristic, Genetic Algorithm and Intelligent Water Drops Algorithm is made and competitive results are demonstrated.
机译:本文讨论了与项目管理,课程计划或生产计划等许多领域相关的计划问题。我们建议实现一种分层的问题结构,该结构将旅行商问题放在顶部,并用模拟模型代替嵌套的资源受限的项目计划问题。本文考虑采用自适应参数控制方法进行蚁群优化。进行了Lin-Kernighan启发式,遗传算法和智能水滴算法等算法的性能比较,并证明了竞争结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号