Impact of high occupancy vehicle lanes on carpooling behavior

High occupancy vehicle lanes have become an integral part of regional transportation planning. Their purpose is to increase ridesharing by offering a travel time advantage to multiple occupant vehicles. This paper examines the extent to which an HOV facility increases ridesharing. Using data from the Route 55 HOV facility in Orange Country, California, changes in the carpooling rate on Route 55 are compared to that of a control group of freeway commuters. The analysis shows that the carpooling rate among peak period commuters, and particularly those who use the entire length of the facility, has increased. However, there has been no significant increase in ridesharing among the entire population of Route 55 commuters. Results suggest that barriers to increased ridesharing are formidable, that travel time savings must be large in order to attract new carpoolers, and that further increases in capooling will likely require development of extensive HOV lane systems.     

A traffic assignment model for a ridesharing transportation market

A nascent ridesharing industry is being enabled by new communication technologies and motivated by the many possible benefits, such as reduction in travel cost, pollution, and congestion. Understanding the complex relations between ridesharing and traffic congestion is a critical step in the evaluation of a ridesharing enterprise or of the convenience of regulatory policies or incentives to promote ridesharing. In this work, we propose a new traffic assignment model that explicitly represents ridesharing as a mode of transportation. The objective is to analyze how ridesharing impacts traffic congestion, how people can be motivated to participate in ridesharing, and, conversely, how congestion influences ridesharing, including ridesharing prices and the number of drivers and passengers. This model is built by combining a ridesharing market model with a classic elastic demand Wardrop traffic equilibrium model. Our computational results show that (i) the ridesharing base price influences the congestion level, (ii) within a certain price range, an increase in price may reduce the traffic congestion, and (iii) the utilization of ridesharing increases as the congestion increases. Copyright © 2014 John Wiley & Sons, Ltd.     

Cost-benefit analysis of alternative vehicles in the Philippines using immediate and distant future scenarios

Alternative vehicle technologies promise a sustainable future by reducing carbon emissions and pollution. However, their widespread adoption tends to be slow due to high costs and uncertainties in benefits. Using a life cycle-based approach, this study calculates ownership savings and societal benefits for various alternative vehicle technologies against their baseline vehicle technology (e.g. gasoline or diesel). The assessment is performed from a developing country context – in the Philippines. Furthermore, immediate and distant future scenarios are modeled. The immediate future scenario assesses costs and benefits if the shift is to happen now, while the distant future scenario considers the effect of widespread autonomous driving and ridesharing. The results of the study echo the significant societal benefits from electric- and fuel cell-powered vehicles found in literature, but they are hindered by high ownership costs. In the immediate future, the diesel hybrid electric vehicle can potentially have both positive societal and operational costs for public transportation. For a gasoline-powered private passenger car, a simple shift to diesel, 20% biodiesel or 85% methanol can be beneficial. In the distant future, it is expected that autonomous, rideshared vehicles can potentially lure people away from driving their own vehicles, because of lower costs per passenger-kilometer while sustaining the privacy and comfort of a private car.     

The design of capacitated intermodal hub networks with different vehicle types

In this study, we allow using alternative transportation modes and different types of vehicles in the hub networks to be designed. The aim of the problem is to determine the locations and capacities of hubs, which transportation modes to serve at hubs, allocation of non-hub nodes to hubs, and the number of vehicles of each type to operate on the hub network to route the demand between origin-destination pairs with minimum total cost. Total cost includes fixed costs of establishing hubs with different capacities, purchasing and operational costs of vehicles, transportation costs, and material handling costs. A mixed-integer programming model is developed and a variable neighborhood search algorithm is proposed for the solution of this problem. The heuristic algorithm is tested on instances from the Turkish network and CAB data set. Extensive computational analyzes are conducted in order to observe the effects of changes in various problem parameters on the resulting hub networks.     

Coordinated platooning with multiple speeds

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.     

Development of a microscopic activity-based framework for analyzing the potential impacts of transportation control measures on vehicle emissions

