Modular algorithm frameworks not only allow for combinations never tested in manually selected algorithm portfolios, but they also provide a structured approach to assess which algorithmic ideas are crucial for the observed performance of algorithms. In this study, we propose a methodology for analyzing the impact of the different modules on the overall performance. We consider modular frameworks for two widely used families of derivative-free black-box optimization algorithms, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and differential evolution (DE). More specifically, we use performance data of 324 modCMA-ES and 576 modDE algorithm variants (with each variant corresponding to a specific configuration of modules) obtained on the 24 BBOB problems for 6 different runtime budgets in 2 dimensions. Our analysis of these data reveals that the impact of individual modules on overall algorithm performance varies significantly. Notably, among the examined modules, the elitism module in CMA-ES and the linear population size reduction module in DE exhibit the most significant impact on performance. Furthermore, our exploratory data analysis of problem landscape data suggests that the most relevant landscape features remain consistent regardless of the configuration of individual modules, but the influence that these features have on regression accuracy varies. In addition, we apply classifiers that exploit feature importance with respect to the trained models for performance prediction and performance data, to predict the modular configurations of CMA-ES and DE algorithm variants. The results show that the predicted configurations do not exhibit a statistically significant difference in performance compared to the true configurations, with the percentage varying depending on the setup (from 49.1% to 95.5% for mod-CMA and 21.7% to 77.1% for DE).

At the Fukushima Daiichi Nuclear Power Station, radiation sources released in the accident were deposited on various equipment and building structures. During decommissioning, it is crucial to understand the distribution of radiation sources and ambient dose equivalent rates to reduce worker exposure and implement detailed work planning. In this study, the author introduces a method for visualizing radiation sources, estimates their radioactivity using a Compton camera, and derives the dose rate around the radiation sources. In the demonstration test, the Compton camera was used to visualize radioactive hotspots caused by 137Cs radiation sources deposited in the outdoor environment and estimated the radioactivity. Furthermore, the dose rate around the hotspots was calculated from the estimated radioactivity, which confirmed that the calculated dose rate correlated with the dose rate measured using a survey meter. This approach is novel, where a series of analyses were conducted using the Compton camera to visualize radioactive hotspots, estimate the radioactivity, and derive the dose rate in the surrounding environment.

Gene regulatory networks are networks of interactions in organisms responsible for determining the production levels of proteins and peptides. Mathematical and computational models of gene regulatory networks have been proposed, some of them rather abstract and called artificial regulatory networks. In this contribution, a spatial model for gene regulatory networks is proposed that is biologically more realistic and incorporates an artificial chemistry to realize the interaction between regulatory proteins called the transcription factors and the regulatory sites of simulated genes. The result is a system that is quite robust while able to produce complex dynamics similar to what can be observed in nature. Here an analysis of the impact of the initial states of the system on the produced dynamics is performed, showing that such models are evolvable and can be directed toward producing desired protein dynamics.

A domain-independent problem-solving system based on principles of Artificial Life is introduced. In this system, DIAS, the input and output dimensions of the domain are laid out in a spatial medium. A population of actors, each seeing only part of this medium, solves problems collectively in it. The process is independent of the domain and can be implemented through different kinds of actors. Through a set of experiments on various problem domains, DIAS is shown able to solve problems with different dimensionality and complexity, to require no hyperparameter tuning for new problems, and to exhibit lifelong learning, that is, to adapt rapidly to run-time changes in the problem domain, and to do it better than a standard, noncollective approach. DIAS therefore demonstrates a role for ALife in building scalable, general, and adaptive problem-solving systems.

Radioactive substances released during the accident at the Fukushima Daiichi Nuclear Power Station (FDNPS) were deposited on various equipment and building structures. During decommissioning, an investigation of the radioactive substances deposited inside the contaminated equipment and structures can provide information regarding the cause and progression of the accident. This study introduces a quantitative evaluation method for the amount of radioactivity. In this method, a Compton camera, a type of gamma-ray imager, is used to investigate the deposition and contamination level of radioactive substances on contaminated objects. Multiple 137Cs radiation sources with different radioactivities were placed horizontally in one dimension within the field of view of the Compton camera, and a proof-of-principle study was conducted to evaluate the amount of radioactivity of each source quantitatively.

