This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases.
The Urban Transit Routing Problem (UTRP) involves solving a set of transit route networks, which proved to be a highly complex multi-constrained problem. In this study, a bus route network to find an efficient network to meet customer demands given information on link travel times is considered. An evolutionary optimization technique, called Genetic Algorithm is proposed to solve the UTRP. The main objective is to minimize the passenger costs where the quality of the route sets is evaluated by a set of parameters. Initial computational experiments show that the proposed algorithm performs better than the benchmark results for Mandl's problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.