##
**An application of swarm optimization to nonlinear programming.**
*(English)*
Zbl 1127.90407

Summary: Particle swarm optimization (PSO) is an optimization technique based on population, which has similarities to other evolutionary algorithms. It is initialized with a population of random solutions and searches for optima by updating generations. Particle swarm optimization has become the hotspot of evolutionary computation because of its excellent performance and simple implementation. After introducing the basic principle of the PSO, a particle swarm optimization algorithm embedded with constraint fitness priority-based ranking method is proposed in this paper to solve nonlinear programming problem. By designing the fitness function and constraints-handling method, the proposed PSO can evolve with a dynamic neighborhood and varied inertia weighted value to find the global optimum. The results from this preliminary investigation are quite promising and show that this algorithm is reliable and applicable to almost all of the problems in multiple-dimensional, nonlinear and complex constrained programming. It is proved to be efficient and robust by testing some example and benchmarks of the constrained nonlinear programming problems.

### MSC:

90C30 | Nonlinear programming |

90C59 | Approximation methods and heuristics in mathematical programming |

### Keywords:

particle swarm optimization; nonlinear programming; global optimization; evolutionary algorithm; priority-based ranking
PDFBibTeX
XMLCite

\textit{Y. Dong} et al., Comput. Math. Appl. 49, No. 11--12, 1655--1668 (2005; Zbl 1127.90407)

Full Text:
DOI

### References:

[1] | Bazarra, M. S.; Shetty, L. M., Nonlinear Programming: Theory and Algorithms, ((1979), John Wiley and Sons: John Wiley and Sons New York), 373-378 · Zbl 0476.90035 |

[2] | Fung, R. Y.K.; Tang, J. F.; Wang, D., Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints, Computers and Operations Research, 29, 261-274 (2002) · Zbl 1091.90085 |

[3] | Li, Y.; Gen, M., Non-linear mixed integer programming problems using genetic algorithm and penalty function, (Proceedings of 1996 IEEE Int. Conf. on SMC (1996)), 2677-2682 |

[4] | Takao, Y.; Gen, M.; Takeaki, T.; Li, Y., A method for interval 0-1 number non-linear programming problems using genetic algorithm, Computers and Industrial Engineering, 29, 531-535 (1995) |

[5] | Tang, J. F.; Wang, D., A hybrid genetic algorithm for a type of nonlinear programming problem, Computers Math. Applic., 36, 5, 11-21 (1998) · Zbl 0941.90068 |

[6] | Su, J.; Hu, A.; He, Z., Solving a kind of nonlinear programming problems via analog neural networks, Neurocomputing, 18, 1-9 (1998) |

[7] | Wang, Z. L.; Qiu, L.; Fu, Q.; Liang, C., Application of chaos optimization algorithm to nonlinear constrained programming (in Chinese), Journal of North China Institute of Water Conservancy and Hydroelectric Power, 23, 2, 1-3 (2002) |

[8] | Dorigo, M.; Maniezzo, V.; Colori, A., Ant system: Optimization by a colony of cooperating agents, IEEE Trans On System, Man, and Cybernetics, 26, 1, 28-41 (1996) |

[9] | Yan, L. X.; Ma, D., Global optimization of non-convex nonlinear programs using line-up competition algorithm, Computers and Chemical Engineering, 25, 1601-1610 (2001) |

[10] | Glover, F., Genetic algorithm and tabu search: Hybrid for optimizations, Computers and Operations Research, 22, 111-134 (1995) · Zbl 0813.90093 |

[11] | Lin, T. C., Applying the genetic approach to simulated annealing in solving some NP-hard problems, IEEE Trans. On SMC, 23, 1752-1766 (1993) |

[12] | Ostermark, R., Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm, Computers and Operations Research, 26, 623-635 (1999) · Zbl 0933.90048 |

[13] | Kennedy, J.; Eberhart, R., Particle swarm optimization, (Proc. IEEE Int. Conf. on Neural Networks. Proc. IEEE Int. Conf. on Neural Networks, 1942-1948, Piscataway, NJ (1995)) |

[14] | Eberhart, R.; Kennedy, J., A new optimizer using particle swarm theory, (Proc. 6th Int. Symposium on Micro Machine and Human Science. Proc. 6th Int. Symposium on Micro Machine and Human Science, 39-43, Nagoya, Japan (1995)) |

[15] | Shi, Y.; Eberhart, R., A modified particle swarm optimizer, (Proc. IEEE Int. Conf. on Evolutionary Computation (1998)), 69-73 |

[16] | Kennedy, J.; Spears, W. M., Matching algorithms to problems: An experimental tests of the particle swarm and some genetic algorithms on the multimodal problem generator, (Proc IEEE Int Conf on Evolutionary Computation (1998)), 78-83, Anchorage, AK |

[17] | Xie, X. F.; Zhang, W. J.; Ruan, J.; Yang, Z. L., Genetic algorithm for constrained nonlinear programming problems (in Chinese), Computer Engineering and Application, 21, 64-67 (2002) |

[18] | Back, T., Evolutionary Algorithms in Theory and Practice (1996), Oxford University Press: Oxford University Press New York · Zbl 0877.68060 |

[19] | Liu, B. D.; Zhao, R., Stochastic Programming and Fuzzy Programming (in Chinese), ((2001)), 26-33, Tsinghua, Beijing |

[20] | Tang, J. F.; Yung, K. L.; Ip, A. W.H., Heuristics-based integrated decision for logistic networks systems, Journal of Manufacturing Systems, 23, 1, 1-13 (2004) |

[21] | Millonas, M. M., Swarms, phase transition, and collective intelligence, (Langton, C. G., Artificial Life III (1994), Addison Wesley: Addison Wesley New York) · Zbl 0852.92027 |

[22] | Suganthan, P. N., Particle swarm optimizer with neighbourhood operator [A], (Proc of the Congress on Evolutionary Computation [C] (1999)), 1958-1962, Washington, DC |

[23] | Shi, Y. F.; Eberhart, R., Parameter selection in particle swarm optimization, (Proc. of the \(7^{th}\) Annual Conf. on Evolutionary Programming (1998)), 591-600 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.