A partition crossover operator is introduced for use with NK landscapes, MAX-kSAT and all k-bounded pseudo-Boolean functions. By definition, these problems a bit representation. Under crossover, the evaluation of offspring can be directly obtained from partial evaluations substrings found in parents. Partition explores variable interaction graph functions order to variables solution vector. Proofs are presented showing that if differing assignments two parents partitioned into q...

The NK hybrid genetic algorithm for clustering is proposed in this paper. In order to evaluate the solutions, uses validation criterion 2 (NKCV2). NKCV2 information about disposition of $N$ small groups objects. Each group composed $K+1$ objects dataset. Experimental results show that density-based regions can be identified by using with fixed $K$. NKCV2, relationship between decision variables known, which turn allows us apply gray box optimization. Mutation operators, a partition...

Obstructive sleep apnea (OSA) is a prevalent disorder with high rate of undiagnosed patients, primarily due to the complexity its diagnosis made by polysomnography (PSG). Considering severe comorbidities associated OSA, especially in cardiovascular system, development early screening tools for this disease imperative. Heart variability (HRV) simple and non-invasive approach used as probe evaluate cardiac autonomic modulation, variety newly developed indices lacking studies OSA patients. We...

Abstract In this article we discuss artificial neural networks‐based fault detection and isolation (FDI) applications for robotic manipulators. The networks (ANNs) are used both residual generation analysis. A multilayer perceptron (MLP) is employed to reproduce the dynamics of manipulator. Its outputs compared with actual position velocity measurements, generating so‐called vector. residuals, when properly analyzed, provides an indication status robot (normal or faulty operation). Three...

In this paper, robotic systems when two or more underactuated manipulators are working in a cooperative way studied. The underactuation effects on object to be controlled and load capacity of the arms analyzed. A hybrid control motion squeeze force is proposed. For control, Jacobian matrix that relates torques actuated joints resulting obtained. addition, method compute dynamic load-carrying with passive presented. Results system verified simulations an actual formed by arms.

In gray-box optimization, the search algorithms have access to variable interaction graph (VIG) of optimization problem. For Mk Landscapes (and NK Landscapes) we can use VIG identify an improving solution in Hamming neighborhood constant time. addition, using VIG, deterministic Partition Crossover is able explore exponential number solutions a time that linear size Both methods been used isolation previous algorithms. We present two new combine with highly efficient local search. The best...

Generalized Partition Crossover (GPX) is a deterministic recombination operator developed for the Traveling Salesman Problem. crossover operators return best of [Formula: see text] reachable offspring, where number recombining components. This article introduces new GPX2 operator, which finds more components than GPX or Iterative Partial Transcription (IPT). We also show that has O([Formula: text]) runtime complexity, while introducing enhancements to reduce execution time GPX2. Finally, we...

Dysautonomia plays an ancillary role in the pathogenesis of Chronic Chagas Cardiomyopathy (CCC), but is key factor causing digestive organic involvement. We investigated ability heart rate variability (HRV) for death risk stratification CCC and compared alterations HRV patients with isolated those mixed form (CCC + involvement). Thirty-one were classified into three groups (low, intermediate high) according to their Rassi score. A single-lead ECG was recorded a period 10-20 min, RR series...

The organization of the canonical code has intrigued researches since it was first described. If we consider all codes mapping 64 into 20 amino acids and one stop codon, there are more than 1.51×10(84) possible genetic codes. main question related to is why exactly selected among this huge number Many researchers argue that a product natural selection code's robustness against mutations would support hypothesis. In order investigate hypothesis, some employ optimization algorithms identify...

The Generalized Partition Crossover (GPX) constructs new solutions for the Traveling Salesman Problem (TSP) by finding recombining partitions with one entry and exit in graph composed union of two parent solutions. If there are k graph, 2^k-2 simultaneously exploited GPX. Asymmetric (GAPX) is introduced; it finds more can also find asymmetric TSP. GAPX does this locating that cut vertices degree 4 multiple points, both O(n) time. improve quality generated Lin-Kernighan-Helsgaun heuristic state art

The best known exact solver for generating provably optimal solutions to the Traveling Salesman Problem (TSP) is Concorde algorithm. uses a branch and bound search strategy, as well cutting planes reduce space. first step in using obtain good initial solution. A solution can be generated heuristic outside of Concorde, or generate its own Chained Lin Kernighan (LK) In this paper, we speed up by improving produced LK Partition Crossover. Crossover powerful deterministic recombination operator...

In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in fitness landscape during process. Using proposed analysis framework, following DOPs analysed: generated by XOR DOP generator, three versions of 0–1 knapsack problem, one problem involving evolutionary robots environments, and random dynamics NK-model. The generator creates benchmark from any binary static which allows explore properties a environment. Three types...

Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance applications of algorithms real world problems. In order study environments, one important work is develop benchmark environments. This paper proposes two continuous problem generators. Both generators use linear transformation move individuals, which preserves distance among individuals. first generator, individuals equivalent change...

In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods is adapt operators order a new environment. This paper investigates the effect selection pressure on A hyper-selection scheme proposed algorithms, where temporarily raised whenever environment changes. The can be combined with other Experiments are carried out investigate different pressures environments and...

In the dynamic traveling salesman problem (DTSP), weights and vertices of graph representing TSP are allowed to change during optimization. This work first discusses some issues related use evolutionary algorithms in DTSP. When efficient used for static applied with restart DTSP, we observe that only edges generally inserted removed from best solutions after changes. result indicates a possible beneficial memory approaches, usually employed cyclic environments. We propose approach hybrid...