Search
Search Results
-
A new improved teaching–learning-based optimization (ITLBO) algorithm for solving nonlinear inverse partial differential equation problems
Teaching–learning-based optimization (TLBO) algorithm is a novel population-oriented meta-heuristic algorithm. In this paper, we introduce an...
-
Map** structural topology optimization problems to quantum annealing
Quantum computing (QC) is a rapidly growing technology in the field of computation that has garnered significant attention in recent years. This...
-
Particle swarm optimization based on temporal-difference learning for solving multi-objective optimization problems
Multi-objective evolutionary algorithms have become the most important method to deal with multi-objective optimization problems (MOP). To improve...
-
A tree search algorithm towards solving Ising formulated combinatorial optimization problems
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily...
-
Self-Adaptive Forensic-Based Investigation Algorithm with Dynamic Population for Solving Constraint Optimization Problems
The Forensic-Based Investigation (FBI) algorithm is a novel metaheuristic algorithm. Many researches have shown that FBI is a promising algorithm due...
-
A Hybrid Discrete Grey Wolf Optimization Algorithm Imbalance-ness Aware for Solving Two-dimensional Bin-packing Problems
In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the...
-
Multi-objective robust optimization using adaptive surrogate models for problems with mixed continuous-categorical parameters
Explicitly accounting for uncertainties is paramount to the safety of engineering structures. Optimization which is often carried out at the early...
-
Hybrid teaching–learning-based optimization for solving engineering and mathematical problems
In this work, a new and effective algorithm called hybrid teaching–learning-based optimization (TLBO) and charged system search (CSS) algorithms...
-
Solving larger maximum clique problems using parallel quantum annealing
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary...
-
An improved hybrid salp swarm optimization and African vulture optimization algorithm for global optimization problems and its applications in stock market prediction
Optimization is necessary for solving and improving the solution of various complex problems. Every meta-heuristic algorithm can have a weak point,...
-
Application of Optimization Algorithms for Solving Marine Seismic Survey Planning Problems with Bottom Stations in the Arctic Shelf
AbstractAn algorithm for optimizing the trajectories and movement sequence of a fleet of marine seismic survey vessels in solving the problem of...
-
Ferroelectric compute-in-memory annealer for combinatorial optimization problems
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising...
-
Tree optimization algorithm (TOA): a novel metaheuristic approach for solving mathematical test functions and engineering problems
This study presents a new metaheuristic optimization algorithm named Tree Optimization Algorithm (TOA) for solving mathematical benchmark functions...
-
Black-winged kite algorithm: a nature-inspired meta-heuristic for solving benchmark functions and engineering problems
This paper innovatively proposes the Black Kite Algorithm (BKA), a meta-heuristic optimization algorithm inspired by the migratory and predatory...
-
Investigating Fractal Decomposition Based Algorithm on Low-Dimensional Continuous Optimization Problems
This paper analyzes the performance of the Fractal Decomposition Algorithm (FDA) metaheuristic applied to low-dimensional continuous optimization...
-
African vultures optimization algorithm based Choquet fuzzy integral for global optimization and engineering design problems
Addressing complex optimization problems demands innovative solutions capable of navigating the interdependencies among variables, a reality often...
-
A review of nature-inspired algorithms on single-objective optimization problems from 2019 to 2023
The field of nature inspired algorithm (NIA) is a vital area of research that consistently aids in solving optimization problems. One of the...
-
Parallel Global Search Algorithm with Local Tuning for Solving Mixed-Integer Global Optimization Problems
AbstractIn this paper, we consider mixed-integer global optimization problems and propose a parallel algorithm for solving problems of this class...
-
A Novel Binary Artificial Jellyfish Search Algorithm for Solving 0–1 Knapsack Problems
The knapsack problem is an NP-hard combinatorial optimization problem for which it is difficult to find a polynomial-time solution. Many researchers...
-
Isogeometric analysis for solving discontinuous two-phase engineering problems with precise and explicit interface representation
This paper presents a new computational method for solving two-phase engineering problems. The novelty of this approach lies in its ability to...
