Travel Behavior

This paper presents a case study of the use of San Francisco bike lanes with a focus on women. Bike counts and intercept surveys of cyclists at three locations in San Francisco’s SoMa District were complemented by focus groups with cyclists, particularly women cyclists, and brief interviews with non-cyclists. Consistent with other US studies, we find that white men are disproportionately represented among the cyclists we observed, and that women bike less and bike shorter distances. However, at least in the SoMa sample, women are more likely to bike to work than men. Cyclists included...

In August 2002, AC Transit began offering free bus passes to low-income middle and high school students. At the same time, the agency reduced the cost of its monthly youth pass from $27 to $15. This dramatic reduction in costs for student riders resulted from a grassroots advocacy campaign that successfully focused local political attention on school transportation in an area where school busing had largely been eliminated for middle school and high school students. The creation of the program drew together state and local elected officials, youth advocates, schools, and transportation...

This paper presents early findings from an application of advanced parking technologies to increase effective parking capacity at a transit station during the first half of 2004 in the San Francisco Bay Area (CA). It begins with an extensive review of the literature related to transit-based smart parking management systems to illustrate the range of system configurations and their potential travel, economic, and environmental effects. Two important conclusions from this review are: (1) lack of parking spaces at transit stations may be a significant constraint to transit use and (2) pre-...

This paper extends the well known Held-Karp's lower bound available for a single Travelling Salesman Problem to the multiple depot case. The LP-relaxation of a symmetric multiple vehicle, multiple depot problem is shown to be lower bounded by an infinite family of bounds. Each lower bound can be computed in a tractable way using a matroid intersection algorithm. When the costs of travelling between any two locations satisfy triangle inequality, it is shown that there exists a 2-approximation algorithm for solving the multiple depot, multiple TSP. These results are useful in solving the...