Skip to Content
You are currently on the new version of our website. Access the old version .

14,806 Results Found

  • Article
  • Open Access
13 Citations
4,783 Views
15 Pages

5 June 2018

A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the H ∞ -norm, the H 2 -norm and the LQR functional, with possible system-performance...

(This article belongs to the Special Issue Algorithms for PID Controller)
  • Article
  • Open Access
2 Citations
3,323 Views
17 Pages

A Randomized Greedy Algorithm for Piecewise Linear Motion Planning

  • Carlos Ortiz,
  • Adriana Lara,
  • Jesús González and
  • Ayse Borat

23 September 2021

We describe and implement a randomized algorithm that inputs a polyhedron, thought of as the space of states of some automated guided vehicle R, and outputs an explicit system of piecewise linear motion planners for R. The algorithm is designed in su...

(This article belongs to the Section B: Geometry and Topology)
  • Article
  • Open Access
6 Citations
6,239 Views
19 Pages

16 March 2018

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...

  • Article
  • Open Access
11 Citations
4,618 Views
15 Pages

19 January 2018

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...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
2 Citations
841 Views
18 Pages

A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries

  • Juan F. Gomez,
  • Wenwen Chen,
  • Laura Calvet,
  • Majsa Ammouriova and
  • Angel A. Juan

7 January 2026

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...

(This article belongs to the Special Issue Applications of Symmetry/Asymmetry in Artificial Intelligence and Deep Metaheuristics)
  • Article
  • Open Access
12 Citations
4,830 Views
12 Pages

A Fast Randomized Algorithm for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery

  • Napoleão Nepomuceno,
  • Ricardo Barboza Saboia and
  • Plácido Rogério Pinheiro

3 August 2019

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...

  • Article
  • Open Access
13 Citations
4,610 Views
12 Pages

21 July 2017

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...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
10 Citations
3,093 Views
20 Pages

A Multi-Start Biased-Randomized Algorithm for the Capacitated Dispersion Problem

  • Juan F. Gomez,
  • Javier Panadero,
  • Rafael D. Tordecilla,
  • Juliana Castaneda and
  • Angel A. Juan

9 July 2022

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 article belongs to the Special Issue Metaheuristic Algorithms)
  • Article
  • Open Access
3 Citations
4,446 Views
20 Pages

A Weighted and Epsilon-Constraint Biased-Randomized Algorithm for the Biobjective TOP with Prioritized Nodes

  • Lucia Agud-Albesa,
  • Neus Garrido,
  • Angel A. Juan,
  • Almudena Llorens and
  • Sandra Oltra-Crespo

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...

(This article belongs to the Special Issue 10th Anniversary of Computation—Computational Engineering)
  • Article
  • Open Access
13 Citations
2,913 Views
19 Pages

21 July 2023

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...

(This article belongs to the Special Issue Advanced Techniques for Water-Related Remote Sensing)
  • Article
  • Open Access
26 Citations
4,248 Views
14 Pages

A Biogeography-Based Optimization with a Greedy Randomized Adaptive Search Procedure and the 2-Opt Algorithm for the Traveling Salesman Problem

  • Cheng-Hsiung Tsai,
  • Yu-Da Lin,
  • Cheng-Hong Yang,
  • Chien-Kun Wang and ,
  • Li-Chun Chiang and
  • Po-Jui Chiang
  • + 1 author+ 0 author

14 March 2023

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...

(This article belongs to the Special Issue Application of Green Energy Technology in Sustainable Environment)
  • Article
  • Open Access
4 Citations
3,420 Views
20 Pages

19 January 2024

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...

(This article belongs to the Special Issue Artificial Intelligence in Modeling and Simulation)
  • Article
  • Open Access
6 Citations
3,730 Views
26 Pages

Quantitative Inversion of Lunar Surface Chemistry Based on Hyperspectral Feature Bands and Extremely Randomized Trees Algorithm

  • Shuangshuang Wu,
  • Jianping Chen,
  • Li Li,
  • Cheng Zhang and ,
  • Rujin Huang and
  • Quanping Zhang
  • + 1 author+ 0 author

20 October 2022

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...

(This article belongs to the Special Issue Planetary Geologic Mapping and Remote Sensing)
  • Article
  • Open Access
10 Citations
6,145 Views
12 Pages

Randomized Parameterized Algorithms for the Kidney Exchange Problem

  • Mugang Lin,
  • Jianxin Wang,
  • Qilong Feng and
  • Bin Fu

25 February 2019

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...

