It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Scheduling Problem (JSSP) is one of these problems, and for its solution, techniques based on Genetic Algorithm (GA) form the most common approach used in the literature. However, GAs are easily compromised by premature convergence and can be trapped in a local optima. To address these issues, researchers have been developing new methodologies based on local search schemes and improvements to standard mutation and crossover operators. In this work, we propose a new GA within this line of research. In detail, we generalize the concept of a massive local search operator; we improved the use of a local search strategy in the traditional mutation operator; and we developed a new multi-crossover operator. In this way, all operators of the proposed algorithm have local search functionality beyond their original inspirations and characteristics. Our method is evaluated in three different case studies, comprising 58 instances of literature, which prove the effectiveness of our approach compared to traditional JSSP solution methods.
Job Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems, meta-heuristics are one of the most commonly used approaches in its resolution, with Genetic Algorithms being one of the most effective methods in this category. However, it is well known that this meta-heuristic is affected by phenomena that worsen the quality of its population, such as premature convergence and population concentration in regions of local optima. To circumvent these difficulties, we propose, in this work, the use of a guidance operator responsible for modifying ill-adapted individuals using genetic material from well-adapted individuals. We also propose, in this paper, a new method of determining the genetic quality of individuals using genetic frequency analysis. Our method is evaluated over a wide range of modern GAs and considers two case studies defined by well-established JSSP benchmarks in the literature. The results show that the use of the proposed operator assists in managing individuals with poor fitness values, which improves the population quality of the algorithms and, consequently, leads to obtaining better results in the solution of JSSP instances. Finally, the use of the proposed operator in the most elaborate GA-like method in the literature was able to reduce its mean relative error from 1.395% to 0.755%, representing an improvement of 45.88%.
In many situations, an expert must visually analyze an image arranged in grey levels. However, the human eye has strong difficulty in detecting details in this type of image, making it necessary to use artificial coloring techniques. The pseudo-coloring problem (PsCP) consists of assigning to a grey-level image, pre-segmented in K sub-regions, a set of K colors that are as dissimilar as possible. This problem is part of the well-known class of NP-Hard problems and, therefore, does not present an exact solution for all instances. Thus, meta-heuristics has been widely used to overcome this problem. In particular, genetic algorithm (GA) is one of those techniques that stands out in the literature and has already been used in PsCP. In this work, we present a new method that consists of an improvement of the GA specialized in solving the PsCP. In addition, we propose the addition of local search operators and rules for adapting parameters based on symmetric mapping functions to avoid common problems in this type of technique such as premature convergence and inadequate exploration in the search space. Our method is evaluated in three different case studies: the first consisting of the pseudo-colorization of real-world images on the RGB color space; the second consisting of the pseudo-colorization in RGB color space considering synthetic and abstract images in which its sub-regions are fully-connected; and the third consisting of the pseudo-colorization in the Munsell atlas color set. In all scenarios, our method is compared with other state-of-the-art techniques and presents superior results. Specifically, the use of mapped automatic adjustment operators proved to be powerful in boosting the proposed meta-heuristic to obtain more robust results in all evaluated instances of PsCP in all the considered case studies.
Biometrics-based authentication has become the most well-established form of user recognition in systems that demand a certain level of security. For example, the most commonplace social activities stand out, such as access to the work environment or to one’s own bank account. Among all biometrics, voice receives special attention due to factors such as ease of collection, the low cost of reading devices, and the high quantity of literature and software packages available for use. However, these biometrics may have the ability to represent the individual impaired by the phenomenon known as dysphonia, which consists of a change in the sound signal due to some disease that acts on the vocal apparatus. As a consequence, for example, a user with the flu may not be properly authenticated by the recognition system. Therefore, it is important that automatic voice dysphonia detection techniques be developed. In this work, we propose a new framework based on the representation of the voice signal by the multiple projection of cepstral coefficients to promote the detection of dysphonic alterations in the voice through machine learning techniques. Most of the best-known cepstral coefficient extraction techniques in the literature are mapped and analyzed separately and together with measures related to the fundamental frequency of the voice signal, and its representation capacity is evaluated on three classifiers. Finally, the experiments on a subset of the Saarbruecken Voice Database prove the effectiveness of the proposed material in detecting the presence of dysphonia in the voice.