Abstract

Neural network algorithm (NNA) is one of the newest meta-heuristic algorithms, which is inspired by biological nervous systems and artificial neural networks. Benefiting from the unique structure of artificial neural networks, NNA has good global search ability. However, slow convergence is its drawback that restricts its practical application. Teaching–learning-based optimization (TLBO) is an algorithm without any effort for fine tuning initial parameters, which has fast convergence speed while it is easy to fall into local optimum in solving complex global optimization problems. Considering the features of NNA and TLBO, an effective hybrid method based on TLBO and NNA, named TLNNA, is proposed for solving engineering optimization problems. The performance of TLNNA for 30 well-known unconstrained benchmark functions and 4 challenging engineering optimization problems is examined and the optimization results are compared with other competitive meta-heuristic algorithms. Such comparisons suggest that TLNNA has not only good global search ability of NNA but also fast convergence speed of TLBO and is more successful for most test problems in terms of solution quality and computational efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call