(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
  • Article
  • Open Access
72 Citations
15,915 Views
20 Pages

Effects of Random Values for Particle Swarm Optimization Algorithm

  • Hou-Ping Dai,
  • Dong-Dong Chen and
  • Zhou-Shun Zheng

15 February 2018

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...

  • Article
  • Open Access
2,257 Views
11 Pages

Regularization Total Least Squares and Randomized Algorithms

  • Zhanshan Yang,
  • Xilan Liu and
  • Tiexiang Li

21 June 2024

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...

  • Feature Paper
  • Article
  • Open Access
1,319 Views
12 Pages

30 June 2025

We investigate Metropolis–Hastings (MH) algorithms to approximate the distribution of independent binomial random variables conditioned on the sum. Let Xi∼BIN(ni,pi). We want the distribution of [X1,…,Xk] conditioned on X1+⋯+Xk...

  • Article
  • Open Access
2,601 Views
30 Pages

26 November 2021

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 article belongs to the Special Issue Computational Statistical Methods and Extreme Value Theory)
  • Article
  • Open Access
11 Citations
3,160 Views
24 Pages

Improved African Vulture Optimization Algorithm Based on Random Opposition-Based Learning Strategy

  • Xingsheng Kuang,
  • Junfa Hou,
  • Xiaotong Liu,
  • Chengming Lin and ,
  • Zhu Wang and
  • Tianlei Wang
  • + 1 author+ 0 author

22 August 2024

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...

(This article belongs to the Section Artificial Intelligence)
  • Article
  • Open Access
20 Citations
4,074 Views
30 Pages

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...

(This article belongs to the Special Issue Bio-Inspired Optimization Algorithms and Designs for Engineering Applications)
  • Article
  • Open Access
39 Citations
8,563 Views
22 Pages

18 March 2022

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...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
2 Citations
3,540 Views
15 Pages

Model of Random Field with Piece-Constant Values and Sampling-Restoration Algorithm of Its Realizations

  • Yuri Goritskiy,
  • Vladimir Kazakov,
  • Olga Shevchenko and
  • Francisco Mendoza

14 August 2019

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...

(This article belongs to the Section Information Theory, Probability and Statistics)
  • Article
  • Open Access
4 Citations
4,049 Views
19 Pages

13 November 2019

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...

(This article belongs to the Special Issue Advanced Cybersecurity Services Design)
  • Feature Paper
  • Article
  • Open Access
3 Citations
2,837 Views
14 Pages

21 July 2021

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...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
2 Citations
3,335 Views
22 Pages

26 February 2022

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...

(This article belongs to the Section Mathematical Analysis)
  • Article
  • Open Access
3 Citations
4,623 Views
25 Pages

Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?

  • Joakim Linja,
  • Joonas Hämäläinen,
  • Paavo Nieminen and
  • Tommi Kärkkäinen

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...

(This article belongs to the Section Learning)
  • Article
  • Open Access
64 Citations
4,741 Views
19 Pages

Election Algorithm for Random k Satisfiability in the Hopfield Neural Network

  • Saratha Sathasivam,
  • Mohd. Asyraf Mansor,
  • Mohd Shareduwan Mohd Kasihmuddin and
  • Hamza Abubakar

11 May 2020

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...

(This article belongs to the Special Issue Neural Computation and Applications for Sustainable Energy Systems)
  • Article
  • Open Access
13 Citations
3,095 Views
21 Pages

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...

(This article belongs to the Special Issue Advances in Signal, Image and Information Processing)
  • Article
  • Open Access
3 Citations
2,480 Views
11 Pages

Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem

  • Geiza Silva,
  • André Leite,
  • Raydonal Ospina,
  • Víctor Leiva and ,
  • Jorge Figueroa-Zúñiga and
  • Cecilia Castro
  • + 1 author+ 0 author

12 July 2023

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...

(This article belongs to the Special Issue Bioinspired Intelligent Algorithms for Optimization, Modeling and Control: Theory and Applications, 2nd Edition)
  • Article
  • Open Access
28 Citations
3,773 Views
13 Pages

26 August 2022

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...

(This article belongs to the Special Issue Feature Papers in Electrical and Autonomous Vehicles)
  • Article
  • Open Access
3 Citations
1,503 Views
16 Pages

26 March 2024

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...

(This article belongs to the Section Chemical Processes and Systems)
  • Article
  • Open Access
16 Citations
7,216 Views
14 Pages

On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems

  • Angel Alejandro Juan,
  • Canan Gunes Corlu,
  • Rafael David Tordecilla,
  • Rocio de la Torre and
  • Albert Ferrer

