Transit network design based on travel time reliability

This paper presents a transit network optimization method, in which travel time reliability on road is considered. A robust optimization model, taking into account the stochastic travel time, is formulated to satisfy the demand of passengers and provide reliable transit service. The optimization model aims to maximize the efficiency of passenger trips in the optimized transit network. Tabu search algorithm is defined and implemented to solve the problem. Then, transit network optimization method proposed in this paper is tested with two numerical examples: a simple route and a medium-size network. The results show the proposed method can effectively improve the reliability of a transit network and reduce the travel time of passengers in general.     

Incorporating uncertainty into short-term travel time predictions

To improve the quality of travel time information provided to motorists, there is a need to move away from point forecasts of travel time. Specifically, techniques are needed which predict the range of travel times which motorists may experience. This paper focuses on travel time prediction on motorways and evaluates three models for predicting the travel time range in real time as well as up to 1 h ahead. The first model, termed lane by lane tracing, relies on speed data from each lane to replicate the trajectories of relatively slow and relatively fast vehicles on the basis of speed differences across the lanes. The second model is based on the relationship between mean travel time (estimated using a neural network model) and driver-to-driver travel time variability. The results provide insight into the relative merits of the proposed techniques and confirm that they provide a basis for reliable travel time range prediction in the short-term prediction context (up to 1 h ahead).     

Route choice decision under travel time uncertainty

We study route choice behavior when travel time is uncertain. In this case, users choice depends both on expected travel time and travel time variability. We collected survey data in the Paris area and analyzed them using a method based on the ordered probit. This leads to an ordinal as well as to different cardinal measures of risk aversion. Such an approach is consistent with expected and with non-expected utility theory. Econometric estimates suggest that absolute risk aversion is constant and show that risk aversion is larger for transit users, blue collars and for business appointments.     

A travel time reliability model of urban expressways with varying levels of service

Urban expressways usually experience several levels of service (LOS) because of the stop-and-go traffic flow caused by congestion. Moreover, multiple shock waves generate at different LOS interfaces. The dynamic of shock waves strongly influences the travel time reliability (TTR) of urban expressways. This study proposes a path TTR model that considers the dynamic of shock waves by using probability-based method to characterize the TTR of urban expressways with shock waves. Two model parameters are estimated, namely distribution of travel time (TT) per unit distance and travel distances in different LOS segments. Generalized extreme value distribution and generalized Pareto distribution are derived as distributions of TT per unit distance for six different LOS. Distribution parameters are estimated by using historical floating car data. Travel distances in different LOS segments are calculated based on shock wave theory. The range of TT along the path, which can help drivers arrange their trips, can be obtained from the TTR model. Finally, comparison is made among the proposed TTR model, generalized Pareto contrast model, which does not consider different LOS or existence of shock waves, and normal contrast model, which assumes TT per unit distance as normal distribution without considering shock wave. Results show that the proposed model achieves higher prediction accuracy and reduces the prediction range of TT. The conclusions can be further extended to TT prediction and assessment of measures to improve reliability of TT in a network.     

Transportation service procurement problem with transit time

In this work, we investigate transit time in transportation service procurement, which is conducted by shippers using auctions to purchase transportation service from carriers in the planning stage. Besides cost, we find that many shippers are most concerned with transit time in practice; shorter transit time indicates better transportation service. To minimize both the total cost and transit time, the problem faced by shippers is the biobjective transportation service procurement problem with transit time. To solve the problem, we introduce a biobjective integer programming model that can also accommodate some important business constraints. A biobjective branch-and-bound algorithm that finds all extreme supported nondominated solutions is developed. To speed up the algorithm, two fast feasibility checks, a network flow model for particular subproblems, and lower bounds from relaxation are proposed. In addition, a sophisticated heuristic is introduced to meet shipper’s requirements in some situations. Computational experiments on evaluating the performance of the algorithms are conducted on a set of test instances that are generated from practical data.     

A multi-commodity flow network design problem

There exist systems which can be usefully described by a network containingarcs through which a commodity of one type flows. This paper is concerned with finding a solution procedure for a particular multi-commodity flow network design problem. The problem is to identify a set of arcs in the network such that if travel is prohibited in them all flow travels by feasible paths and its total cost is minimal. The total flow in each arc may not exced its capacity, which is a known constant. Each arc and each node of the network has a non-negative constant unit traversal cost. Between each pair of distinct nodes there is a given non-negative rate of flow from the first vertex to the second which may be split up among a number of paths according to some constant traversal cost flow assignment process. The optimality criterion is the total traversal cost of all flow, which is to be minimized. Previous work on network design problems of this type is surveyed. The principal contribution of this paper is the presentation of a solution procedure for the above problem based on branch and bound enumeration. An illustrative numerical example is included. Computational experience gained in using the procedure with a FORTRAN IV program on an IBM 370 is favourable.     

