Distribution of Value of Time and Ways to Model Value of Time in Long-Range Planning Models

As managed lanes (ML) become more integrated in regional urban networks with existing general purpose (GP) lanes, the distribution of travelers’ value of time (VOT) is becoming more important for transportation planning agencies to quantify in order to accurately predict future travel patterns. Since travelers’ VOT varies depending on a multitude of factors, this study investigates ways that we can determine the VOT distribution of a region from existing travel data as well as effective ways that we can model VOT using traffic assignment algorithms. In networks with available link volumes and toll data on segments where travelers have the option of choosing to stay on the GP lanes or entering a ML facility, a VOT distribution can be inferred assuming that travelers who enter the ML choose to do so based on a certain “threshold” VOT. When modeling these VOT distributions, errors are observed in the traffic assignment results when both the continuous nature of VOT distributions are discretized, and when varying toll values are assumed to be constant. Specifically in the context of TransCAD software, link travel time errors appear to be much less significant than flow errors when tested on a nine node network. Additional experimentation on larger regional networks is needed to verify the significance of these errors and their impact on predicted travel patterns.Civil, Architectural, and Environmental Engineerin

Modeling Choice Problems with Heterogeneous User Preferences in the Transportation Network

Users of transportation systems need to make a variety of different decisions for their trips in the network, while their objective is to keep the generalized costs of their own trips minimized. In the transportation network, there is a diversity of different factors that can influence the decisions of the users, while the relative importance of these factors varies among the heterogeneous users with different trip purposes. Nonetheless, the cumulative result of the individual decisions of the users seeking to minimize their costs according to their own preferences leads to the user equilibrium condition in which no one can reduce his/her cost by changing his/her decision. In this research, we adapt the concept of the efficient frontier from portfolio theory (Markowitz, 1952) in finance in order to model the bicriterion choice behavior of users with heterogeneous preferences in transportation networks. We show that the efficient frontier has a set of primary properties that remains general in different problems. Thus, the primary properties of the efficient frontier can be employed to analytically model and solve different bicriterion choice problems in transportation. For the first application, we use these properties to propose an analytical model for the morning commute problem when there is a heterogeneity associated with preferences of the users (Vickrey, 1969; Daganzo, 1985). A dynamic pricing strategy is also proposed to optimize the bottleneck by minimizing the total cost for users. In addition to the morning commute problem, Vickrey’s congestion theory is also shown to have applications in modeling and optimizing the operation of the demand responsive transit (DRT) system with time-dependent demand and state-dependent capacity as queueing systems. The efficiency of the DRT system can be improved by implementing a dynamic pricing strategy. The analytical solution of the morning commute problem can be also extended for modeling and pricing the DRT system when there is a heterogeneity associated with the preferences of the DRT service users. For another application of the efficient frontier in modeling choice problems in transportation, we propose a traffic assignment model to account for the heterogeneity in sensitivity of the users to travel time reliability in a network under travel time variability. However, the proposed model can have wide applications in modeling the equilibrium condition of different multicriterion choice problems in transportation

A Comparative Evaluation Of Fdsa,ga, And Sa Non-linear Programming Algorithms And Development Of System-optimal Methodology For Dynamic Pricing On I-95 Express

As urban population across the globe increases, the demand for adequate transportation grows. Several strategies have been suggested as a solution to the congestion which results from this high demand outpacing the existing supply of transportation facilities. High –Occupancy Toll (HOT) lanes have become increasingly more popular as a feature on today’s highway system. The I-95 Express HOT lane in Miami Florida, which is currently being expanded from a single Phase (Phase I) into two Phases, is one such HOT facility. With the growing abundance of such facilities comes the need for indepth study of demand patterns and development of an appropriate pricing scheme which reduces congestion. This research develops a method for dynamic pricing on the I-95 HOT facility such as to minimize total travel time and reduce congestion. We apply non-linear programming (NLP) techniques and the finite difference stochastic approximation (FDSA), genetic algorithm (GA) and simulated annealing (SA) stochastic algorithms to formulate and solve the problem within a cell transmission framework. The solution produced is the optimal flow and optimal toll required to minimize total travel time and thus is the system-optimal solution. We perform a comparative evaluation of FDSA, GA and SA non-linear programming algorithms used to solve the NLP and the ANOVA results show that there are differences in the performance of the NLP algorithms in solving this problem and reducing travel time. We then conclude by demonstrating that econometric iv forecasting methods utilizing vector autoregressive (VAR) techniques can be applied to successfully forecast demand for Phase 2 of the 95 Express which is planned for 201

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230); National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 020206

On multi-objective stochastic user equilibrium

There is extensive empirical evidence that travellers consider many 'qualities' (travel time, tolls, reliability, etc.) when choosing between alternative routes. Two main approaches exist to deal with this in network assignment models: Combine all qualities into a single (linear) utility function, or solve a multi-objective problem. The former has the advantages of a unique solution and efficient algorithms; the latter, however, is more general, but leads to many solutions and is difficult to implement in larger systems. In the present paper we present three alternative approaches for combining the principles of multi-objective decision-making with a stochastic user equilibrium model based on random utility theory. The aim is to deduce a tractable, analytic method. The three methods are compared both in terms of their theoretical principles, and in terms of the implied trade-offs, illustrated through simple numerical examples