The 1990 Clean Air Act Amendments (CAAA) and the Intermodal Surface Transportation Efficiency Act of 1991 (ISTEA) have defined a set of transportation control measures to counter the increase in the vehicle emissions and energy consumption due to increased travel. The value of these TCM strategies is unknown as there is limited data available to measure the travel effects of individual TCM strategies and the models are inadequate in forecasting changes in travel behavior resulting from these strategies. The work described in this paper begins to provide an operational methodology to overcome these difficulties so that the impacts of the policy mandates of both CAAA and ISTEA can be assessed. Although the framework, as currently developed, falls well short of actually forecasting changes in traveler behavior relative to policy options designed to encourage emissions reduction, the approach can be useful in estimating upper bounds of certain policy alternatives in reducing vehicle emissions. Subject to this important limitation, the potential of transportation policy options to alleviate vehicle emissions is examined in a comprehensive activity-based approach. Conclusions are drawn relative to the potential emissions savings that can be expected from efficient trip chaining behavior, ridesharing among household members, as well as from technological advances in vehicle emissions control devices represented by replacing all of the vehicles in the fleet by vehicles conforming to present-day emissions technology.     

“Not just a taxi”? For-profit ridesharing,driver strategies,and VMT

The spread of GPS-based location services using smartphone applications has led to the rapid growth of new startups offering smartphone-enabled dispatch service for taxicabs, limousines, and ridesharing vehicles. This change in communicative technology has been accompanied by the creation of new categories of car service, particularly as drivers of limousines and private vehicles use the apps to provide on-demand service of a kind previously reserved for taxicabs. One of the most controversial new models of car service is for-profit ridesharing, which combines the for-profit model of taxi service with the overall traffic reduction goals of ridesharing. A preliminary attempt is here made at understanding how for-profit ridesharing compares to traditional taxicab and ridesharing models. Ethnographic interviews are drawn on to illustrate the range of motivations and strategies used by for-profit ridesharing drivers in San Francisco, California as they make use of the service. A range of driver strategies is identified, ranging from incidental, to part-time, to full-time driving. This makes possible a provisional account of the potential ecological impacts of the spread of this model of car service, based on the concept of taxicab efficiency, conceived as the ratio of shared versus unshared miles driven.     

Carrier collaboration with endogenous fleets and load factors when networks are complementary

This paper analyzes the effect of carrier collaboration on fleet capacity, fleet structures in terms of the number and the size of vehicles, and load factors. The model features complementary networks, scheduling, price elastic demands, and demand uncertainty. For the case of a given number of vehicles, the analysis shows that carrier collaboration increases vehicle sizes (thus, fleet capacity) if marginal seat costs are low while fleet capacity remains unchanged if marginal seat costs are high. If both vehicle sizes and vehicle numbers can be varied, then collaboration will always increase vehicle numbers and fleet capacity, while the effects on vehicle sizes and, thus, also load factors, are ambiguous and therewith hard to predict. Numerical simulations indicate that collaboration increases expected load factors also when the number of vehicles is endogenous.     

Internalization of Transportation External Costs: Impact Analysis of Logistics Company Mode and Route Choices

Abstract

This study focuses on the mode and route choices of a logistics company in a situation involving intercity transportation with networks of surface roads, highways and a railway. A method of transportation network analysis is applied to construct a logistics company mode and route choice models with the objective of minimizing total distribution and external costs. This study also assumes that the fleet number and vehicle capacities are given. Freight distributed from a distribution center to given retailers or consumers via surface road/highway links or via intermodal transportation involving surface road/highway links and a railway. In terms of model construction, this study first explores the routing and sequence of the retailers and consumers served by each vehicle. Second, the study internalizes the external cost of air pollution into the total distribution cost, to analyze the influences of external cost burdens on a logistics company mode and route choices from a user charge perspective. Finally, the study designs a heuristic algorithm for solving the above models, and illuminates the modeling process using a numerical example.     

Instantaneous multihop connectivity of one-dimensional vehicular ad hoc networks with general distributions of communication nodes