We introduce two new search strategies to further improve the performance of vegetation evolution (VEGE) for solving continuous optimization problems. Specifically, the first strategy, named the dynamic maturity strategy, allows individuals with better fitness to have a higher probability of generating more seed individuals. Here, all individuals will first become allocated to generate a fixed number of seeds, and then the remaining number of allocatable seeds will be distributed competitively according to their fitness. Since VEGE performs poorly in getting rid of local optima, we propose the diverse mutation strategy as the second search operator with several different mutation methods to increase the diversity of seed individuals. In other words, each generated seed individual will randomly choose one of the methods to mutate with a lower probability. To evaluate the performances of the two proposed strategies, we run our proposal (VEGE + two strategies), VEGE, and another seven advanced evolutionary algorithms (EAs) on the CEC2013 benchmark functions and seven popular engineering problems. Finally, we analyze the respective contributions of these two strategies to VEGE. The experimental and statistical results confirmed that our proposal can significantly accelerate convergence and improve the convergence accuracy of the conventional VEGE in most optimization problems.

Distribution network reconfiguration involves altering the topology structure of distribution networks by adjusting the switch states, which plays an important role in the smart grid since it can effectively isolate faults, reduce the power loss, and improve the system stability. However, the fault reconfiguration of the distribution network is often regarded as a single-objective or multi-objective optimization problem, and its multimodality is often ignored in existing studies. Therefore, the obtained solutions may be unsuitable or infeasible when the environment changes. To improve the availability and robustness of the solutions, an improved discrete multimodal multi-objective particle swarm optimization (IDMMPSO) algorithm is proposed to solve the fault reconfiguration problem of the distribution network. To demonstrate the performance of the proposed IDMMPSO algorithm, the IEEE33-bus distribution system is used in the experiment. Moreover, the proposed algorithm is compared with other competitors. Experimental results show that the proposed algorithm can provide different equivalent solutions for decision-makers in solving the fault reconfiguration problem of the distribution network.

Monocular endoscopic 6-DoF camera tracking plays a vital role in surgical navigation that involves multimodal images to build augmented or virtual reality surgery. Such a 6-DoF camera tracking generally can be formulated as a nonlinear optimization problem. To resolve this nonlinear problem, this work proposes a new pipeline of constrained evolutionary stochastic filtering that originally introduces spatial constraints and evolutionary stochastic diffusion to deal with particle degeneracy and impoverishment in current stochastic filtering methods. With its application to endoscope 6-DoF tracking and validation on clinical data including more than 59,000 endoscopic video frames acquired from various surgical procedures, the experimental results demonstrate the effectiveness of the new pipeline that works much better than state-of-the-art tracking methods. In particular, it can significantly improve the accuracy of current monocular endoscope tracking approaches from (4.83 mm, 10.2∘) to (2.78 mm, 7.44∘).

Synthetic developmental biology aims to engineer gene regulatory mechanisms (GRMs) for understanding and producing desired multicellular patterns and shapes. However, designing GRMs for spatial patterns is a current challenge due to the nonlinear interactions and feedback loops in genetic circuits. Here we present a methodology to automatically design GRMs that can produce any given spatial pattern. The proposed approach uses two orthogonal morphogen gradients acting as positional information signals in a multicellular tissue area or culture, which constitutes a continuous field of engineered cells implementing the same designed GRM. To efficiently design both the circuit network and the interaction mechanisms-including the number of genes necessary for the formation of the target pattern-we developed an automated algorithm based on high-performance evolutionary computation. The tolerance of the algorithm can be configured to design GRMs that are either simple to produce approximate patterns or complex to produce precise patterns. We demonstrate the approach by automatically designing GRMs that can produce a diverse set of synthetic spatial expression patterns by interpreting just two orthogonal morphogen gradients. The proposed framework offers a versatile approach to systematically design and discover pattern-producing genetic circuits.

The objective of this work is to optimize a shipyard facility layout through required departments\' closeness conditions to minimize total material handling cost. In order to resolve this type facility layout problem, departments\' closeness conditions must be respected when the manufacturing and material handling processes require it according to the supply and movement requirements throughout production flow, especially when the activity requires material handling equipment of common use between departments. As a result of this work the optimization is achieved through the implementation of a stochastic sequential algorithm, comprising the following steps: 1) Topological Optimization from a Genetic Algorithm, 2) Transferring the centroid coordinates of each department from the topological grid to the geometrical grid from a computational procedure, and 3) Geometrical Optimization from a Stochastic Growth Algorithm, with a fine-tuning of the solution achieved using the Electre Method and a Local Search Method. Computational experiments were performed to prove the effectiveness of the system and evaluate the performance of each algorithm listed in the scope of the proposed solution. We have proved that the proposed Sequential Structure of Algorithms can successfully solve the problem. Computational experiments results are also presented in the supplementary material of this work.