CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On ant colony algorithm for solving multiobjective optimization problems
Authors
张勇德
黄莎白
Publication date
1 January 2005
Publisher
Abstract
将离散空间问题求解的蚁群算法引入连续空间,针对多目标优化问题的特点,提出一种用于求解带有约束条件的多目标函数优化问题的蚁群算法.该方法定义了连续空间中信息量的留存方式和蚂蚁的行走策略,并将信息素交流和基于全局最优经验指导两种寻优方式相结合,用以加速算法收敛和维持群体的多样性.通过3组基准函数来测试算法性能,并与NSGAII算法进行了仿真比较.实验表明该方法搜索效率高,向真实Pareto前沿逼近的效果好,获得的解的散布范围广,是一种求解多目标优化问题的有效方法
Similar works
Full text
Available Versions
Shenyang Institute of Automation,Chinese Academy Of Sciences
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.sia.cn/:173321/5932
Last time updated on 09/01/2019
Institutional Repository of Institute of Automation, CAS
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.sia.cn/:173321/5932
Last time updated on 16/09/2020