Comparación de las técnicas de optimización por análisis de intervalos y la de enjambre de partículas para funciones con restricciones

this paper shows the comparison made between the particle swarm optimization (pso) algorithm and the interval analysis optimization method for solving nonlinear-function optimization with equality and/or inequality constraints. the interval analysis optimization method (iao) was based on the one initially proposed by ichida (1996). it was used to find the global optimum of a multimodal function with up to three variables, which is subject to equality and inequality constraints. it was found that the pso algorithm was significantly faster for all functions, although its precision was limited. on the other hand, the iao method was accurate in all cases, but took a considerably longer computational time.