Assessing the social costs of urban transport infrastructure options in low and middle income countries

ABSTRACT

This paper develops cost models for urban transport infrastructure options in situations where motorcycles and various forms of taxis are important modes of transport. The total social costs (TSCs) of conventional bus, Bus Rapid Transit (BRT), Monorail, Metro (Elevated Rail), car, motorcycle, Taxi and Uber are calculated for an urban corridor covering operator, user and external costs. Based on the parameters for a 7?km corridor in Hanoi, Vietnam, the results show the lowest average social cost (ASC) transport modes for different ranges of demand. Motorcycle might be the best option at low demand levels while conventional bus has advantages with low-medium demand. At medium demand levels, bus-based technologies and Monorail are competitive options while Metro, with a higher person capacity, is the best alternative at the highest demand levels. Compared to other modes, the ASCs of car and Taxi/Uber are greater because of high capital cost (related to vehicles) per passenger and low occupancy. Transport planners and decision makers in low and middle income countries (LMICs) can draw on the findings of this study. However, various limitations are identified and additional research is suggested.     

Reliable Shortest Path Problems in Stochastic Time-Dependent Networks

This study investigates the time-dependent reliable shortest path problem (TD-RSPP), which is commonly encountered in congested urban road networks. Two variants of TD-RSPP are considered in this study. The first variant is to determine the earliest arrival time and associated reliable shortest path for a given departure time, referred to as the “forward” TD-RSPP. The second problem is to determine the latest departure time and associated reliable shortest path for a given preferred arrival time, referred as the “backward” TD-RSPP. It is shown in this article that TD-RSPP is not reversible. The backward TD-RSPP cannot be solved by the algorithms designed for the forward problem using the reverse search from destination to origin. In this study, two efficient solution algorithms are proposed to solve the forward and backward TD-RSPP exactly and the optimality of proposed algorithms is rigorously proved. The proposed solution algorithms have potential applications in both advanced traveler information systems and stochastic dynamic traffic assignment models.