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
bi-directional convergence aco for job-shop scheduling
Authors
戴国忠
操云甫
王常青
Publication date
1 January 2004
Publisher
Abstract
为了合理高效地调度资源,解决组合优化问题,在Job-Shop问题图形化定义的基础上,借鉴精英策略的思路,提出使用多种挥发方式的双向收敛蚁群算法,提高了算法的效率和可用性.最后,通过解决基准问题的实验,比较了双向收敛蚁群和蚁群算法的性能.实验结果表明,在不明显影响时间、空间复杂度的情况下,双向收敛蚁群算法可以加快收敛速度
Similar works
Full text
Available Versions
Institute Of Software, Chinese Academy Of Sciences
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.iscas.ac.cn:311060/2080
Last time updated on 30/12/2017