Scaling Up Transit Priority Modelling Using High-Throughput Computing

Provided by: Australian Computer Society
Topic: Cloud
Format: PDF
The 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).

Find By Topic