A New Ant Colony Method for Continuous-Domain Constrained Optimization
Publish place: 16th Iranian Conference on Electric Engineering
Publish Year: 1387
Type: Conference paper
Language: English
View: 2,322
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
ICEE16_056
Index date: 25 February 2008
A New Ant Colony Method for Continuous-Domain Constrained Optimization abstract
A new method for continuous-domain constrained optimization based on Ant Colony Optimization for Continuous Domains ( ACO ) is proposed. ACO uses a ranked archive of best solutions to generate new solutions. The proposed method ) uses a ranking scheme based on both feasibility of the solutions and their cost function values.
( SRACOThe method is applied to a number of benchmark problems. The results show an improved performance with a reduced number of cost function evaluations for most of the test cases. The algorithm particularly performs well on problems where the feasible space constitutes a very small subset of the whole search space and is surrounded by infeasible regions
A New Ant Colony Method for Continuous-Domain Constrained Optimization Keywords:
A New Ant Colony Method for Continuous-Domain Constrained Optimization authors
Modjtaba Khalidji
University of Tabriz
Mohammad Taghi Vakil-Baghmisheh
University of Tabriz
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :