The mobility and accessibility expectations of seniors in an aging population

Populations of post-industrial nations are aging. With a growing number of people living well into their 80s and maintaining active lives, the transportation system will have to start focussing more closely on understanding their mobility and accessibility needs, so as to ensure that specific requirements of this large segment are not being ignored through the promotion of traditional ‘solutions’ and historical assumptions. This paper takes a close look at the evidence on the mobility needs and travel patterns of individuals over 64, distinguishing between the “young” elderly (aged 65–75 years) and the “old” elderly (over 75 years). This distinction is particularly useful in recognising the threshold of health change that impacts in a non-marginal way on mobility needs. This distinction also focuses transport planning and policy on a commitment to understanding the different needs of these sub-groups of the population, identifying services and facilities that better cater for these groups. We review the evidence, in particular, on the mobility characteristics of the over 75 years age group, including how they secure support through migration and settlement patterns. We use the empirical evidence from a number of western nations to identify the role of conventional and specialised public transport as an alternative to the automobile in meeting mobility and accessibility needs.     

“Local background” levels of carbon monoxide in an urban area

The objective of this study was to obtain a better understanding of carbon monoxide (CO) concentrations immediately upwind of urban roadways, the “local background” values, and how these concentrations depend upon the surrounding traffic and the general meteorology. Measurements were made at seven sites in Seattle, WA during the winter of 1993. Local background CO concentrations were characterized by an absence of short term fluctuations, a steady buildup during the 3 p.m. to 11 p.m. period, and a lack of spatial gradients in the 8-h average values. Distinctly different log-normal distributions of the 8-h averages were observed for “trafficked” sites versus “urban park” sites, with mean values of 1.6 and 1.0 ppm respectively. A simple regression model was developed to predict the local background CO that includes distance from roadway, average daily traffic of nearby roadways, and the frequency of occurrence of low wind speeds (R² = 0.74; F = 170).     

A combined land use-transportation model when zonal travel demand is endogenously determined

A combined transportation-land use model is proposed in this paper. Unlike other existing urban land use and transportation planning models in which a “fixed demand” for services is assumed to be known at the zonal level of an urban area, zonal travel demand is endogenously determined together with link congestion costs, optimal amounts of production and resulting efficient densities of land uses, once the transportation network is given. Some characteristics of alternative solutions are demonstrated. The proposed model represents progress over previous efforts in combining land use-transportation problems since the travel choice as to origin, destination and routes as well as amounts of goods to be produced at the optimal density of land uses are integrated into a consistent mathematical programming framework.     

Spatiotemporal evolution of China’s railway network in the 20th century: An accessibility approach

The interrelatedness of transportation development and economic growth has been a constant theme of geographic inquiries, particularly in economic and transportation geography. This paper analyzes the expansion of China’s railway network, the evolution of its spatial accessibility, and the impacts on economic growth and urban systems over a time span of about one century (1906–2000). First, major historical events and policies and their effects on railway development in China are reviewed and grouped into four major eras: preliminary construction, network skeleton, corridor building, and deep intensification. All four eras followed a path of “inland expansion.” Second, spatial distribution of accessibility and its evolution are analyzed. The spatial structure of China’s railway network is characterized by “concentric rings” with its major axis in North China and the most accessible city gradually migrating from Tianjin to Zhengzhou. Finally, the study indicates that railway network expansion has significantly improved economic development and heavily influenced the formation of urban systems in China.     

Estimating choice probabilities among nested alternatives

In several travel choice situations (e.g. automobile ownership level and trip frequency) the alternatives available to an individual randomly chosen from the population exhibit some internal choice-related ranking: the choice of a given alternative implies that all lower-ranked alternatives have been chosen. Such alternatives are referred to as “nested”. This paper presents a model for estimating choice probabilities among nested alternatives. The model is devised from the well known logit model and uses existing logit maximum-likelihood estimation techniques (and computer packages). The approach is shown to be more attractive than the multinomial logit and linear regression models, from a theoretical point of view, yet cheaper than the multinomial probit model. The model is developed in a disaggregate, utility maximization framework. An example application, estimating probabilities of trip frequencies by elderly individuals is presented.     

Evaluating the assumption of independent turning probabilities

Several urban traffic models make the convenient assumption that turning probabilities are independent, meaning that the probability of turning right (or left or going straight through) at the downstream intersection is the same for all travelers on that roadway, regardless of their origin or destination. In reality most travelers make turns according to planned routes from origins to destinations. The research reported here identifies and quantifies the deviations that result from this assumption of independent turning probabilities.An analysis of this type requires a set of reasonably realistic “original” route flows, which were obtained by a static user-equilibrium traffic assignment and an entropy maximization condition for most likely route flows. These flows are compared with those route flows resulting from the Assumption of Independent Turning Probabilities (ITP). A small subnetwork of 3 km by 5 km in Tucson, Arizona, was chosen as a case study. An overall “typical ratio” of 2.2 between original route flows and ITP route flows was obtained. Aggregating route flows to origin–destination flows led to an overall “typical ratio” of 1.7. Such deviations are particularly high for routes that go back-and-forth, reaching a ratio of more than 3 in certain time periods. Substantial deviations for origins and destinations that are on the same border of the subnetwork are also observed in the analyses. In addition, under the ITP assumption, morning rush hour traffic peaking is the same in all directions, while in the original flows some directions do not exhibit a peak in the morning rush hour period. Overall, the conclusion of the paper is that the assumption of independent turning probabilities leads to substantial deviations both at the route level and at the origin–destination level, even for such a small network of the case study. These deviations are particularly detrimental when a network is being modeled and studied for route-based measures of effectiveness such as the number and types of routes passing a point – for monitoring specified vehicles and/or managing detouring strategies.     

Effects of countdown timers on queue discharge characteristics of through movement at a signalized intersection

This study investigates how countdown timers installed at a signalized intersection affect the queue discharge characteristics of through movement during the green phase. Since the countdown timers display the time remaining (in seconds) until the onset of the green phase, drivers waiting in the queue at the intersection are aware of the upcoming phase change, and are likely to respond quicker. Thus, the countdown timers could reduce the start-up lost time, decrease the saturation headway, and increase the saturation flow rate. This study observed vehicle flow at an intersection in Bangkok for 24 h when the countdown timers were operating, and for another 24 h when the countdown timers were switched off. The signal plans and timings remained unchanged in both cases. Standard statistical t-tests were used to compare the difference in traffic characteristics between the “with timer” and “without timer” cases. It was found that the countdown timers had a significant impact on the start-up lost time, reducing it by 1.00–1.92 s per cycle, or a 17–32% time saving. However, the effects on saturation headway were found to be trivial, which implies that the countdown timers do not have much impact on the saturation flow rate of signalized intersections, especially during the off-peak day period and the late night period. The savings in the start-up lost time from the countdown timers was estimated to be equivalent to an 8–24 vehicles/h increase for each through movement lane at the intersection being studied.     

Dynamic location: an iconic model to synchronize temporal and spatial transportation data

This paper describes a model to synchronize the management and query of temporal and spatially referenced transportation data in geographic information systems (GIS). The model employs a method referred to as dynamic location, which facilitates spatial intersect queries from geographic shapes without the use of topological relationships. This is the inverse of how dynamic segmentation works in GIS. In contrast to dynamic segmentation, dynamic location stores geometry as an object within a single database field. This is an efficient, precise iconic model superseding the need for data decomposition into a complex set of tables. As an object model, the dynamic location process lends itself to high performance in an Internet, data-intensive, enterprise environment. Linear events are stored as {x, y} features, and not referenced to any route system. Route systems are built from {x, y, m} values (m for measure) and serve as number lines for mathematical operations. Any {x, y} object can then be referenced to either the Cartesian grid or any selected number line. This method offers the benefits of linear referencing, while making full use of a stable geodetic datum. Combinations of any {x, y} events may be placed over any {x, y, m} number line (route) and an intersect determined by looking through stacked {x, y, m} vertices of the coincident shapes. Since both geometry and shape reside in the same record, the use of “begin” and “end” dates facilitates full spatial and temporal version control. From a business process perspective, this creates a spatially enabled database, pulling GIS business functions back into the information technology mainstream.     

Homogeneous optimal fleet

The structure of chains in the optimal chain decomposition of a periodic schedule S is investigated. A finite oriented graph termed the Linis Graph (LG) is defined which serves as the key for this investigation. The edges of the LG are trip-types of S and the vertices of the LG represent terminals. It is proved that there is an Euler cycle for a connected LG satisfying natural precedence relations between arrival and departure times. Expansion of this cycle in a real time gives a “master-chain” of trips which, being repeated periodically, gives an infinite periodic chain. Time-shifted periodic replication of this chain allows obtaining a group of twin-type periodic chains forming an optimal fleet over S. It is proved that if the LG has m connected components then there is an optimal fleet consisting of m groups of similar periodic chains. It is shown that if the graph of terminals is connected and the LG is disconnected then it is possible to obtain a twin-type fleet over S by adding to S “dummy” trip-types. A general approach to constructing a twin-type fleet of minimal size for this case is described. The relation of the theory developed to the so-called center problem is discussed.     

A probabilistic framework for weather-based rerouting and delay estimations within an Airspace Planning model

