{'fraction_non_alphanumeric': 0.027928626842513578, 'fraction_numerical': 0.0069821567106283944, 'mean_word_length': 5.3861386138613865, '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}}
Parallel multiobjective evolutionary algorithms for waste solvent recycling

Waste solvents are of great concern to the chemical process industries and to the public, and many technologies have been suggested and implemented in the chemical process industries to reduce waste and associated environmental impacts. As reported in this article, we have developed a novel parallel multiobjective steady-state genetic algorithm (pMSGA) for designing environmentally benign and economically viable processes for waste solvent recycling. This pMSGA can efficiently solve this complex multiobjective design problem and provide accurate and uniform Pareto-optimal (i.e., tradeoff) solutions. In addition, it can approximate a wider range of the Pareto front than other multiobjective genetic algorithms. As a case study, acetic acid recovery from aqueous waste mixtures is investigated under simultaneous maximization of the total profit and minimization of the potential environmental impacts (PEIs). At low acetic acid feed contents (x F = 0.25), many of the Pareto-optimal solutions are economically infeasible and also provided minimal PEI reduction. However, at medium and high feed contents (x F = 0.30 and 0.35), the total profit is very large, and the PEI reduction is significant as well.