首页> 外文会议>International Congress on Applied Information Technology >A Hybrid Particle Swarm Optimization with Crossover and Mutation of Genetic Algorithm for Solving the Wide Constraint Problem
【24h】

A Hybrid Particle Swarm Optimization with Crossover and Mutation of Genetic Algorithm for Solving the Wide Constraint Problem

机译:遗传算法交叉变异的混合粒子群优化算法。

获取原文

摘要

When optimizing the spatial data, a lot of constraints should be handled. Some constraints might be too wide for a metaheuristic algorithm, e.g. particle swarm optimization, to allocate the candidate locations outside a wide constraint. However, particle
机译:在优化空间数据时,应处理大量约束。例如,某些约束可能太宽,例如,算法,例如,粒子群优化,在宽约束之外分配候选位置。但是,粒子

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号