Discrete Puma Optimizer to Solve Combinatorial Optimization Problems
Discrete and combinatorial optimization problems such as routing, scheduling, and resource allocation present high computational complexity, limiting the effectiveness of classical exact optimization methods.
Ferzat Anka +3 more
doaj +4 more sources
An Improved Unordered Pair Bat Algorithm for Solving the Symmetrical Traveling Salesman Problem
Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can’t solve discrete optimization problems directly. Therefore,
Nan Zhang, Zhimin Lv, Shen Qiao, Ting Li
doaj +1 more source
The MINLP Approach to Topology, Shape and Discrete Sizing Optimization of Trusses
The paper presents the Mixed-Integer Non-linear Programming (MINLP) approach to the synthesis of trusses. The solution of continuous/discrete non-convex and non-linear optimization problems is discussed with respect to the simultaneous topology, shape ...
Simon Šilih +2 more
doaj +1 more source
Benchmarking problems for robust discrete optimization [PDF]
Robust discrete optimization is a highly active field of research where a plenitude of combinations between decision criteria, uncertainty sets and underlying nominal problems are considered. Usually, a robust problem becomes harder to solve than its nominal counterpart, even if it remains in the same complexity class.
Marc Goerigk, Mohammad Khosravi
openaire +2 more sources
Search and Rescue Optimization Algorithm for Size Optimization of Truss Structures with Discrete Variables [PDF]
In this paper, a new metaheuristic algorithm is developed to sizing optimization of truss structures with discrete variables. The proposed algorithms namely search and rescue optimization algorithm (SAR), imitates the exploration behavior of humans ...
A. Shabani, B. Asgarian, M. Salido
doaj +1 more source
Adaptive wireless network multi-objective optimization algorithm based on image synthesis
Multi-objective optimization problems can be divided into continuous multi-objective optimization problems and discrete multi-objective optimization problems, and discrete multi-objective optimization is not universal.
Jianwei Zhang, Xueya Zhang
doaj +1 more source
A comparison of mixed-variables Bayesian optimization approaches
Most real optimization problems are defined over a mixed search space where the variables are both discrete and continuous. In engineering applications, the objective function is typically calculated with a numerically costly black-box simulation ...
Jhouben Cuesta Ramirez +5 more
doaj +1 more source
A Modified Jaya Algorithm for Mixed-Variable Optimization Problems
Mixed-variable optimization problems consist of the continuous, integer, and discrete variables generally used in various engineering optimization problems.
Singh Prem, Chaudhary Himanshu
doaj +1 more source
Computational Complexity of Discrete Optimization Problems [PDF]
Recent developments in the theory of computational complexity as applied to combinatorial problems have revealed the existence of a large class of so-called NP-complete problems, either all or none of which are solvable in polynomial time. Since many infamous combinatorial problems have been proved to be NP-complete, the latter alternative seems far ...
Lenstra, J.K., Rinnooy Kan, A.H.G.
openaire +2 more sources
A New Multidisciplinary Design Optimization Method Accounting for Discrete and Continuous Variables under Aleatory and Epistemic Uncertainties [PDF]
Various uncertainties are inevitable in complex engineered systems and must be carefully treated in design activities. Reliability-Based Multidisciplinary Design Optimization (RBMDO) has been receiving increasing attention in the past decades to ...
Hong-Zhong Huang +4 more
doaj +1 more source