25 December 2019

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 article belongs to the Special Issue Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov)
  • Article
  • Open Access
56 Citations
14,479 Views
18 Pages

Forecasting a Stock Trend Using Genetic Algorithm and Random Forest

  • Rebecca Abraham,
  • Mahmoud El Samad,
  • Amer M. Bakhach,
  • Hani El-Chaarani and ,
  • Ahmad Sardouk,
  • Sam El Nemar and
  • Dalia Jaber
  • + 2 authors+ 0 author

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...

(This article belongs to the Section Financial Markets)
  • Article
  • Open Access
2 Citations
1,178 Views
21 Pages

17 May 2025

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...

  • Article
  • Open Access
29 Citations
7,794 Views
14 Pages

Prediction of Stroke Disease with Demographic and Behavioural Data Using Random Forest Algorithm

  • Olamilekan Shobayo,
  • Oluwafemi Zachariah,
  • Modupe Olufunke Odusami and
  • Bayode Ogunleye

2 August 2023

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...

  • Feature Paper
  • Article
  • Open Access
902 Views
16 Pages

12 November 2025

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...

(This article belongs to the Special Issue Emerging Applications of Evolutionary Computing and Swarm Intelligence)
  • Article
  • Open Access
1 Citations
5,577 Views
25 Pages

12 September 2025

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...

(This article belongs to the Section Forecasting in Economics and Management)
  • Article
  • Open Access
20 Citations
3,392 Views
29 Pages

Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm

  • Vikneswari Someetheram,
  • Muhammad Fadhil Marsani,
  • Mohd Shareduwan Mohd Kasihmuddin,
  • Nur Ezlin Zamri and ,
  • Siti Syatirah Muhammad Sidik,
  • Siti Zulaikha Mohd Jamaludin and
  • Mohd. Asyraf Mansor
  • + 2 authors+ 0 author

13 December 2022

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...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
1 Citations
1,787 Views
21 Pages

30 May 2025

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...

(This article belongs to the Section Civil Engineering)
  • Article
  • Open Access
16 Citations
4,349 Views
19 Pages

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...

(This article belongs to the Special Issue Advancements in Cross-Disciplinary AI: Theory and Application)
  • Article
  • Open Access
12 Citations
3,291 Views
24 Pages

Randomized Average Kaczmarz Algorithm for Tensor Linear Systems

  • Wendi Bao,
  • Feiyu Zhang,
  • Weiguo Li,
  • Qin Wang and
  • Ying Gao

4 December 2022

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 article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
14 Citations
3,455 Views
19 Pages

2 March 2023

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...

(This article belongs to the Section Intelligent Sensors)
  • Feature Paper
  • Article
  • Open Access
7 Citations
3,882 Views
20 Pages

Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk

  • Tomoki Yamagami,
  • Etsuo Segawa,
  • Takatomo Mihana,
  • André Röhm and ,
  • Ryoichi Horisaki and
  • Makoto Naruse
  • + 1 author+ 0 author

25 May 2023

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...

(This article belongs to the Section Quantum Information)
  • Article
  • Open Access
4 Citations
2,617 Views
16 Pages

22 March 2023

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...

(This article belongs to the Special Issue Transportation Planning, Management and Optimization)
  • Article
  • Open Access
7 Citations
8,064 Views
19 Pages

24 April 2014

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...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
1 Citations
922 Views
21 Pages

29 September 2025

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....

(This article belongs to the Special Issue Swarm Intelligence and Evolutionary Algorithms for Real World Applications (2nd Edition))
  • Article
  • Open Access
12 Citations
3,941 Views
13 Pages

1 March 2018

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...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
7 Citations
3,764 Views
28 Pages

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...

(This article belongs to the Special Issue Advanced Machine Learning Applications in Big Data Analytics)
  • Article
  • Open Access
7 Citations
1,925 Views
14 Pages

13 May 2023

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...

(This article belongs to the Special Issue Structural Health Monitoring: Latest Applications and Data Analysis)
  • Article
  • Open Access
29 Citations
3,095 Views
41 Pages

A Novel Multi-Objective Hybrid Election Algorithm for Higher-Order Random Satisfiability in Discrete Hopfield Neural Network

  • Syed Anayet Karim,
  • Mohd Shareduwan Mohd Kasihmuddin,
  • Saratha Sathasivam,
  • Mohd. Asyraf Mansor and ,
  • Siti Zulaikha Mohd Jamaludin and
  • Md Rabiol Amin
  • + 1 author+ 0 author

7 June 2022

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...

(This article belongs to the Special Issue Metaheuristic Algorithms)

of 297