{'fraction_non_alphanumeric': 0.01780693533270853, 'fraction_numerical': 0.007497656982193065, 'mean_word_length': 5.319526627218935, '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}}
Solving multi-class traffic assignment problem with genetic algorithm

Multi-class traffic assignment problem is an extension of the classic static traffic assignment problem with user equilibrium. It provides a more correct and detailed description of traffic patterns and trends. Because of the complexity of the models for multi-class traffic assignment problem, which are usually defined by a non-monotonic cost operator, neither the uniqueness nor the stability of a feasible solution can be guaranteed and the traditional nonlinear optimization algorithms are therefore invalid. Based upon the mathematic characteristics of multiclass traffic assignment problem, genetic algorithm has been adopted for its solution. To ensue efficiency of the algorithm, the genetic operators such as crossover and mutation were designed specifically, as expressed by Equation 11, 12 and 13, so that constrains expressed by Equation 5 can be satisfied. With a test road network as an example, as shown in Figure 1, the new genetic algorithm has been proved to be very effective.