Connected and automated vehicle technologies hold great promises for improving the safety, efficiency, and environmental impacts of the transportation sector. In this study we are concerned with multihop connectivity of instantaneous vehicular one-dimensional ad hoc networks (VANETs) formed by connected vehicles along a communication path in a road network with given either vehicle locations or traffic densities, market penetration rates, and transmission ranges. We first define a new random variable for the location of the end node of a communication chain, which is a discrete random variable with given vehicle locations and a mixed random variable with given traffic densities. Then recursive, iterative, or differential equation models of instantaneous multihop connectivity between two communication nodes are derived from the relationships between end node probability mass or density function and connectivity. Assuming a simple communication model, the new models are applicable for general distribution patterns of vehicles and communication nodes, including non-evenly placed vehicles and nonhomogeneous Poisson distributions of nodes. With given vehicle locations, the computational cost for this new model is linear to the number of vehicles; with given traffic densities, we derive a new closed-form connectivity model for homogeneous Poisson distributions of communication nodes and an approximate closed-form model when distribution patterns of communication nodes are given by spatial renewal processes. We then apply the models to evaluate impacts on connectivity of traffic patterns, including shock waves, and road-side stations. The connectivity model could be helpful for designing routing protocols in VANETs and developing their applications in transportation systems.     

Network-oriented household activity pattern problem for system optimization

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0–1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.     

Just-in-time delivery for green fleets: A feedback control approach

With increasing attention being paid to greenhouse gas (GHG) emissions, the transportation industry has become an important focus of approaches to reduce GHG emissions, especially carbon dioxide equivalent (CO₂e) emissions. In this competitive industry, of course, any new emissions reduction technique must be economically attractive and contribute to good operational performance. In this paper, a continuous-variable feedback control algorithm called GEET (Greening via Energy and Emissions in Transportation) is developed; customer deliveries are assigned to a fleet of vehicles with the objective function of Just-in-Time (JIT) delivery and fuel performance metrics akin to the vehicle routing problem with soft time windows (VRPSTW). GEET simultaneously determines vehicle routing and sets cruising speeds that can be either fixed for the entire trip or varied dynamically based on anticipated performance. Dynamic models for controlling vehicle cruising speed and departure times are proposed, and the impact of cruising speed on JIT performance and fuel performance are evaluated. Allowing GEET to vary cruising speed is found to produce an average of 12.0–16.0% better performance in fuel cost, and −36.0% to +16.0% discrepancy in the overall transportation cost as compared to the Adaptive Large Neighborhood Search (ALNS) heuristic for a set of benchmark problems. GEET offers the advantage of extremely fast computational times, which is a substantial strength, especially in a dynamic transportation environment.     

Solving the Fleet Size and Mix Vehicle Routing Problem with Time Windows via Adaptive Memory Programming

This paper presents a novel Adaptive Memory Programming (AMP) solution approach for the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW). The FSMVRPTW seeks to design a set of depot returning vehicle routes to service a set of customers with known demands, for a heterogeneous fleet of vehicles with different capacities and fixed costs. Each customer is serviced only once by exactly one vehicle, within fixed time intervals that represent the earliest and latest times during the day that service can take place. The objective is to minimize the total transportation costs, or similarly to determine the optimal fleet composition and dimension following least cost vehicle routes. The proposed method utilizes the basic concept of an AMP solution framework equipped with a probabilistic semi-parallel construction heuristic, a novel solution re-construction mechanism, an innovative Iterated Tabu Search algorithm tuned for intensification local search and frequency-based long term memory structures. Computational experiments on well-known benchmark data sets illustrate the efficiency and effectiveness of the proposed method. Compared to the current state-of-the-art, the proposed method improves the best reported cumulative and mean results over most problem instances with reasonable computational requirements.     

The influence of employer ridesharing programs on employee mode choice

Employer ridesharing programs and employee mode choice were analyzed using Southern California data. Problems in estimating the costs and benefits of employer ridesharing programs were identified. Surveyed firms used a wide variety of information to estimate employee mode split internally. Virtually all surveyed firms offered free or subsidized parking to some or all of their employees. Few responding firms estimated the cost of providing employee parking accurately, if at all. Despite these significant data limitations, factors influencing firm choice of employer ridesharing program components were identified. The influence of employer ridesharing programs on employee mode choice was modeled using weighted least squares logit regression analysis. Firm size was foung to be the single most important variable identified in the analysis. Larger firms were more likely to offer ridesharing incentives to their empolyees, and to report direct employer benefits from ridesharing. Alternative work hours hindered the formation of ridesharing arrangements in some cases. Relatively few firms promoted ridesharing on a purely voluntary basis. A private market for employer ridesharing services was found to exist, however. Personalized matching assistance may be a critical factor in developing more effective employer ridesharing programs. Parking pricing and supply control measures probably would have a larger impact on employee mode split overall. Parking management faces severe obstacles in implementation, some of which might be overcome through the more extensive provision of ridesharing services, such as personalized matching assistance. to employees at specific employment sites by their employers.     

Fuel saving and ridesharing in the US: Motivations,limitations, and opportunities

Ridesharing can reduce the fuel consumed in noncommercial passenger highway vehicles by grouping individuals into fewer vehicles and reducing the number of miles that vehicles must travel. We estimate the potential fuel savings that could result from an increase in ridesharing in the US. If no additional travel is required to pick up passengers, adding one additional passenger for every 100 vehicles would reduce annual fuel consumption by 0.80–0.82 billion gallons of gasoline per year; if one passenger were added in every 10 vehicles, the potential savings would be 7.54–7.74 billion gallons per year. However, ridesharing may require extra travel to pick up additional passengers, which can reduce and possibly eliminate potential fuel savings. The tradeoff between saving fuel and spending time to pick up additional passengers is investigated, finding that, on average, ridesharing may not be attractive to travelers, but can be made more attractive by increasing per-vehicle-trip costs such as parking and tolls.     

A modeling approach for matching ridesharing trips within macroscopic travel demand models

State of the art travel demand models for urban areas typically distinguish four or five main modes: walking, cycling, public transport and car. The mode car can be further split into car-driver and car-passenger. As the importance of ridesharing may increase in the coming years, ridesharing should be addressed as an additional sub or main mode in travel demand modeling. This requires an algorithm for matching the trips of suppliers (typically car drivers) and demanders (travelers of non-car modes). The paper presents a matching algorithm, which can be integrated in existing travel demand models. The algorithm works likewise with integer demand, which is typical for agent-based microscopic models, and with non-integer demand occurring in travel demand matrices of a macroscopic model. The algorithm compares two path sets of suppliers and demanders. The representation of a path in the road network is reduced from a sequence of links to a sequence of zones. The zones act as a buffer along the path, where demanders can be picked up. The travel demand model of the Stuttgart Region serves as an application example. The study estimates that the entire travel demand of all motorized modes in the Stuttgart Region could be transported by 7% of the current car fleet with 65% of the current vehicle distance traveled, if all travelers were willing to either use ridesharing vehicles with 6 seats or traditional rail.     

Life cycle emissions and cost model for urban light duty vehicles

The growth of vehicle sales and use internationally requires the consumption of significant quantities of energy and materials, and contributes to the deterioration of air-quality and climate conditions. Advanced propulsion systems and electric drive vehicles have substantially different characteristics and impacts. They require life cycle assessments and detailed comparisons with gasoline powered vehicles which, in turn, should lead to critical updates of traditional models and assumptions. For a comprehensive comparison of advanced and traditional light duty vehicles, a model is developed that integrates external costs, including emissions and time losses, with societal and consumer life cycle costs. Life cycle emissions and time losses are converted into costs for seven urban light duty vehicles. The results, which are based on vehicle technology characteristics and transportation impacts on environment, facilitate vehicle comparisons and support policy making in transportation. Substantially, more sustainable urban transportation can be achieved in the short-term by promoting policies that increase vehicle occupancy; in the intermediate-term by increasing the share of hybrid vehicles in the car market and in the long-term by the widespread use of electric vehicles. A sensitivity-analysis of life cost results revealed that vehicle costs change significantly for different geographical areas depending on vehicle taxation, pricing of gasoline, electric power and pollution. Current practices in carbon and air quality pricing favor oil and coal based technologies. However, increasing the cost of electricity from coal and other fossil fuels would increase the variable cost for electric vehicles, and tend to favor the variable cost of hybrid vehicles.     