Costs of travel time uncertainty and benefits of travel time information: Conceptual model and numerical examples

A negative effect of congestion that tends to be overlooked is travel time uncertainty. Travel time uncertainty causes scheduling costs due to early or late arrival. The negative effects of travel time uncertainty can be reduced by providing travellers with travel time information, which improves their estimate of the expected travel time, thereby reducing scheduling costs. In order to assess the negative effects of uncertainty and the benefits of travel time information, this paper proposes a conceptual model of departure time choice under travel time uncertainty and information. The model is based on expected utility theory, and includes the variation in travel time, the quality of travel time information and travellers’ perception of the travel time. The model is illustrated by an application to the case of the A2 motorway between Beesd and Utrecht in the Netherlands.     

A micro-simulation model system of departure time using a perception updating model under travel time uncertainty

Existing microscopic traffic models have often neglected departure time change as a possible response to congestion. In addition, they lack a formal model of how travellers base their daily travel decisions on the accumulated experience gathered from repetitively travelling through the transport network. This paper proposes an approach to account for these shortcomings. A micro-simulation approach is applied, in which individuals base their consecutive departure time decisions on a mental model. The mental model is the outcome of a continuous process of perception updating according to principles of reinforcement learning. Individuals’ daily travel decisions are linked to the traffic simulator SIAS-PARAMICS to create a simulation system in which both individual decision-making and system performance (and interactions between these two levels) are adequately represented. The model is applied in a case study that supports the feasibility of this approach.     

Finding the k reliable shortest paths under travel time uncertainty

This paper investigates the problem of finding the K reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. The KRSP problem extends the classical K loopless shortest paths problem to the stochastic networks by explicitly considering travel time reliability. In this study, a deviation path approach is established for finding K α-reliable paths in stochastic networks. A deviation path algorithm is proposed to exactly solve the KRSP problem in large-scale networks. The A^* technique is introduced to further improve the KRSP finding performance. A case study using real traffic information is performed to validate the proposed algorithm. The results indicate that the proposed algorithm can determine KRSP under various travel time reliability values within reasonable computational times. The introduced A^* technique can significantly improve KRSP finding performance.     

Optimal speed detector density for the network with travel time information

In the expressway network, detectors are installed on the links for detecting the travel time information while the predicted travel time can be provided by the route guidance system (RGS). The speed detector density can be determined to influence flow distributions in such a way that the precision of the travel time information and the social cost of the speed detectors are optimized, provided that each driver chooses the minimum perceived travel time path in response to the predicted travel time information. In this paper, a bilevel programming model is proposed for the network with travel time information provided by the RGS. The lower-level problem is a probit-based traffic assignment model, while the upper-level problem is to determine the speed detector density that minimizes the measured travel time error variance as well as the social cost of the speed detectors. The sensitivity analysis based algorithm is proposed for the bilevel programming problem. Numerical examples are provided to illustrate the applications of the proposed model and of the solution algorithm.     

A framework for neighbour links travel time estimation in an urban network

This paper proposes a solution to the problem of limited network sensor coverage caused by insufficient sample size of probe vehicles or inadequate numbers of fixed sensors. A framework is proposed to estimate link travel times using available data from neighbouring links. Two clues are used for real-time travel time estimation: link historical travel time data and online travel time data from neighbour links. In the absence of online travel time data from neighbour links, historical records only have to be relied upon. However, where the two types of data are available, a data fusion scheme can be applied to make use of the two clues. The proposed framework is validated using real-life data from the City of Vancouver, British Columbia. The estimation accuracy is found to be comparable to the existing literature. Overall, the results demonstrate the feasibility of using neighbour links data as an additional source of information that might not have been extensively explored before.     

A reliability‐based network design problem

This paper presents a reliability‐based network design problem. A network reliability concept is embedded into the continuous network design problem in which travelers' route choice behavior follows the stochastic user equilibrium assumption. A new capacity‐reliability index is introduced to measure the probability that all of the network links are operated below their capacities when serving different traffic patterns deviating from the average condition. The reliability‐based network design problem is formulated as a bi‐level program in which the lower level sub‐program is the probit‐based stochastic user equilibrium problem and the upper level sub‐program is the maximization of the new capacity reliability index. The lower level sub‐program is solved by a variant of the method of successive averages using the exponential average to represent the learning process of network users on a daily basis that results in the daily variation of traffic‐flow pattern, and Monte Carlo stochastic loading. The upper level sub‐program is tackled by means of genetic algorithms. A numerical example is used to demonstrate the concept of the proposed framework.     

