{'fraction_non_alphanumeric': 0.025, 'fraction_numerical': 0.007407407407407408, 'mean_word_length': 5.396449704142012, '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}}
MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR THE TRANSIT NETWORK DESIGN PROBLEM

The transit network design problem (TNDP) aims to find a set of routes and corresponding frequencies for an urban public transportation system. We model the TNDP as a multi-objective combinatorial optimization problem whose resolution involves finding a Pareto front that represents different trade-off levels between opposite objectives, the travel and waiting times and the required fleet of buses. We propose a Multi-Objective Evolutionary Algorithm (MOEA-TNDP) which has three algorithmic components, 1) an algorithm that generates a pool of candidate routes, 2) an assignment model that evaluates a given solution and checks the fulfillment of constraints, 3) an evolutionary process based on the Non-Dominated Sorting Genetic Algorithm version II that produces an approximated Pareto front. MOEA-TNDP is tested with the case of Rivera (a medium/small size city of 65000 inhabitants), taking its real solution and the solutions generated by the GRASP-TNDP algorithm as a reference for comparison.