Shared ride services in North America: definitions,impacts, and the future of pooling

ABSTRACT

Shared ride services allow riders to share a ride to a common destination. They include ridesharing (carpooling and vanpooling); ridesplitting (a pooled version of ridesourcing/transportation network companies); taxi sharing; and microtransit. In recent years, growth of Internet-enabled wireless technologies, global satellite systems, and cloud computing - coupled with data sharing – are causing people to increase their use of mobile applications to share a ride. Some shared ride services, such as carpooling and vanpooling, can provide transportation, infrastructure, environmental, and social benefits. This paper reviews common shared ride service models, definitions, and summarises existing North American impact studies. Additionally, we explore the convergence of shared mobility; electrification; and automation, including the potential impacts of shared automated vehicle (SAV) systems. While SAV impacts remain uncertain, many practitioners and academic research predict higher efficiency, affordability, and lower greenhouse gas emissions. The impacts of SAVs will likely depend on the number of personally owned automated vehicles; types of sharing (concurrent or sequential); and the future modal split among public transit, shared fleets, and pooled rides. We conclude the paper with recommendations for local governments and public agencies to help in managing the transition to highly automated vehicles and encouraging higher occupancy modes.     

Meeting points in ridesharing: A privacy-preserving approach

Nowadays, problems of congestion in urban areas due to the massive usage of cars, last-minute travel needs and progress in information and communication technologies have fostered the rise of new transportation modes such as ridesharing. In a ridesharing service, a car owner shares empty seats of his car with other travelers. Recent ridesharing approaches help to identify interesting meeting points to improve the efficiency of the ridesharing service (i.e., the best pick-up and drop-off points so that the travel cost is competitive for both driver and rider). In particular, ridesharing services, such as Blablacar or Carma, have become a good mobility alternative for users in their daily life. However, this success has come at the cost of user privacy. Indeed in current’s ridesharing services, users are not in control of their own data and have to trust the ridesharing operators with the management of their data.In this paper, we aim at developing a privacy-preserving service to compute meeting points in ridesharing, such that each user remains in control of his location data. More precisely, we propose a decentralized architecture that provides strong security and privacy guarantees without sacrificing the usability of ridesharing services. In particular, our approach protects the privacy of location data of users. Following the privacy-by-design principle, we have integrated existing privacy enhancing technologies and multimodal shortest path algorithms to privately compute mutually interesting meeting points for both drivers and riders in ridesharing. In addition, we have built a prototype implementation of the proposed approach. The experiments, conducted on a real transportation network, have demonstrated that it is possible to reach a trade-off in which both the privacy and utility levels are satisfactory.     

Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm

This paper addresses a Time Dependent Capacitated Vehicle Routing Problem with stochastic vehicle speeds and environmental concerns. The problem has been formulated as a Markovian Decision Process. As distinct from the traditional attempts on the problem, while estimating the amount of fuel consumption and emissions, the model takes time-dependency and stochasticity of the vehicle speeds into account. The Time Dependent Capacitated Vehicle Routing Problem is known to be NP-Hard for even deterministic settings. Incorporating uncertainty to the problem increases complexity, which renders classical optimization methods infeasible. Therefore, we propose an Approximate Dynamic Programming based heuristic as a decision aid tool for the problem. The proposed Markovian Decision Model and Approximate Dynamic Programming based heuristic are flexible in terms that more environmentally friendly solutions can be obtained by changing the objective function from cost minimization to emissions minimization. The added values of the proposed decision support tools have been shown through computational analyses on several instances. The computational analyses show that incorporating vehicle speed stochasticity into decision support models has potential to improve the performance of resulting routes in terms of travel duration, emissions and travel cost. In addition, the proposed heuristic provides promising results within relatively short computation times.