{'fraction_non_alphanumeric': 0.02494802494802495, 'fraction_numerical': 0.0, 'mean_word_length': 5.829787234042553, '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}}
A modified Pareto strength ant colony optimization algorithm for the multi-objective optimization problems

Ant colony optimization is a meta-heuristic that has been widely used for solving combinatorial optimization problems, and most real-world applications are concerned with multi-objective optimization problems. The Pareto strength ant colony optimization (PSACO) algorithm, which uses the concepts of Pareto optimality and also the domination concept, has been shown to be very effective in optimizing any number of objectives simultaneously. This paper modifies the PSACO algorithm to solve two combinatorial optimization problems: the travelling salesman problem (TSP); and the job-shop scheduling problem (JSSP). It uses the random-weight based method as an improvement. The proposed method achieved a better performance than the original PSACO algorithm for both combinatorial optimization problems and obtained well-distributed Pareto-optimal fronts.