In this paper, we develop a novel severe weather-modeling paradigm to be applied within the context of a large-scale Airspace Planning and collaborative decision-making model in order to reroute flights with respect to a specified probability threshold of encountering severe weather, subject to collision safety, airline equity, and sector workload considerations. This approach serves as an alternative to the current practice adopted by the Federal Aviation Administration (FAA) of adjusting flight routes in accordance with the guidelines specified in the National Playbook. Our innovative contributions in this paper include (a) the concept of “Probability-Nets” and the development of discretized representations of various weather phenomena that affect aviation operations; (b) the integration of readily accessible severe weather probabilities from existing weather forecast data provided by the National Weather Service; (c) the generation of flight plans that circumvent severe weather phenomena with specified probability threshold levels, and (d) a probabilistic delay assessment methodology for evaluating planned flight routes that might encounter potentially disruptive weather along its trajectory. Additionally, we conduct an economic benefit analysis using a k-means clustering mechanism in concert with our delay assessment methodology in order to evaluate delay costs and system disruptions associated with variations in probability-net refinement-based information. Computational results and insights are presented based on flight test cases derived from the Enhanced Traffic Management System data provided by the FAA and using weather scenarios derived from the Model Output Statistics forecast data provided by the National Weather Service.     

Hub location in the South-Atlantic airline market: A spatial competition game

The paper analyzes the airlines’ hub location problem through a spatial competition game played in two stages. First, airlines sequentially choose the location of their hub and second, they compete offering direct or connecting services between each city-pair. Different outcomes in the first stage will affect competition in the second, and as a consequence, the market share that airlines can obtain.Given actual demand patterns, results of the model are applied to the South-Atlantic airline market. We study the subgame perfect equilibriums obtained as a result of competition in each city-pair to anticipate where airlines will probably locate their hubs once an “open skies” policy is adopted in this market.     

Do motor-vehicle users in the US pay their way?

Governments in the US spend over a hundred billion dollars per year to build and maintain roads and provide a variety of services for motor-vehicle users. To pay for these infrastructure and services governments collect revenue from a variety of taxes and fees. The basic objective of this paper is to compare these government expenditures with the corresponding user tax and fee payments in the US. At the outset I argue that the such comparisons tell us something about the equity but not necessarily the economic efficiency of highway financing. I then present four different ways one might tally up government expenditures and user payments, depending on the extent to which one wishes to count “indirect” expenditures (e.g., on prosecuting car thieves) and non-targeted general-tax payments (e.g., severance taxes on oil). I make a comprehensive analysis of all possible expenditures and payments, and then compare them according to three of the four ways of counting expenditures and payments. The analysis indicates that in the US current tax and fee payments to the government by motor-vehicle users fall short of government expenditures related to motor-vehicle use by approximately 20–70 cents per gallon of all motor fuel. (Note that in this accounting we include only government expenditures; we do not include any “external” costs of motor-vehicle use.) The extent to which one counts indirect government expenditures related to motor-vehicle use is a key factor in the comparison.     

Identification of vehicle sensor locations for link-based network traffic applications

Information on link flows in a vehicular traffic network is critical for developing long-term planning and/or short-term operational management strategies. In the literature, most studies to develop such strategies typically assume the availability of measured link traffic information on all network links, either through manual survey or advanced traffic sensor technologies. In practical applications, the assumption of installed sensors on all links is generally unrealistic due to budgetary constraints. It motivates the need to estimate flows on all links of a traffic network based on the measurement of link flows on a subset of links with suitably equipped sensors. This study, addressed from a budgetary planning perspective, seeks to identify the smallest subset of links in a network on which to locate sensors that enables the accurate estimation of traffic flows on all links of the network under steady-state conditions. Here, steady-state implies that the path flows are static. A “basis link” method is proposed to determine the locations of vehicle sensors, by using the link-path incidence matrix to express the network structure and then identifying its “basis” in a matrix algebra context. The theoretical background and mathematical properties of the proposed method are elaborated. The approach is useful for deploying long-term planning and link-based applications in traffic networks.     

Consistent link flow estimation from counts

Partly because of counting errors and partly because counts may be carried out on different days, traffic counts on links of a network are unlikely to satisfy the flow conservation constraint “flow IN = flow out” at every node of the network. Van Zuylen and Willumsen (1980) have described a method of eliminating inconsistencies in traffic counts when a single count is available for each link in the network. In this paper, the method is extended to the case when more than one count is available on some links of the network. In addition, an algorithm is described for application of the method.     

A note of network equilibrium and noncooperative games

Rosenthal has shown that a user-optimized transportation network is equivalent to a pure Strategy Nash equilibrium when the network flows are discrete. Noting that most network equilibrium theorists take flows to be continuous, we extend this result to the nondiscrete case. We prove that a continuous flow, user-optimized network is a pure-strategy Nash equilibrium in a game with a continuum of pure strategies. Our “game”, however, differs from Rosenthal's in its players, strategies, and payoffs. For instance, the players in our model are not the motorists, but the origin-destination pairs. Some possible applications and extensions of our results are discussed.     

