An UNSGA III Implementation for Public Transportation Network Design

This study describes the application of the genetic algorithm Unified Non-dominated Genetic Algorithm (UNSGA III) to an Urban Transport Network Design Problem (UTNDP). For this class of problems the goal is to create public transportation routes considering stops/access points (stations where people access public transportation), in addition they can solve fleet allocation and/or frequency problems. The goal is to evaluate the efficiency of the utilization of the algorithm on this type of problem in an instance represented by a directed graph. The UNSGA variation was chosen based on the bi-objective definition of the problem. This approach utilizes tournament selection, whilst the conventional NSGA goes with random selection. In order to evaluate the performance of the algorithm experiments were conducted with the algorithm on a well known instance. Based on the experiments it was possible to notice patterns related to the selection of individuals and the solutions found.