{'fraction_non_alphanumeric': 0.021910604732690624, 'fraction_numerical': 0.0, 'mean_word_length': 4.856410256410256, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solution of Simultaneous Non-Linear Equations using Genetic Algorithms

The solution of Systems of Simultaneous Non-Linear Equations (SNLE) remains a complex and as yet not closed problem. Although analytical methods to tackle such problems do exist, they are limited in scope and, in general, demand certain prior knowledge of the functions under study. In this paper we propose a novel method to numerically solve such systems by using a Genetic Algorithm (GA). In order to show the generality of the method we first prove a theorem which allows us to equate the SNLE problem to that of minimizing a linear combination of the equations to be solved, subject to a set of constraints. Then we describe a rugged GA (the so-called Vasconcelos GA or VGA) which has been proved to perform optimally in a controlled but unbounded problem space. Next, we show how the VGA may be efficiently utilized to adapt its behavior (which is inherently adequate to solve unconstrained minimization problems) to a constrained solution space. Finally, we offer some examples of systems of non-linear equations which were solved using the proposed methodology.