Numerical and Evolutionary Optimization 2025

A special issue of Mathematical and Computational Applications (ISSN 2297-8747).

Deadline for manuscript submissions: 31 March 2026 | Viewed by 2258

Special Issue Editors


E-Mail Website
Guest Editor
Departamento de Ingeniería Industrial, Tecnológico Nacional de México/Instituto Tecnológico de Tijuana, Calzada Tecnológico SN, Tomas Aquino, Tijuana 22414, México
Interests: data science; machine learning; evolutionary computation; HPC
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Departamento de Ingeniería en Electrónica y Eléctrica, Tecnológico Nacional de México/Instituto Tecnológico de Tijuana, Calzada Tecnológico SN, Tomas Aquino, Tijuana 22414, Mexico
Interests: evolutionary computation; machine learning; data science; computer vision
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Bordeaux INP, IMS Laboratory, UMR CNRS 5218, ASTRAL Team, Centre Inria de l'Université de Bordeaux, 33400 Talence, France
Interests: signal enhancement; wavelets; fractals; fractal analysis; Hölderian regularity; Hölder exponents; estimation; regression; denoising; optimal rate of convergence; minimax; risk; interpolation; extrapolation; road/tyre friction; indenters; multi-scale; evolutionary algorithms; genetic programming; bloat control; stereovision; classification; matching; biomedical applications; EEG analysis; cochlear implants; virtual analogue modeling; amplifier; neural networks

E-Mail Website
Guest Editor
Departamento de Computacion, Cinvestav, Mexico City 07360, Mexico
Interests: multi-objective optimization; evolutionary computation (genetic algorithms and evolution strategies); numerical analysis; engineering applications
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

This Special Issue will mainly consist of selected papers presented at the 12th International Workshop on Numerical and Evolutionary Optimization (NEO 2025; see https://neo-workshop.com for detailed information). However, other works that fit within the scope of NEO are also welcome.

The aim of this Special Issue is to collect papers on the intersection of numerical and evolutionary optimization. We strongly encourage the development of fast and reliable hybrid methods that maximize the strengths and minimize the weaknesses of each underlying paradigm while also being applicable to a broader class of problems. Moreover, this Special Issue aims to foster an understanding and adequate treatment of real-world problems, particularly in emerging fields that affect us all, such as healthcare, smart cities, and big data, among many others.

Topics of interest include (but are not limited to) the following:

(A) Search and optimization:

  • Single- and multi-objective optimization;
  • Mathematical programming techniques;
  • Evolutionary algorithms;
  • Genetic programming;
  • Hybrid and memetic algorithms;
  • Set-oriented numerics;
  • Stochastic optimization;
  • Robust optimization.

(B) Real-world problems:

Optimization, machine learning, and metaheuristics applied to:

  • Energy production and consumption;
  • Health monitoring systems;
  • Computer vision and pattern recognition;
  • Energy optimization and prediction;
  • Modeling and control of real-world energy systems;
  • Smart cities.

Prof. Dr. Daniel E. Hernández
Dr. Marcela Quiroz-Castellanos
Dr. Leonardo Trujillo
Prof. Dr. Pierrick Legrand
Prof. Dr. Oliver Schütze
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematical and Computational Applications is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • single- and multi-objective optimization
  • evolutionary algorithms
  • genetic programming
  • hybrid and memetic algorithms
  • set-oriented numerics

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

28 pages, 572 KB  
Article
New Adaptive Echolocation Radar Technique Incorporated into the Bat Algorithm Applied to Benchmark Functions (Radar-Bat)
by Miguel A. García-Morales, Rubén Salas-Cabrera, Bárbara María-Esther García-Morales, Juan Frausto-Solís and Joel Rodríguez-Guillén
Math. Comput. Appl. 2026, 31(1), 20; https://doi.org/10.3390/mca31010020 - 2 Feb 2026
Viewed by 176
Abstract
This article proposes a bat algorithm that incorporates novel techniques inspired by maritime radars, referred to as the Radar-Bat algorithm. This proposed method allows each virtual bat to identify the position of the best solution at a given distance within the search space. [...] Read more.
This article proposes a bat algorithm that incorporates novel techniques inspired by maritime radars, referred to as the Radar-Bat algorithm. This proposed method allows each virtual bat to identify the position of the best solution at a given distance within the search space. It incorporates an adaptive threshold to maintain a constant false alarm rate (CFAR), enabling the acceptance of solutions based on the best value found, thus improving the exploitation of the search space. Furthermore, a systematic directional sweep balances exploration and exploitation effectively. This algorithm is used to solve complex optimization problems, essentially those with multimodal functions, demonstrating that the proposed algorithm achieves better convergence and robustness compared to the basic bat algorithm, highlighting its potential as a novel contribution to the field of metaheuristics. To evaluate the performance of the proposed algorithm against the basic bat algorithm, the Wilcoxon and Friedman non-parametric tests are applied, with a significance level of 5%. Computational experiments show that the proposed algorithm outperforms the state-of-the-art algorithm. In terms of quality, the proposed algorithm shows clear superiority over the basic bat algorithm across most benchmark functions. Regarding efficiency, although Radar Bat incorporates additional mechanisms, the experimental results do not indicate a consistent disadvantage in execution time, with both algorithms exhibiting comparable performance depending on the problem and dimensionality. Full article
(This article belongs to the Special Issue Numerical and Evolutionary Optimization 2025)
Show Figures

Figure 1

21 pages, 988 KB  
Article
Study of Performance from Hierarchical Decision Modeling in IVAs Within a Greedy Context
by Francisco Federico Meza-Barrón, Nelson Rangel-Valdez, María Lucila Morales-Rodríguez, Claudia Guadalupe Gómez-Santillán, Juan Javier González-Barbosa, Guadalupe Castilla-Valdez, Nohra Violeta Gallardo-Rivas and Ana Guadalupe Vélez-Chong
Math. Comput. Appl. 2026, 31(1), 8; https://doi.org/10.3390/mca31010008 - 7 Jan 2026
Viewed by 513
Abstract
This study examines decision-making in intelligent virtual agents (IVAs) and formalizes the distinction between tactical decisions (individual actions) and strategic decisions (composed of sequences of tactical actions) using a mathematical model based on set theory and the Bellman equation. Although the equation itself [...] Read more.
This study examines decision-making in intelligent virtual agents (IVAs) and formalizes the distinction between tactical decisions (individual actions) and strategic decisions (composed of sequences of tactical actions) using a mathematical model based on set theory and the Bellman equation. Although the equation itself is not modified, the analysis reveals that the discount factor (γ) influences the type of decision: low values favor tactical decisions, while high values favor strategic ones. The model was implemented and validated in a proof-of-concept simulated environment, namely the Snake Coin Change Problem (SCCP), using a Deep Q-Network (DQN) architecture, showing significant differences between agents with different decision profiles. These findings suggest that adjusting γ can serve as a useful mechanism to regulate both tactical and strategic decision-making processes in IVAs, thus offering a conceptual basis that could facilitate the design of more intelligent and adaptive agents in domains such as video games, and potentially in robotics and artificial intelligence as future research directions. Full article
(This article belongs to the Special Issue Numerical and Evolutionary Optimization 2025)
Show Figures

Figure 1

Back to TopTop