Feebates, footprints and highway safety

This paper presents an analysis of a market-based policy aimed at encouraging manufacturers to develop more fuel efficient vehicles without affecting the car buyer’s choice of vehicle size. A vehicle’s size is measured by its “footprint”, the product of track width and wheelbase. Traditional market-based policies to promote higher fuel economy, such as higher gasoline taxes or gas guzzler taxes, also induce motorists to purchase smaller vehicles. Whether or not such policies affect overall road safety remains controversial, however. Feebates, a continuous schedule of new vehicle taxes and rebates as a function of vehicle fuel consumption, can also be made a function of vehicle size, thus removing the incentive to buy a smaller vehicle. A feebate system based on a vehicle’s footprint creates the same incentive to adopt technology to improve fuel economy as simple feebate systems while removing any incentive for manufacturers or consumers to downsize vehicles.     

On the structure of weekly activity/travel patterns

Understanding the process of activity scheduling is a critical pre-requisite to an understanding of changes in travel behavior. To examine this process, a computerized survey instrument was developed to collect household activity scheduling data. The instrument is unique in that it records the evolution of activity schedules from intentions to final outcomes for a weekly period. This paper summarizes an investigation of the structure of activity/travel patterns based on data collected from a pilot study of the instrument. The term “structure” refers to the sequence by which various activities enter one’s daily activity scheduling process. Results of the empirical analyses show that activities of shorter duration were more likely to be opportunistically inserted in a schedule already anchored by their longer duration counterparts. Additionally, analysis of travel patterns reveals that many trip-chains were formed opportunistically. Travel time required to reach an activity was positively related to the scheduling horizon for the activity, with more distant stops being planned earlier than closer locations.     

Average duration and performance of actuated signal phases

This paper describes an approach for evaluating alternative traffic detection designs for a signalized intersection. The models described in this paper can be used to determine the average phase duration and frequency of phase “max-out” as a function of the detector loop layout, detector unit timing, traffic demand, and approach speed. Layout and timing are described by the number of detectors on each approach served by the phase, detector location on each approach, detector length, and detector unit and controller time settings. The authors have used the concept of maximum allowable headway (MAH) to combine the many possible combinations of layout and timing variables into one representative quantity, which greatly simplifies the modelling process. The performance models were used to examine the sensitivity of intersection performance to a range of design values. In general, both phase duration and cycle length increase with higher demands or larger MAHs. Multiloop (i.e. two or more detection zones per lane) detector designs typically have larger MAHs than designs with one detector loop per lane. Phase duration and cycle length also increase for very low demand levels. In terms of performance, the maximum green duration was found to have a contrary effect at higher flow conditions. Larger maximum greens were found to reduce delays to the phase in service by reducing the probability of max-out but they increased delays to drivers waiting for service.     

A non-compensatory choice model incorporating attribute cutoffs

This research proposes an extension to the traditional compensatory utility maximization framework which has guided most theoretical and statistical work in choice modeling applications, including those in transportation demand estimation work. Attribute cutoffs are incorporated into the decision problem formulation; it is then argued on extant empirical evidence that individuals may view these constraints as “soft”. This leads to the formulation of a penalized utility function that allows for constraint violation, but at a cost to the overall evaluation of the good. The proposed model is able to represent fully compensatory, conjunctive and disjunctive choice strategies, as well as combinations thereof. The properties of the proposed theoretical model are examined and discussed. From the theoretical framework, statistical models of choice behavior are easily derived; in their simplest forms, these models can be estimated using existing software. A Stated Preference choice experiment is analyzed using the proposed model, which is found to be highly consistent with observed choices and superior to a structural two-stage choice set formation model.     

A real-time traffic signal control system: architecture, algorithms, and analysis

The paper discusses a real-time traffic-adaptive signal control system referred to as RHODES. The system takes as input detector data for real-time measurement of traffic flow, and “optimally” controls the flow through the network. The system utilizes a control architecture that (1) decomposes the traffic control problem into several subproblems that are interconnected in an hierarchical fashion, (2) predicts traffic flows at appropriate resolution levels (individual vehicles and platoons) to enable pro-active control, (3) allows various optimization modules for solving the hierarchical subproblems, and (4) utilizes a data structure and computer/communication approaches that allow for fast solution of the subproblems, so that each decision can be downloaded in the field appropriately within the given rolling time horizon of the corresponding subproblem. The RHODES architecture, algorithms, and its analysis are presented. Laboratory test results, based on implementation of RHODES on simulation models of actual scenarios, illustrate the effectiveness of the system.