首页> 外文会议>IEEE Congress on Evolutionary Computation;CEC '09 >Study of ants' traffic organisation under crowded conditions using individual-based modelling and evolutionary computation
【24h】

Study of ants' traffic organisation under crowded conditions using individual-based modelling and evolutionary computation

机译:基于个体建模与进化计算的拥挤条件下蚂蚁交通组织研究

获取原文

摘要

Repulsive interactions of black garden ants (Lasius Niger) has been found to be critical for preventing congestion and maintaining optimal food return rate in ant colony. Previously, mathematical models have been built to study the effect of the repulsive interactions on the path selection decision of ants. However, the detailed mechanisms behind the interactions are still poorly understood. For the first time, we developed an evolvable individual-based model to simulate foraging ants with the repulsive interactions, to investigate the underlying mechanisms and its effects on the overall food return rate of the ant colony. We employed a two-phase evolutionary process using a genetic algorithm: we firstly evolved a model with trail following behaviour in an open environment in order to make this behaviour more biologically realistic. Then based on the evolved model, the repulsive interactions were introduced and evolved on a double-bridge environment in order to get an optimal effect on the food return rate in crowded situation. Our model is sufficient enough to reveal the details of the possible underlying mechanisms of the repulsive interactions and its effect on the transportation efficiency.
机译:已经发现,黑园蚁(Lasius Niger)的排斥性相互作用对于防止拥挤和维持蚁群中的最佳食物返回率至关重要。以前,已经建立了数学模型来研究排斥相互作用对蚂蚁的路径选择决策的影响。但是,交互背后的详细机制仍然知之甚少。首次,我们开发了一种基于个体的可进化模型,以模拟具有排斥性相互作用的觅食蚂蚁,以研究其潜在机制及其对蚂蚁群体总体食物返还率的影响。我们使用遗传算法采用了两阶段进化过程:首先,我们在开放环境中演化出具有追踪行为的模型,以使这种行为在生物学上更加真实。然后在进化模型的基础上,引入排斥相互作用,并在双桥环境下进行进化,以便在拥挤情况下获得最佳的食物返还率。我们的模型足以揭示排斥相互作用的潜在机理及其​​对运输效率的影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号