A continuous model for coordinated pricing of mixed access modes to transit

The land-use pattern for many cities is a central business district surrounded by sprawling suburbs. This pattern can lead to an inefficient and congestion-prone transportation system due to a reliance on automobiles. This is because high-capacity transit is inefficient in low-density areas where insufficient travelers can access transit. This also poses an equity concern as the monetary cost of faster and more expensive travel disproportionately burdens low income travelers, especially when fixed congestion pricing is imposed. This paper presents a deterministic approximation of a discrete choice model for mixed access and mainline transportation modes, meaning that travelers may use different modes to access a mainline system, such as transit. The purpose is to provide a tractable computationally efficient model to address the first/last mile problem using a system-wide pricing policy that can account for heterogeneous values of time; a problem that is difficult to solve efficiently using a stochastic model. The model is structured for a catchment area around a central access point for a mainline mode, approximating choice by comparing modal utility costs. The underlying utility model accommodates both fixed prices (e.g., parking, fixed tolls, and fares) and distance-based unit prices (e.g. taxi fare, bike-share, and distance tolls) that may be set in a coordinated way with respect to value of time. Using numerical analysis to assess accuracy, the deterministic model achieved results within 3% of a stochastic logit-based model, and within 7% of measured values. The optimization of prices using the final model achieved a 22% reduction in generalized travel time and a 30% improvement in the Gini inequity measure from 0.2 to 0.14

OPTIMIZATION OF RAILWAY TRANSPORTATION HAZMATS AND REGULAR COMMODITIES

Transportation of dangerous goods has been receiving more attention in the realm of academic and scientific research during the last few decades as countries have been increasingly becoming industrialized throughout the world, thereby making Hazmats an integral part of our life style. However, the number of scholarly articles in this field is not as many as those of other areas in SCM. Considering the low-probability-and-high-consequence (LPHC) essence of transportation of Hazmats, on the one hand, and immense volume of shipments accounting for more than hundred tons in North America and Europe, on the other, we can safely state that the number of scholarly articles and dissertations have not been proportional to the significance of the subject of interest. On this ground, we conducted our research to contribute towards further developing the domain of Hazmats transportation, and sustainable supply chain management (SSCM), in general terms. Transportation of Hazmats, from logistical standpoint, may include all modes of transport via air, marine, road and rail, as well as intermodal transportation systems. Although road shipment is predominant in most of the literature, railway transportation of Hazmats has proven to be a potentially significant means of transporting dangerous goods with respect to both economies of scale and risk of transportation; these factors, have not just given rise to more thoroughly investigation of intermodal transportation of Hazmats using road and rail networks, but has encouraged the competition between rail and road companies which may indeed have some inherent advantages compared to the other medium due to their infrastructural and technological backgrounds. Truck shipment has ostensibly proven to be providing more flexibility; trains, per contra, provide more reliability in terms of transport risk for conveying Hazmats in bulks. In this thesis, in consonance with the aforementioned motivation, we provide an introduction into the hazardous commodities shipment through rail network in the first chapter of the thesis. Providing relevant statistics on the volume of Hazmat goods, number of accidents, rate of incidents, and rate of fatalities and injuries due to the incidents involving Hazmats, will shed light onto the significance of the topic under study. As well, we review the most pertinent articles while putting more emphasis on the state-of-the-art papers, in chapter two. Following the discussion in chapter 3 and looking at the problem from carrier company’s perspective, a mixed integer quadratically constraint problem (MIQCP) is developed which seeks for the minimization of transportation cost under a set of constraints including those associating with Hazmats. Due to the complexity of the problem, the risk function has been piecewise linearized using a set of auxiliary variables, thereby resulting in an MIP problem. Further, considering the interests of both carrier companies and regulatory agencies, which are minimization of cost and risk, respectively, a multiobjective MINLP model is developed, which has been reduced to an MILP through piecewise linearization of the risk term in the objective function. For both single-objective and multiobjective formulations, model variants with bifurcated and nonbifurcated flows have been presented. Then, in chapter 4, we carry out experiments considering two main cases where the first case presents smaller instances of the problem and the second case focuses on a larger instance of the problem. Eventually, in chapter five, we conclude the dissertation with a summary of the overall discussion as well as presenting some comments on avenues of future work

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

The design of route-guidance systems faces a well-known dilemma. The approach that theoretically yields the system-optimal traffic pattern may discriminate against some users, for the sake of favoring others. Proposed alternate models, however, do not directly address the system perspective and may result in inferior performance. We propose a novel model and corresponding algorithms to resolve this dilemma. We present computational results on real-world instances and compare the new approach with the well-established traffic assignment model. The quintessence is that system-optimal routing of traffic flow with explicit integration of user constraints leads to a better performance than the user equilibrium while simultaneously guaranteeing a superior fairness compared to the pure system optimum