Constrained optimization: Artificial Bee Colony algorithm
Artificial Bee Colony algorithm supported by Deb's rules to handle constraints.
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
This is implementation of Artificial Bee Colony algorithm that can solve constrained optimization problems. To handle constraints the Deb's rules have been used to compare the actual and new solutions. The implementation of objective function that have to be optimized, has to return two values: main objective function (
) and violation function (
). The algorithm maximized with subject to 
.
) and violation function (). The algorithm maximized with subject to . The exmaple implementation solve the following optimization problem:
subject to:
where: M - number of dimensions (equal to 5 in this particular case)
For more information about the Artificial Bee Colony algorithm supported by Deb's rules refer to:
[1] Szczepanski, Rafal, et al. "Comparison of Constraint-handling Techniques Used in Artificial Bee Colony Algorithm for Auto-Tuning of State Feedback Speed Controller for PMSM." ICINCO (1). 2018.
인용 양식
Szczepanski, Rafal, et al. “Comparison of Constraint-Handling Techniques Used in Artificial Bee Colony Algorithm for Auto-Tuning of State Feedback Speed Controller for PMSM.” Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics, SCITEPRESS - Science and Technology Publications, 2018, doi:10.5220/0006904002690276.
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0 |
