High Throughput Computing Application to Transport Modeling
Optimization of road space allocation (RSA) from a network perspective is computationally challenging. Analogues to the Network Design Problem (NDP), RSA can be classified as a NP-hard problem. 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 as well as a computational approach to reduce the computer execution time of the analysis. A heuristic algorithm based on Genetic Algorithm (GA) is proposed to efficiently select Transit Priority Alternatives (TPAs). In order to reduce the execution time, the GA is modified to implement two parallel processing techniques: A High Performance Computing (HPC) technique using Multi-threading (MT) and a High Throughput Computing (HTC) technique. The advantages and limitations of the MT and HTC techniques are discussed. Moreover, the proposed framework allows for a TPA to be analyzed by a commercial package which is a significant provision for large scale networks in practice.
KeywordsCentral Processing Unit High Performance Computing Network Design Problem Large Scale Network Parallel Genetic Algorithm
Unable to display preview. Download preview PDF.
- Bard, J.F.: Practical bilevel optimization: algorithms and applications. Kluwer Academic Publishers, Boston (1998)Google Scholar
- Foster, I.T., Zhao, Y., Raicu, I., Lu, S.: Cloud Computing and Grid Computing 360-Degree Compared. In: Grid Computing Environments Workshop, GCE 2008 (2008)Google Scholar
- Mesbah, M., Sarvi, M., Ouveysi, I., Currie, G.: Optimization of Transit Priority in the Transportation Network Using a Decomposition Methodology. Transportation Research Part C: Emerging Technologies (2010)Google Scholar