Natural Computing: an international journal

This work aims at reviewing the state of the art of the field of lexicographic multi/many-objective optimization. The discussion starts with a review of the literature, emphasizing the numerous application in the real life and the recent burst ...

Optimization problems with multiple objectives and many input variables inherit challenges from both large-scale optimization and multi-objective optimization. To solve the problems, decomposition and transformation methods are frequently used. In ...

The problem of cluster analysis eludes a unique mathematical definition. Instead, a variety of different instantiations of the problem can be defined using specific measures of internal cluster validity. In turn, such internal cluster validity ...$\mathrm{}$

Single-objective continuous optimization can be challenging, especially when dealing with multimodal problems. This work sheds light on the effects that multi-objective optimization may have in the single-objective space. For this purpose, we ...

In the last decade, it is widely known that the Pareto dominance-based evolutionary algorithms (EAs) are unable to deal with many-objective optimization problems (MaOPs) well, as it is hard to maintain a good balance between convergence and ...$$

Pathfinding, also known as route planning, is one of the most important aspects of logistics, robotics, and other applications where engineers must balance many competing interests. There is a significant challenge in pathfinding problems with ...

In many real-world engineering design optimization problems, objective function evaluations are very time costly and often conducted by solving partial differential equations. Gradients of the objective functions can be obtained as a byproduct. ...

Many real-world multi-objective optimization problems inherently have multiple multi-modal solutions and it is in fact very important to capture as many of these solutions as possible. Several crowding distance methods have been developed in the ...

Asynchronous, finite dynamical systems are constructed by composing vertex functions $f_1$, $f_2$ through $f_n$ using an order $\pi$ on $\{1,2,\dots ,n\}$ to form maps $f_{\pi }$. This article provides a systematic review and new results for comparing the dynamics of maps $f_{\pi }$ ...${}_{{}^{}}$$$${}^{}$

As one of the three basic control parameters of the differential evolution algorithm (DE), the population size (PS) has attracted extensive attention. In general, the most appropriate population size varies for different types of problems and ...

We demonstrate the role of randomness and altruism in the motion of artificial agents in a deterministic environment. A swarm of distributed autonomous agents with no possibility of coordination tracks a unique target. The goal is to reach the ...