Contact : 9561854529 Email : submitpaper@ijaea.com editorinchief.ijaea@gmail.com Working Hours: 9am to 9PM

International Journal of Advanced Engineering Application

ISSN: 3048-6807

Submit Paper Apply for Reviewer

Bio-Inspired Optimization Algorithms for Multi-Objective Engineering Design Problems

Author(s):S. Aravind1, K. Meenakshi2

Affiliation: 1,2Department of Mechanical Engineering, Sankalchand Patel College of Engineering, India

Page No: 32-37

Volume issue & Publishing Year: Volume 2 Issue 9 ,Sep -2025

Journal: International Journal of Advanced Engineering Application (IJAEA)

ISSN NO: 3048-6807

DOI: https://zenodo.org/records/17623780

Download PDF

Article Indexing:

Abstract:
Engineering design problems often involve multiple, conflicting objectives such as minimizing weight while maximizing strength, or reducing energy consumption while enhancing performance. Traditional optimization methods struggle to handle such trade-offs effectively, especially in high-dimensional, nonlinear search spaces. Bio-inspired optimization algorithms, modeled on natural processes like evolution, swarm intelligence, and immune systems, have emerged as powerful tools for addressing multi-objective design challenges. This paper explores the application of algorithms such as Genetic Algorithms, Particle Swarm Optimization, Ant Colony Optimization, and Differential Evolution for solving multi-objective engineering design problems. Case studies include structural optimization, thermal system design, and electronic circuit parameter tuning. Comparative results highlight that bio-inspired methods can achieve well-distributed Pareto-optimal solutions, outperforming classical approaches in both convergence speed and solution diversity. The findings demonstrate that these algorithms offer significant promise in advancing engineering design by enabling robust, scalable, and efficient optimization

Keywords: Multi-Objective Optimization, Bio-Inspired Algorithms, Genetic Algorithm, Particle Swarm Optimization, Engineering Design, Pareto Front, Swarm Intelligence

Reference:

  • [1] J. H. Holland, “Adaptation in Natural and Artificial Systems,” University of Michigan Press, Ann Arbor, 1975.
  • [2] D. E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine Learning,” Addison-Wesley, Reading, MA, 1989.
  • [3] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002.
  • [4] J. Kennedy and R. Eberhart, “Particle swarm optimization,” Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, 1995.
  • [5] C. A. Coello, G. T. Pulido, and M. S. Lechuga, “Handling multiple objectives with particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 256–279, 2004.
  • [6] M. Dorigo and T. Stützle, “Ant Colony Optimization,” MIT Press, Cambridge, MA, 2004.
  • [7] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 26, no. 1, pp. 29–41, 1996.
  • [8] R. Storn and K. Price, “Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, pp. 341–359, 1997.
  • [9] S. Yang, Y. Ong, and Y. Jin, “Evolutionary Computation in Dynamic and Uncertain Environments,” Springer, Berlin, 2007.
  • [10] E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: Improving the Strength Pareto Evolutionary Algorithm,” Technical Report 103, ETH Zurich, 2001.
  • [11] H. Li and Q. Zhang, “Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 284–302, 2009.
  • [12] S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey Wolf Optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014.
  • [13] A. H. Gandomi, X. Yang, and A. H. Alavi, “Cuckoo search algorithm: A metaheuristic approach to engineering optimization,” Engineering with Computers, vol. 29, pp. 17–35, 2013.
  • [14] J. Knowles and D. Corne, “Approximating the nondominated front using the Pareto archived evolution strategy,” Evolutionary Computation, vol. 8, no. 2, pp. 149–172, 2000.
  • [15] R. Cheng and Y. Jin, “A competitive swarm optimizer for large-scale optimization,” IEEE Transactions on Cybernetics, vol. 45, no. 2, pp. 191–204, 2015.