Heterogeneous swarm optimization algorithm for continuous optimization: optimization by cooperation between ants and bees = 연속 최적화를 위한 이종 군집 최적화 알고리즘: 개미와 벌의 협력에 의한 최적화

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 430
  • Download : 0
Optimization problems are easily found in our real lives including various fields such as finance, physics, chemistry, engineering, manufacturing, and so on. Most of these problems are discontinuous or non-differentiable types that limit to be solved by the classic method in mathematics, such as a gradient descent or a quasi-Newton method, as well as complex types. Metaheuristic approaches do not need the gradient or Hessian matrix, having the advantage to optimize and being widely used and studied to solve real-life optimization problems. Metaheuristics, however, have an issue to solve of balancing between diversification and intensification, in which a metaheuristic algorithm should use some strategy to diversify the search in such a way that on the one hand it does not get stuck into local optima (diversification), on the other it is able to converge once the global optimum has been found (intensification). There are many metaheuristic approaches inspired from nature, recently the researches based on the swarm intelligence which is inspired from the movement of a swarm such as ant colonies, bird flocking, bee colonies, and fish schooling are studied actively. As the representative optimization methods for Continuous Optimization Problems (CnOPs), there are Ant Colony Optimization for continuous domains (ACO$_\mathbb{R}$) and Artificial Bee Colony (ABC) optimization algorithms which are inspired from the foraging behavior of real ants and honeybees respectively. The excellence of these algorithms have already been proven in many earlier studies on these algorithms. ACO$_\mathbb{R}$ appears a strength in the ability of the intensification to converge once the global optimum has been found, and the algorithm increases only a very small number of Function Evaluations (NFEs) at every iteration in comparison with other algorithms, showing stable and relatively rapid convergence. ACO$_\mathbb{R}$, however, is very sensitive about changing the control parameters,...
Advisors
Lee, Ju-Jangresearcher이주장
Description
한국과학기술원 : 전기및전자공학과,
Publisher
한국과학기술원
Issue Date
2014
Identifier
568585/325007  / 020095352
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 2014.2, [ xxii, 286 p. ]

Keywords

Heterogeneous swarm optimization; 메타휴리스틱; 연속 최적화; 인공 벌 군집; 개미 군집 최적화; 이종 군집 최적화; Ant colony optimization; Artificial bee colony optimization; Continuous optimization; Metaheuristics

URI
http://hdl.handle.net/10203/196549
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=568585&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0