An Improved HPSACO for Engineering Optimum Design Problems

An improved heuristic particle swarm ant colony optimization (HPSACO) is presented tosolve engineering optimization problems. This new algorithm follows the HPSACO levels;however some modifications are performed in global and local searching levels to improveits performance. Here, the properties of the big bang–big crunch algorithm are added to PSO and ACO in global and local searching levels, respectively and these changes improveprecision of the solutions and the reliability of the algorithm. Benchmark engineeringoptimization problems are used to illustrate the reliability of the proposed algorithm.