{'fraction_non_alphanumeric': 0.015084294587400177, 'fraction_numerical': 0.0, 'mean_word_length': 5.032085561497326, '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}}
Using the Manhattan distance for computing the multiobjective Markov chains problem

ABSTRACT This paper presents a novel method for computing the multi-objective problem in the case of a metric state space using the Manhattan distance. The problem is restricted to a class of ergodic controllable finite Markov chains. This optimization approach is developed for converging to an optimal solution that corresponds to a strong Pareto optimal point in the Pareto front. The method consists of a two-step iterated procedure: (a) the first step consists on an approximation to a strong Pareto optimal point and, (b) the second step is a refinement of the previous approximation. We formulate the problem adding the Tikhonov's regularization method to ensure the convergence of the cost-functions to a unique strong point into the Pareto front. We prove that there exists an optimal solution that is a strong Pareto optimal solution and it is the closest solution to the utopian point of the Pareto front. The proposed solution is validated theoretically and by a numerical example considering the vehicle routing planning problem.