Search NASA⌕ Search

Engineering topics

Cokyasar, Taner

Publications and source records attributed to Cokyasar, Taner.

At least 19 records

Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming

Shared autonomous vehicles (SAVs) bring competition to traditional transit services but redesigning multimodal transit network can utilize SAVs as feeders to enhance service efficiency and coverage. This paper presents an optimization framework for the joint multimodal transit frequency and SAV fleet size problem, a variant of the transit network frequency setting problem. The objective is to maximize total transit ridership (including SAV-fed trips and subtracting boarding rejections) across multiple time periods under budget constraints, considering endogenous mode choice (transit, point-to-point SAVs, driving) and route selection, while allowing for strategic route removal by setting frequencies to zero. Due to the problem’s non-linear, non-convex nature and the computational challenges of large-scale networks, we develop a hybrid solution approach that combines a metaheuristic approach (particle swarm optimization) with nonlinear programming for local solution refinement. To ensure computational tractability, the framework integrates analytical approximation models for SAV waiting times based on fleet utilization, multimodal network assignment for route choice, and multinomial logit mode choice behavior, bypassing the need for computationally intensive simulations within the main optimization loop. Applied to the Chicago metropolitan area’s multimodal network, our method illustrates a 33.3% increase in transit ridership through optimized transit route frequencies and SAV integration, particularly enhancing off-peak service accessibility and strategically reallocating resources.

Ng, Max↗

Improving Experience Beyond the Ride: Joint Assignment and Repositioning for Rideshare

In this study, a novel joint assignment and repositioning strategy is designed, implemented, and tested in a simulated traffic environment. The strategy addresses limitations of previously constructed rideshare repositioning algorithms by integrating the consideration of rider pooling into the optimization. By considering pooling, the strategy can minimize excess vehicle movement and increase riders' use of pooled services over a zonal-flow-based repositioning strategy and a fleet operating with no repositioning at all. The new strategy can increase pooling by up to 2.3% compared to no repositioning in a large region, and up to 0.1% in a small region, without compromising overall fleet revenue. Additionally, compared to a baseline, flow-based repositioning strategy, the new strategy can reduce empty vehicle travel by up to 30% in the larger region, and 2.1% in the smaller simulated area.

Paul, Joseph↗

Modeling and Calibration of Supplier Selection Problem in Freight Agent-Based Simulations

Freight transportation modeling often struggles with data limitations, especially in accurately representing complex supplier selection processes and their impact on network flows. This research addresses this critical gap by developing a large-scale, calibrated agent-based model for supplier selection, complemented by a probabilistic heuristic for international shipments. Our approach integrates trade relationships between industry sectors, transportation costs, and a supplier-rating model adapted from existing literature. The model’s core objective is to minimize the discrepancy between modeled and observed commodity flows while ensuring a close match to regional shipping distance distributions. Implemented and tested across four major U.S. metropolitan areas—Atlanta, Chicago, Dallas–Fort Worth, and Los Angeles—the model demonstrates high fidelity in replicating observed freight patterns. Key findings reveal consistent alignment with national shipping distance trends and highlight significant spatial variations in commodity trade assignments and demand across the study regions. This behaviorally informed and transport-sensitive framework is designed to approximate real-world decision making, providing a robust tool for policymakers and planners to evaluate targeted interventions, assess infrastructure investments, and enhance supply chain resilience in the face of disruptions.

Ismael, Abdelrahman (ORCID:0000000303712110)↗

A Study of Financial Impacts of Pooled Rideshare Based on Assignment Strategies

This study explores the potential profitability of a pooled rideshare service in a simulation-based case study of two US metropolitan regions in the context of two fleet assignment strategies. A new method of obtaining more accurate fares is created to address scalability and accuracy assumptions relevant to pooling choice. Cases for private rideshare fleets, public mobility on demand offerings, and autonomous fleets are explored and analyzed. Two regions of differing types are explored to illustrate the impacts of geo-spatial demand density of profitability, with one region capturing a large urban and suburban environment and the second a less dense more compact small city. Results indicate that the cost of human drivers is prohibitively expensive, and regulation of driver pay extends the issue of financial viability. Despite these shortcomings, a more efficient rideshare assignment strategy is shown to increase profitability by as much as 60%. The smaller, more dense region was illustrated to experience a greater increase in profitability than the larger region when pooling was improved.

Paul, Joseph↗

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗

An integrated transportation-power system model for a decarbonizing world

Rising demand for electricity from electric vehicles (EVs) will require new paradigms to guarantee reliable and low-cost electricity. This study couples an agent-based travel demand simulator and an electricity grid model to assess the economic costs of supplying power to meet EVs' added demand across the Chicago region. Results suggest that shifting from personal EVs to a fleet of shared, fully-automated all-electric vehicles (SAEVs) could lower per-mile emissions, congestion, and embodied vehicle and charging infrastructure emissions. Further, the results should compel policymakers to shift the cost of providing power onto commercial customers, like electric ride-hail fleets, through price-indexed electricity prices, which can shift charging to off-peak periods or away from resource-scarce hours.

Integrated modeling↗

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗

Redesigning large-scale multimodal transit networks with shared autonomous mobility services

Here, this study addresses a large-scale multimodal transit network design problem, with Shared Autonomous Mobility Services (SAMS) as both transit feeders and an origin-to-destination mode. The framework captures spatial demand and modal characteristics, considers intermodal transfers and express services, determines transit infrastructure investment and path flows, and generates transit routes. A system-optimal multimodal transit network is designed with minimum total door-to-door generalized costs of users and operators, satisfying transit origin-destination demand within a pre-set infrastructure budget. Firstly, the geography, demand, and modes in each zone are characterized with continuous approximation. The decisions of network link investment and multimodal path flows in zonal connection optimization are formulated as a minimum-cost multi-commodity network flow (MCNF) problem and solved efficiently with a mixed-integer linear programming (MILP) solver. Subsequently, the route generation problem is solved by expanding the MCNF formulation to minimize intramodal transfers. The model is illustrated through a set of experiments with the Chicago network comprised of 50 zones and seven modes, under three scenarios. The computational results present savings in traveler journey time and operator cost demonstrating the potential benefits of collaboration between multimodal transit systems and SAMS.

Autonomous vehicles↗

Optimization of Dynamic Ride-Sharing by Considering User Preference Through Discount and Delay Tolerance

Dynamic ride-sharing (DRS) has been projected to be a key solution to lowering system-wide congestion. Despite recent development progress, demand studies for DRS suggest low levels of willingness for travelers to use such services. The disconnect between DRS system designs and user preferences limits the application impacts of DRS in the real world. Therefore, this paper aims to design a new DRS system by considering the user preferences of choices under different levels of services. In this study, an agent-based approach is used to model a fleet of shared vehicles that allows DRS. An optimization model is developed to match riders to vehicles while accounting for traveler delay and delay acceptance. Travelers are also dynamically issued predictive discounts to incentivize them to accept longer trip delays. Results show that the proposed approach can improve system efficiency by increasing average vehicle occupancy by up to 1.0 persons/trip and DRS acceptance up to 38.9% depending on fleet size. Additionally, congestion is eased through the decrease of empty vehicle miles traveled by up to 7.1%.

Paul, Joseph↗

Integrating Human Factors in Dynamic Rideshare Assignment: Willingness-To-Pay for Delay

Dynamic ride-sharing (DRS) has been projected to be a key solution to lowering system-wide congestion. Despite recent developmental progress, demand studies for DRS suggest low levels of willingness for travelers to use such services. The disconnect between DRS system designs and user preferences limits the application impacts of DRS in the real world. Therefore, this paper aims to design a new DRS trip/vehicle assignment strategy by considering the user preferences of choices under different levels of service. In this study, an agent-based simulation approach is used to model a fleet of shared vehicles that allows DRS. An optimization model is developed to match riders to vehicles while accounting for traveler delay and delay acceptance. Travelers are also dynamically issued predictive discounts, catered to their expected willingness to pay, to incentivize them to accept longer trip delays. Results show that the proposed approach can improve system efficiency by increasing average vehicle occupancy by up to 1.0 persons/trip and DRS acceptance by up to 38.9% depending on fleet size. Additionally, congestion is eased through the decrease of empty vehicle miles traveled by up to 7.1%.

Paul, Joseph↗

Comparing Regional Energy Consumption for Direct Drone and Truck Deliveries

Drone delivery, once thought of as fictitious, is becoming a reality with the efforts of both forward-looking enterprises and supportive government policies. This emerging mode of e-commerce delivery raises many concerns. One important concern is the energy efficiency of direct delivery drones compared with conventional delivery trucks at a regional systems level. Here, in this study, we develop and apply methods to quantify the regional energy impacts of drone delivery, then we assess these impacts and compare them with the impacts of truck delivery. To study this problem, we develop an optimization model that determines an optimal set of fulfillment centers (FCs) with variable service capacities that allow drones to make direct e-commerce deliveries. We adopt two drone delivery energy estimation models from the literature and use them as inputs to demonstrate the potential range of energy needs. We also develop another optimization model to account for the energy consumption of diesel trucks (DTs) and battery electric vehicles (BEVs). We test the models using validated simulation data for the Chicago metropolitan area in the U.S. to quantify the energy implications of these three delivery modes. For drone delivery, we further extend our analyses by considering the impact of wind speed and flight patterns. Our results show that direct delivery drones require 15.8% more energy than BEVs on an average windy day, and they need 15% more energy than DTs on a very windy day. We provide essential parameter values for reproducibility and list relevant open problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Joint routing of conventional and range-extended electric vehicles in a large metropolitan network

Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly advantageous for time-constrained delivery routing in dense urban areas, where battery recharging along routes can be too time-consuming to economically justify the use of all-electric vehicles. However, switching from electric to conventional fossil fuel modes also results in higher costs and emissions and lower efficiency. This paper analyzes this heterogeneous vehicle routing problem and describes two solution methods: an exact branch-price-and-cut algorithm and an iterated tabu search metaheuristic. From a methodological perspective, we find that the exact algorithm consistently obtains tight lower bounds that also serve to certify the metaheuristic solutions as near-optimal. From a policy standpoint, we examine a large-scale real-world case study concerning parcel deliveries in the Chicago metropolitan area and quantify various operational metrics including energy costs and vehicle miles traveled. We find that by deploying roughly 20% of range -extended vehicles with a modest all-electric range of 33 miles, parcel distributors can save energy costs by up to 17% while incurring less than 0.5% increase in vehicle miles traveled. Increasing the range to 60 miles further reduces costs by only 4%, which can alternatively be achieved by decreasing the average service time by 1 minute or increasing driver working time by 1 hour. In conclusion, our study reveals several key areas of improvement on which vehicle manufacturers, distributors, and policy makers can focus their attention.

33 ADVANCED PROPULSION SYSTEMS↗

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