Traffic accidents are rare events with inconsistent spatial and temporal dimensions; thus, accident injury severity (INJ-S) analysis faces a significant challenge in its classification and data stability. While classical statistical models have limitations in accurately modeling INJ-S, advanced machine learning methods have no apparent equations to prioritize/analyze different contributing factors to predict INJ-S levels. Also, the intercorrelations among the input factors could make the results of a typical sensitivity analysis misleading. Rear-end accidents constitute the most frequent type of traffic accidents; and therefore, their associated INJ-S need more insight investigations. To resolve all these issues, this study presents a sophisticated approach based on a deep learning paradigm combined with a Variance-Based Globa1 Sensitivity Analysis (VB/GSA). The methodology proposes a deep residual neural networks structure that utilizes residual shortcuts (i.e., connections), unlike other neural network architectures. The connections allow the DRNNs to bypass a few layers in the deep network architecture, circumventing the regular training with high accuracy problems. The Monte Carlo simulation with the aid of the trained DRNNs model was conducted to investigate the impact of each explanatory factor on the INJ-S levels based on the VB/GSA. The developed methodology was used to analyze all rear-end accidents in North Carolina from 2010 to 2017. The performance of the developed methodology was evaluated utilizing some selected representative indicators and then compared with the well-known ordered logistic regression (OLR) model. The developed methodology was found to achieve an overall accuracy of 83% and attained a superior performance, as compared with the OLR model. Furthermore, the VB/GSA analysis could identify the most significant attributes to rear-end crashes INJ-S level.

This paper presents a deterministic solution methodology for Transit route Network Design Problem (TrNDP). The main objective is to design a set of bus routes minimizing both users and operator costs while satisfying some constraints; such as minimum demand trips coverage, maximum bus route length and route directness. The proposed methodology provides an efficient set of circular closed bus routes. The formulation of the methodology consists of three parts; 1- representation of transit route network and input data, 2- representation of transit route network objectives and constraints as mathematical programming, 3- the structure of the solution methodology for bus route design. The methodology structure has been tested through Mandl’s benchmark network problem. The test results showed that the methodology developed in this study is able to improve a given network solution in terms of number of constructed routes, transit service coverage, transfer directness, and solution reliability. Based on the presented methodology, a more robust network optimization tool would be produced for public transportation planning purposes.