Modeling the structural relationships among short-distance travel amounts,perceptions, affections,and desires

Using structural equation modeling, the relationships among travel amounts, perceptions, affections, and desires across five short-distance (one-way trips of less than 100 miles) travel categories (overall, commute, work/school-related, entertainment/social/recreation, and personal vehicle) are examined. The models are estimated using data collected in 1998 from more than 1300 working commuters in the San Francisco Bay Area. A cross-model analysis reveals three robust relationships, namely: (1) myriad measures of travel amounts work together to affect perceptions; (2) perceptions are consistently important in shaping desires; and (3) affections have a positive relationship with desires. The second finding suggests that two individuals who travel the same objective amount may not have the same desire to reduce their travel: how much individuals perceive their travel to be is important. The third point argues that the degree to which travel is enjoyed is a key determinant of shaping desires to reduce travel: the more travel is enjoyed, the less the desire to reduce it.     

Modeling activity conflict resolution strategies using scheduling process data

Developments in activity scheduling process data have recently allowed for much improvement and validation of rule-based activity scheduling models. The use of actual scheduling process data allows for a potentially more realistic model in terms of how the travel episodes are actually derived. Since these types of models are simulations of the scheduling process, scheduling conflicts naturally arise in the creation of the final schedule. The handling of these scheduling conflicts is a critical component of all rule-based activity models. Many of these models rely on the concept of priority of the activities to resolve conflicts. However, recent research has shown that this is often not how conflicts are actually resolved. In order to more accurately model actual conflict resolution behavior, scheduling process data was used to estimate conflict resolution rules using decision trees. The use of a conflict resolution model allows the strategy chosen to depend on the attributes of the individual and the conflicting activities, rather than assuming a prior definition of precedence based on the activity types. The conflict resolution decision showed reasonable ability to predict the resolution strategy chosen in actual scheduling process survey data, and represents an important advance in developing a functional computational process model of activity scheduling.     

Maintenance optimization for transportation systems with demand responsiveness

We present a quadratic programming framework to address the problem of finding optimal maintenance policies for multifacility transportation systems. The proposed model provides a computationally-appealing framework to support decision making, while accounting for functional interdependencies that link the facilities that comprise these systems. In particular, the formulation explicitly captures the bidirectional relationship between demand and deterioration. That is, the state of a facility, i.e., its condition or capacity, impacts the demand/traffic; while simultaneously, demand determines a facility’s deterioration rate. The elements that comprise transportation systems are linked because the state of a facility can impact demand at other facilities. We provide a series of numerical examples to illustrate the advantages of the proposed framework. Specifically, we analyze simple network topologies and traffic patterns where it is optimal to coordinate (synchronize or alternate) interventions for clusters of facilities in transportation systems.     

Developing an enhanced weight-based topological map-matching algorithm for intelligent transport systems

Map-matching (MM) algorithms integrate positioning data from a Global Positioning System (or a number of other positioning sensors) with a spatial road map with the aim of identifying the road segment on which a user (or a vehicle) is travelling and the location on that segment. Amongst the family of MM algorithms consisting of geometric, topological, probabilistic and advanced, topological MM (tMM) algorithms are relatively simple, easy and quick, enabling them to be implemented in real-time. Therefore, a tMM algorithm is used in many navigation devices manufactured by industry. However, existing tMM algorithms have a number of limitations which affect their performance relative to advanced MM algorithms. This paper demonstrates that it is possible by addressing these issues to significantly improve the performance of a tMM algorithm. This paper describes the development of an enhanced weight-based tMM algorithm in which the weights are determined from real-world field data using an optimisation technique. Two new weights for turn-restriction at junctions and link connectivity are introduced to improve the performance of matching, especially at junctions. A new procedure is developed for the initial map-matching process. Two consistency checks are introduced to minimise mismatches. The enhanced map-matching algorithm was tested using field data from dense urban areas and suburban areas. The algorithm identified 96.8% and 95.93% of the links correctly for positioning data collected in urban areas of central London and Washington, DC, respectively. In case of suburban area, in the west of London, the algorithm succeeded with 96.71% correct link identification with a horizontal accuracy of 9.81 m (2σ). This is superior to most existing topological MM algorithms and has the potential to support the navigation modules of many Intelligent Transport System (ITS) services.     

The trade-off between trips and distance traveled in analyzing the emissions impacts of center-based telecommuting

Several travel indicators were compared between telecommuting (TC) days and non-telecommuting days for a sample of 72 center-based telecommuters in California. Distance traveled decreased significantly on TC days, with average reductions of 51 person-miles (58%) and 35 vehicle-miles (53%). When weighted by telecommuting frequency, average reductions of 11.9% in PMT and 11.5% in VMT were found over a five-day work week. Person-trips and vehicle-trips increased slightly (but not significantly) on TC days. This was due to statistically significant increases in commute trips by telecommuters (who more often went home for lunch on their TC days), partly counteracted by decreases in non-commute travel. The drive-alone mode share increased on TC days, both for all trips, and for commute trips in particular. Walking and biking shares also increased modestly on TC days, whereas shares of transit and ridesharing declined. Despite the increase in trip rates, TC-day reductions were found for all pollutants analyzed: 15% for total organic gas emissions, 21% for carbon monoxide, 35% for oxides of nitrogen, and 51% for particulate matter. The reduction in VMT more than compensated for the marginal increase in number of trips (and consequently, cold starts) on telecommuting days.     

Hub location with flow economies of scale

A characteristic feature of hub and spoke networks is the bundling of flows on the interhub links. This agglomeration of flows leads to reduced travel costs across the interhub links. Current models of hub location do not adequately model the scale economies of flow that accrue due to the agglomeration of flows. This paper shows that current hub location models, by assuming flow-independent costs, not only miscalculate total network cost, but may also erroneously select optimal hub locations and allocations. The model presented in this paper more explicitly models the scale economies that are generated on the interhub links and in doing so provides a more reliable model representation of the reality of hub and spoke networks.     

The state-of-the-art of “comprehensive” planning

Planning occurs as a part of governmental operations wherever decision-making happens. For US metropolitan areas, the locuses of decision-making are multiple, ranging in scale from very small jurisdictions up through the hierarchy to state and federal levels, and in function from general governments to many special-purpose agencies — transportation, health care, education, etc. Almost all might affect or be affected by urban transportation decisions and actions. Since no one of these units of government is comprehensive in authority and activity, there is no single, centralized planning operation that is truly comprehensive. Pluralistic planning is increasingly trying to foresee and to accommodate the interactions among the various levels and functions. Instead of fragmenting, with the fragments pulled apart and insulated, we need to move toward partitioning, not merely to delimit boundaries but also to identify interfaces. This movement is hampered by the differentials in the development of the state-of-the-art of the technical planning process now used by the several levels and functional units of government. This is most advanced, and most effective, for small, homogeneous suburban jurisdictions primarily concerned with guiding and controlling physical development; it is in disarray in central cities trying to cope with social and economic problems as well as with physical deterioration; at the metropolitan scale it is highly developed technically but not very influential. There is a trend toward a network of planning activities that recognizes and facilitates interrelationships and interactions, both vertically among functional boundaries and horizontally across geographical-scale distinctions — a trend toward the comprehensive —but we have a very long way to go.Paper prepared for the Highway Research Board Conference on Organization for Continuing Urban Transportation Planning.     

Automation of paratransit reservation,routing, and scheduling

Santa Clara County, California experienced a sharp growth in demand‐responsive paratransit ridership for individuals with disabilities, as a result of the passage of the 1990 Americans With Disabilities Act (ADA). This paper describes an automated paratransit system for the ADA‐type paratransit operation implemented in Santa Clara County. It automated paratransit reservation, scheduling, and routing functions. The key components of this system were a digital geographic database (DGD) and an automated trip scheduling system (ATSS). Empirical evidence after one year of operation indicates numerous benefits of this automation. There were significant reductions in the paratransit operating costs and an increase in the percent shared rides. The savings in operating costs far exceeded the annualized capital cost of automation. A user survey indicates that these improvements were achieved without degradation to service quality such as vehicle on‐time performance, invehicle travel times, vehicle response to open return, and ride comfort.     

Evaluation of forced flows on freeways with single‐loop detectors

This paper documents the development of a simple method for identifying and/or predicting freeway congestion using single loop detection systems. The proposed algorithm is simple and easy to incorporate into most freeway management systems. The Washington State Department of Transportation's Traffic Systems Management Center (TSMC) sponsored the original study. The investigation also led to a recommendation to replace the original TSMC definition of congestion or forced flow conditions with a more reliable indicator. Although, the TSMC has recently implemented a more advanced prediction system based on fuzzy set theory and neural networks to further identify patterns and rules for ramp metering strategies, the findings presented here continue to be constructive to freeway managers looking for quick and easy analyses that rely solely on single‐loop detection systems. The Seattle Area freeway study section used for the original study was the portion of mainline 1–5 northbound starting at the downtown Seattle Station 108 and ending at the Mountlake Terrace Station 193. Several days' worth of volume and lane‐occupancy data were collected for the afternoon time period from 2:30 p.m. to 6:30 p.m. Time intervals of 20 seconds were chosen for each data collection period. Important products of this research include the following:

• simple, and more reliable criterion for the definition of “bottleneck” or forced flow conditions than that originally used by the TSMC.
• simple, and reliable criterion for predicting impending “bottlenecks” or forced flow conditions.
• A proposed variable for improved selection of the appropriate metering rate. (Further analysis of the use of this variable for determining metering rates is recommended for future studies.

The proposed criteria are simple and easy to incorporate into current freeway management computer systems. Further investigation of freeway performance measurement using volume and occupancy data obtained from single‐loop systems is currently being performed.