Journal
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS
Volume 38, Issue 6, Pages 1411-1424Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMCA.2008.2003536
Keywords
Branch-and-bound (BB); hybridization; mixed discrete nonlinear programming (MDNLP); particle swarm optimization (PSO)
Ask authors/readers for more resources
This paper proposes a new algorithm for solving mixed discrete nonlinear programming (MDNLP) problems, designed to efficiently combine particle swarm optimization (PSO), which is a well-known global optimization technique, and branch-and-bound (BB), which is a widely used systematic deterministic algorithm for solving discrete problems. The proposed algorithm combines the global but slow search of PSO with the rapid but local search capabilities of BB, to simultaneously achieve an improved optimization accuracy and a reduced requirement for computational resources. It is capable of handling arbitrary continuous and discrete constraints without the use of a penalty function, which is frequently cumbersome to parameterize. At the same time, it maintains a simple, generic, and easy-to-implement architecture, and it is based on the sequential quadratic programming for solving the NLP subproblems in the BB tree. The performance of the new hybrid PSO-BB architecture algorithm is evaluated against real-world MDNLP benchmark problems, and it is found to be highly competitive compared with existing algorithms. Index Terms-Branch-and-bound (BB), hybridization, mixed discrete nonlinear programming (MDNLP), particle swarm optimization (PSO).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available