SearcharxivSearch

arXiv · 2407.05572

Reducing Total Trip Time and Vehicle Emission through Park-and-Ride -- methods and case-study

Abstract

This study addresses important issues of traffic congestion and vehicle emissions in urban areas by developing a comprehensive mathematical framework to evaluate Park-and-Ride (PnR) systems. The proposed approach integrates queueing theory and emissions modeling to simultaneously assess waiting times, travel times, and vehicle emissions under various PnR usage scenarios. The methodology employs a novel combination of Monte Carlo simulation and matrix geometric analytic methods to analyze a queueing network representing PnR facilities and road traffic. A case study of Tsukuba, Japan demonstrates the model's applicability, revealing potential reductions in social costs related to total trip time and emissions through optimized PnR policies. Specifically, the study found that implementing optimal bus frequency and capacity policies could reduce total social costs by up to 30\% compared to current conditions. This research contributes to the literature by providing a unified framework for evaluating PnR systems that considers both time and environmental costs, offering valuable insights for urban planners and policymakers seeking to improve transportation sustainability. The proposed model utilizes a single server queue with a deterministic service time and multiple arrival streams to represent traffic flow, incorporating both private cars and public buses. Emissions are calculated using the Methodologies for Estimating Air Pollutant Emissions from Transport (MEET) framework. The social cost of emissions and total trip time (SCETT) is introduced as a comprehensive metric for evaluating PnR system performance.

Explore related subjects

Keep this discovery

BibTeXRIS

Ayane Nakamura, Fabiana Ferracina, Naoki Sakata, Takahiro Noguchi, Hiroyasu Ando. 2024-07-08. Reducing Total Trip Time and Vehicle Emission through Park-and-Ride -- methods and case-study. https://arxiv.org/abs/2407.05572

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO