Search NASASearch

Engineering topics

Chen, Yifan

Publications and source records attributed to Chen, Yifan.

Human Factors and Technologies Design to Improve User Acceptance of Pooled Rideshare for Increasing Transportation System Energy Efficiency

This multi-year project delivered a comprehensive, human-factors-driven framework to understand, model, and improve pooled rideshare (PR) adoption in the United States. Through three large-scale national survey studies involving more than 16,000 participants across multiple cities and demographic groups, the research established one of the most extensive datasets to date on user perceptions, behavioral barriers, and service expectations related to pooled rideshare. These data revealed key human factors barriers of user acceptance of PR and suggested potential actionable experience optimizations that could lead to increased PR usage. This foundational knowledge guided the development of novel human-factors models and behavioral choice models that quantify how psychological, demographic, and trip-level factors influence willingness to pool. Building on these empirical insights, the project developed advanced behavioral modeling tools, including mixed logit and integrated choice and latent variable models, to capture both observable and latent influences on PR adoption. These models significantly improved the ability to predict riders’ acceptance of pooled trips, explaining choice heterogeneity through latent constructs such as safety, service experience, privacy concerns, time sensitivity, and environmental attitudes. Together, these models provide a robust analytical foundation for designing PR systems that more effectively meet user needs. The project translated human-factors insights and behavioral models into actionable technology innovations by extending POLARIS—an agent-based, activity-based travel simulation platform—into a fully functional pooled rideshare simulation environment. New PR modules, acceptance models, and regional scenarios were implemented for Greenville, SC and Austin, TX, enabling high-fidelity validation of algorithmic strategies under realistic demand and traffic conditions. The simulation platform supported the development and evaluation of adaptive discount-based assignment algorithms, enhanced willingness-to-pay formulations, demographic-aware incentive mechanisms, and a proactive joint assignment and repositioning strategy. Simulation results demonstrated substantial gains in pooling uptake, average vehicle occupancy, energy efficiency, and fleet profitability. In Greenville, pooling adoption more than doubled, while reductions in vehicle-miles traveled and energy consumption were significant. In Austin, pooling improvements were achieved with minimal service-quality trade-offs, and profitability increased across all fleet sizes. Through this research, we developed a comprehensive understanding of the human factors barriers that limit user acceptance of pooled rideshare services. These insights enabled the design of human-factors-aware pooled rideshare technologies that more effectively address user concerns and improve adoption rates. By integrating these models into an advanced agent-based simulation framework, we demonstrated that higher adoption of pooled rideshare can lead to measurable improvements in energy efficiency and system performance. Together, these contributions establish a validated pathway from human-centered analysis to technology development and energy-saving outcomes, supporting national goals for more sustainable and efficient mobility systems.

Jia, Yunyi

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING