- Article
A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the -norm, the -norm and the LQR functional, with possible system-performance...
A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the -norm, the -norm and the LQR functional, with possible system-performance...
We describe and implement a randomized algorithm that inputs a polyhedron, thought of as the space of states of some automated guided vehicle
To construct an online kernel adaptive filter in a non-stationary environment, we propose a randomized feature networks-based kernel least mean square (KLMS-RFN) algorithm. In contrast to the Gaussian kernel, which implicitly maps the input to an inf...
In this paper, a distributed randomized gradient-free algorithm (DRGF) is employed to solve the complex non-convex economic dispatch problem whose non-convex constraints include valve-point loading effects, prohibited operating zones, and multiple fu...
Given a network of nodes and a certain demand that needs to be satisfied, the capacitated dispersion problem (CDP) involves selecting a subset of nodes to maximize dispersion between them. In many practical instances, symmetry in the structure of the...
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest n...
The economic dispatch problem of a virtual power plant (VPP) is becoming non-convex for distributed generators’ characteristics of valve-point loading effects, prohibited operating zones, and multiple fuel options. In this paper, the economic dispatc...
The capacitated dispersion problem is a variant of the maximum diversity problem in which a set of elements in a network must be determined. These elements might represent, for instance, facilities in a logistics network or transmission devices in a...
This paper addresses a multiobjective version of the Team Orienteering Problem (TOP). The TOP focuses on selecting a subset of customers for maximum rewards while considering time and fleet size constraints. This study extends the TOP by considering...
The detection performance of active sonar is often hindered by the presence of seabed reverberation in shallow water. Separating the reverberations from the target echo and noise in the received signal is a crucial challenge in the field of underwate...
We develop a novel method to improve biogeography-based optimization (BBO) for solving the traveling salesman problem (TSP). The improved method is comprised of a greedy randomized adaptive search procedure, the 2-opt algorithm, and G2BBO. The G2BBO...
In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to min...
In situ resource utilization (ISRU) is required for the operation of both medium and long-term exploration missions to provide metallic materials for the construction of lunar base infrastructure and H2O and O2 for life support. The study of the dist...
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries. In the programs, designing algorithms for the kidney exchange problem plays a critical...
Particle swarm optimization (PSO) algorithm is generally improved by adaptively adjusting the inertia weight or combining with other evolution algorithms. However, in most modified PSO algorithms, the random values are always generated by uniform dis...
In order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is conside...
We investigate Metropolis–Hastings (MH) algorithms to approximate the distribution of independent binomial random variables conditioned on the sum. Let
We propose a stochastic algorithm for global optimisation of a regular function, possibly unbounded, defined on a bounded set with regular boundary; a function that attains its extremum in the boundary of its domain of definition. The algorithm is de...
This paper proposes an improved African vulture optimization algorithm (IROAVOA), which integrates the random opposition-based learning strategy and disturbance factor to solve problems such as the relatively weak global search capability and the poo...
The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later i...
The key schedule algorithm (KSA) is a crucial element of symmetric block ciphers with a direct security impact. Despite its undeniable significance, the KSA is still a less focused area in the design of an encryption algorithm. PRESENT is a symmetric...
We propose a description of the model of a random piecewise constant field formed by the sum of realizations of two Markov processes with an arbitrary number of states and defined along mutually perpendicular axes. The number of field quantization le...
Recent cyberattacks armed with various ICT (information and communication technology) techniques are becoming advanced, sophisticated and intelligent. In security research field and practice, it is a common and reasonable assumption that attackers ar...
Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to tes...
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a randomized Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e., the equations within the system are distri...
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares pro...
Election Algorithm (EA) is a novel variant of the socio-political metaheuristic algorithm, inspired by the presidential election model conducted globally. In this research, we will investigate the effect of Bipolar EA in enhancing the learning proces...
Improved encryption devices place higher demands on the randomness and security of encrypted images. Existing image encryption optimization methods based on single- or multi-objectives concentrate on selecting keys and parameters, resulting in relati...
The maximum diversity problem (MDP) aims to select a subset with a predetermined number of elements from a given set, maximizing the diversity among them. This NP-hard problem requires efficient algorithms that can generate high-quality solutions wit...
Path planning is a hot topic at present. Considering the global and local path planning of mobile robot is one of the challenging research topics. The objective of this paper is to create a rasterized environment that optimizes the planning of multip...
The online measurement of the aluminum–silicon ratio of red mud in the dissolution stage of the Bayer alumina production process is difficult to achieve. The offline assay method has a high cost and strong time delay. Soft sensors are an effect...
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventor...
This paper addresses the problem of forecasting daily stock trends. The key consideration is to predict whether a given stock will close on uptrend tomorrow with reference to today’s closing price. We propose a forecasting model that comprises a feat...
With the rapid popularization of video software, video recommendation algorithms have become crucial for ensuring the quality of video platforms. This study focuses on video tags and constructs a ternary structure of user–video–tags. It p...
Stroke is a major cause of death worldwide, resulting from a blockage in the flow of blood to different parts of the brain. Many studies have proposed a stroke disease prediction model using medical features applied to deep learning (DL) algorithms t...
In this work, we propose a novel Biased Random-Key Genetic Algorithm (BRKGA) to solve the Maximum Flow with Minimum Number of Labels (MF-ML) problem, a challenging NP-Complete variant of the classical Maximum Flow problem defined on graphs in which a...
The aim of this paper is the analysis and selection of stock trading systems that combine different models with data of a different nature, such as financial and microeconomic information. Specifically, based on previous work by the authors and with...
Real life logical rule is not always satisfiable in nature due to the redundant variable that represents the logical formulation. Thus, the intelligence system must be optimally governed to ensure the system can behave according to non-satisfiable st...
To thoroughly investigate the distribution of heavy rain disaster risks in the Beijing–Tianjin–Hebei region, this paper analyzes the spatiotemporal evolution characteristics of heavy rain disaster-inducing factors. Based on disaster syste...
Experts in agriculture have conducted considerable work on rice plant protection. However, in-depth exploration of the plant disease problem has not been performed. In this paper, we find the trend of rice diseases by using the cascade parallel rando...
For solving tensor linear systems under the tensor–tensor t-product, we propose the randomized average Kaczmarz (TRAK) algorithm, the randomized average Kaczmarz algorithm with random sampling (TRAKS), and their Fourier version, which can be ef...
This paper researches the recognition of modulation signals in underwater acoustic communication, which is the fundamental prerequisite for achieving noncooperative underwater communication. In order to improve the accuracy of signal modulation mode...
Quantum walks (QWs) have a property that classical random walks (RWs) do not possess—the coexistence of linear spreading and localization—and this property is utilized to implement various kinds of applications. This paper proposes RW- an...
The planning and management of traffic flow networks with multiple input data sources for decision-making generate the need for a mathematical approach. The program of measures for the development of the transport infrastructure of the Russian Federa...
Traditional object tracking technology usually regards the target as a point source object. However, this approximation is no longer appropriate for tracking extended objects such as large targets and closely spaced group objects. Bayesian extended o...
In this paper a novel adaptive rapidly-exploring random trees algorithm based on cross-entropy optimization (CE-RRT) is proposed. We seek to provide a low-cost, fast, and effective solution for path planning of robots in various complex environments....
The increasing penetration of distributed energy resources in distribution systems has brought a number of network management and operational challenges; reactive power variation has been identified as one of the dominant effects. Enormous growth in...
The butterfly optimization algorithm (BOA) is a swarm intelligence optimization algorithm proposed in 2019 that simulates the foraging behavior of butterflies. Similarly, the BOA itself has certain shortcomings, such as a slow convergence speed and l...
The paper presents the results of verification of the suitability of the random forest algorithm for the non-invasive assessment of excessively damp and salty historical brick walls. A new method of such quantitative assessment was developed and rece...
Hybridized algorithms are commonly employed to improve the performance of any existing method. However, an optimal learning algorithm composed of evolutionary and swarm intelligence can radically improve the quality of the final neuron states and has...
of 297