{'fraction_non_alphanumeric': 0.012629161882893225, 'fraction_numerical': 0.0, 'mean_word_length': 5.707692307692308, '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}}
BIEA: A novel evolutionary algorithm for nonlinear constrained programming

Nonlinear constrained problem has been deemed as a hard problem. This paper proposes a kind of evolutionary algorithm for constrained programming. The constrained conditions are converted into an objective and then the constrained programming is transformed into a special bi-objective unconstrained problem. The Pareto concept of multiobjective programming is introduced, then crossover operator using uniform designing method and feasible mutation operator are designed to solve this kind of bi-objective unconstrained programming. The detailed procedure of the algorithm based on two objectives is proposed. Five standard benchmarks are applied to verify the validity of the algorithm. The feasibility and efficiency of the proposed algorithm are shown by comparing with other two algorithms.