2023
DOI: 10.1016/j.rico.2023.100315
|View full text |Cite
|
Sign up to set email alerts
|

A review of classical methods and Nature-Inspired Algorithms (NIAs) for optimization problems

Pawan Kumar Mandal
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 190 publications
0
2
0
Order By: Relevance
“…The application of optimization algorithms in the field of bridge engineering can solve design problems with room for improvement, thus significantly increasing the accuracy of the analysis, helping engineers to better understand and predict the behavior of bridges, and improving the efficiency and safety of bridge design and maintenance [9][10][11]. Commonly used optimization algorithms include the genetic algorithm, the particle swarm optimization algorithm, the simulated annealing algorithm, and so on [12,13]. The genetic algorithm is a computational model used to search for the optimal solution by simulating the natural evolution process and has good robustness and global search ability when solving multi-objective optimization problems [14,15].…”
Section: Introductionmentioning
confidence: 99%
“…The application of optimization algorithms in the field of bridge engineering can solve design problems with room for improvement, thus significantly increasing the accuracy of the analysis, helping engineers to better understand and predict the behavior of bridges, and improving the efficiency and safety of bridge design and maintenance [9][10][11]. Commonly used optimization algorithms include the genetic algorithm, the particle swarm optimization algorithm, the simulated annealing algorithm, and so on [12,13]. The genetic algorithm is a computational model used to search for the optimal solution by simulating the natural evolution process and has good robustness and global search ability when solving multi-objective optimization problems [14,15].…”
Section: Introductionmentioning
confidence: 99%
“…In quadratic programming, we want to determine the variable values that minimize or maximize the quadratic objective function that satisfies several linear constraints [2]. There are two ways to solve quadratic programming problems: the classical method [3] and the heuristic method [4]. This research uses two methods, namely the classical method using Wolfe's method, while the heuristic method uses the particle swarm optimization (PSO) algorithm.…”
Section: Introductionmentioning
confidence: 99%