Abstract-Providing temporal coordination among public transport servicesis of vital importance in transit planning, as it has direct impacts on the waiting time imposed on transferring passengers. This task, which is widely recognized as schedule synchronization, is highly complicated by nature since it typically leads to a complex combinatorial optimization problem. This study aims to investigate the capability of simulated annealing algorithm in coping with this problem. A new mathematical programming model is presented for the purpose of minimizing the total transfer waiting time in transit networks. Then, a simulated annealing algorithm is developed and applied to a small-size transit network in order to test the algorithm applicability. The numerical results showed the capability of the algorithm in tackling the transit schedule synchronization problem.
Abstract-Reducing the waiting time imposed on thepassengerstransferring between transit lines has always been a concern for public transport schedulers, as it is a complicated problem by nature. Typically, network-wide minimization of transfer waiting time is a highly complex optimization problem, particularly in the case of dealing with huge transit networks. This problem is unlikely to be solved by exact optimization techniques. This study aims to investigate the capability of two powerful metaheuristic algorithms, genetic algorithms and simulate annealing, in coping with the transfer optimization problem. Amathematical model is presented in this study for minimizing the total transfer waiting time in transit systems. Based on this model, a genetic algorithm and a simulated annealing algorithm are developed and applied to a transit network comprising numerous transfer points. The comparative analysis of the results revealed the ability of the both algorithms in reducing the transfer waiting time although the genetic algorithm could return better results in relatively shorter computation times.
Abstract-Reducing the waiting time imposed on thepassengerstransferring between transit lines has always been a concern for public transport schedulers, as it is a complicated problem by nature. Typically, network-wide minimization of transfer waiting time is a highly complex optimization problem, particularly in the case of dealing with huge transit networks. This problem is unlikely to be solved by exact optimization techniques. This study aims to investigate the capability of two powerful metaheuristic algorithms, genetic algorithms and simulate annealing, in coping with the transfer optimization problem. Amathematical model is presented in this study for minimizing the total transfer waiting time in transit systems. Based on this model, a genetic algorithm and a simulated annealing algorithm are developed and applied to a transit network comprising numerous transfer points. The comparative analysis of the results revealed the ability of the both algorithms in reducing the transfer waiting time although the genetic algorithm could return better results in relatively shorter computation times.
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.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.