The time-dependent vehicle routing problem with soft time windows and stochastic travel times

This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment.     

Transit network design with allocation of green vehicles: A genetic algorithm approach

The use of fossil fuels in transportation generates harmful emissions that accounts for nearly half of the total pollutants in urban areas. Dealing with this issue, local authorities are dedicating specific efforts to seize the opportunity offered by new fuels and technological innovations in achieving a cleaner urban mobility. In fact, authorities are improving environmental performances of their public transport fleet by procuring cleaner vehicles, usually called low and zero emission vehicles (LEV and ZEV, respectively). Nevertheless there seems to be a lack of methodologies for supporting stakeholders in decisions related to the introduction of green vehicles, whose allocation should be performed since the network design process in order to optimize their available green capacity.In this paper, the problem of clean vehicle allocation in an existing public fleet is faced by introducing a method for solving the transit network design problem in a multimodal, demand elastic urban context dealing with the impacts deriving from transportation emissions.The solving procedure consists of a set of heuristics which includes a routine for route generation and a genetic algorithm for finding a sub-optimal set of routes with the associated frequencies.     

A bi-objective user equilibrium model of travel time reliability in a road network

Travel time, travel time reliability and monetary cost have been empirically identified as the most important criteria influencing route choice behaviour. We concentrate on travel time and travel time reliability and review two prominent user equilibrium models incorporating these two factors. We discuss some shortcomings of these models and propose alternative bi-objective user equilibrium models that overcome the shortcomings. Finally, based on the observation that both models use standard deviation of travel time within their measure of travel time reliability, we propose a general travel time reliability bi-objective user equilibrium model. We prove that this model encompasses those discussed previously and hence forms a general framework for the study of reliability related user equilibrium. We demonstrate and validate our concepts on a small three-link example.     

Eco-routing problem considering fuel consumption and probabilistic travel time budget

Road transportation is one of the major sources of greenhouse gas emissions. To reduce energy consumption and alleviate this environmental problem, this study aims to develop an eco-routing algorithm for navigation systems. Considering that both fuel consumption and travel time are important factors when planning a trip, the proposed routing algorithm finds a path that consumes the minimum amount of gasoline while ensuring that the travel time satisfies a specified travel time budget and an on-time arrival probability. We first develop link-based fuel consumption models based on vehicle dynamics, and then the Lagrangian-relaxation-based heuristic approach is proposed to efficiently solve this NP-hard problem. The performance of the proposed eco-routing strategy is verified in a large-scale network with real travel time and fuel consumption data. Specifically, a sensitivity analysis of fuel consumption reduction for travel demand and travel time buffer is discussed in our simulation study.     

Estimation of the value of travel time and of travel time reliability for heterogeneous drivers in a road network

Transportation - Travel time reliability has been recognized as an important factor in cost–benefit analysis in a transportation network. To estimate the benefit and cost of travel time...     

Geographic information system design for network equilibrium-based travel demand models

Travel demand analyses are useful for transportation planning and policy development in a study area. However, travel demand modeling faces two obstacles. First, standard practice solves the four travel components (trip generation, trip distribution, modal split and network assignment) in a sequential manner. This can result in inconsistencies and non-convergence. Second, the data required are often complex and difficult to manage. Recent advances in formal methods for network equilibrium-based travel demand modeling and computational platforms for spatial data handling can overcome these obstacles. In this paper we report on the development of a prototype geographic information system (GIS) design to support network equilibrium-based travel demand models. The GIS design has several key features, including: (i) realistic representation of the multimodal transportation network, (ii) increased likelihood of database integrity after updates, (iii) effective user interfaces, and (iv) efficient implementation of network equilibrium solution algorithms.     

Robust models for transportation service network design

In this paper robust models are presented for the transportation service network design problem, using the ferry service network design problem as an example application. The base assumption is that only the mean and an upper bound on the passenger demand are known. In one robust model, this information is supplemented by a lower bound on the demand, whereas in a second robust model, the assumption is made that the variance of the demand is known, in addition to the mean and upper bound. The relationship between the two models is investigated and characterized analytically. A case study using the ferry service in Hong Kong is provided to illustrate the models.     

Aggregation effects on the network design problem

This article examines the effects of various network extraction schemes on the network design problem. Given an original network, many criteria can be used to identify subnetworks on which the network design problem is solved. For the purposes of this article, these subnetworks are obtained using an extraction algorithm which preserves the magnitude of the user equilibrium flows on the links of these subnetworks. The results of the implementation of the network design problem on the original and the extracted subnetworks are presented and compared. We conclude that very good solutions to the network design problem can be obtained from the use of highly aggregate networks.