Scaling up transit priority modelling using high-throughput computing

Mahmoud Mesbah, Majid Sarvi, Jefferson Tan, Fatemeh Karimirad

Research output: Contribution to journalArticleResearchpeer-review


he optimization of Road Space Allocation (RSA) from a network perspective is computationally challenging. An analogue to the Network Design Problem (NDP), RSA can be classified NP-hard. In large-scale networks when the number of alternatives increases exponentially, there is a need for an efficient method to reduce the number of alternatives while keeping computer execution time of the analysis at practical levels. A heuristic based on genetic algorithms (GAs) is proposed to efficiently select Transit Priority Alternatives (TPAs). The proposed framework allows for a TPA to be analysed by a commercial package that is a significant provision for large-scale networks in practice. We explore alterative parallel processing techniques to reduce execution time: multithreading and High-Throughput Computing (HTC). Speedup and efficiency are compared with that of traditional sequential GA, and we discuss both advantages and limitations. We find that multithreading is better when using the same number of processors, but HTC provides expandability.
Original languageEnglish
Pages (from-to)53 - 64
Number of pages12
JournalConferences in Research and Practice in Information Technology
Publication statusPublished - 2012

Cite this