Browse
Submit Data
Databases
API
Help

Dataset Information

18 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Two-stage battery recharge scheduling and vehicle-charger assignment policy for dynamic electric dial-a-ride services.

ABSTRACT: Coordinating the charging scheduling of electric vehicles for dynamic dial-a-ride services is challenging considering charging queuing delays and stochastic customer demand. We propose a new two-stage solution approach to handle dynamic vehicle charging scheduling to minimize the costs of daily charging operations of the fleet. The approach comprises two components: daily vehicle charging scheduling and online vehicle-charger assignment. A new battery replenishment model is proposed to obtain the vehicle charging schedules by minimizing the costs of vehicle daily charging operations while satisfying vehicle driving needs to serve customers. In the second stage, an online vehicle-charger assignment model is developed to minimize the total vehicle idle time for charges by considering queuing delays at the level of chargers. An efficient Lagrangian relaxation algorithm is proposed to solve the large-scale vehicle-charger assignment problem with small optimality gaps. The approach is applied to a realistic dynamic dial-a-ride service case study in Luxembourg and compared with the nearest charging station charging policy and first-come-first-served minimum charging delay policy under different charging infrastructure scenarios. Our computational results show that the approach can achieve significant savings for the operator in terms of charging waiting times (-74.9%), charging times (-38.6%), and charged energy costs (-27.4%). A sensitivity analysis is conducted to evaluate the impact of the different model parameters, showing the scalability and robustness of the approach in a stochastic environment.

SUBMITTER: Ma TY

PROVIDER: S-EPMC8136635 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem.

Project description:Dial a ride problem (DARP) is a complex version of the pick-up and delivery problem with many practical applications in the field of transportation. This study proposes an enhanced deterministic annealing algorithm for the solution of large-scale multi-vehicle DARPs. The proposed method always explores the feasible search space; therefore, a feasible solution is guaranteed at any point of termination. This method utilises advanced local search operators to accelerate the search for optimal solutions and it relies on a linearly decreasing deterministic annealing schedule to limit poor jumps during the course of search. This study puts forward a systematic series of experiments to compare the performance of solution methods from various angles. The proposed method is compared with the most efficient methods reported in the literature i.e., the Adaptive Large Neighbourhood Search (ALNS), Evolutionary Local Search (ELS), and Deterministic Annealing (DA) using standard benchmarks. The results suggest that the proposed algorithm is on average faster than the state-of-the-art algorithms in reaching competitive objective values across the range of benchmarks.

| S-EPMC10852268 | biostudies-literature

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.

Project description:Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study highlighted some of the benefits of car pooling but was limited to static routes with two riders per vehicle (optimally) or three (with heuristics). We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect to online demand and vehicle locations. The algorithm starts from a greedy assignment and improves it through a constrained optimization, quickly returning solutions of good quality and converging to the optimal assignment over time. We quantify experimentally the tradeoff between fleet size, capacity, waiting time, travel delay, and operational costs for low- to medium-capacity vehicles, such as taxis and van shuttles. The algorithm is validated with ∼3 million rides extracted from the New York City taxicab public dataset. Our experimental study considers ride-sharing with rider capacity of up to 10 simultaneous passengers per vehicle. The algorithm applies to fleets of autonomous vehicles and also incorporates rebalancing of idling vehicles to areas of high demand. This framework is general and can be used for many real-time multivehicle, multitask assignment problems.

| S-EPMC5255617 | biostudies-literature

Financial viability of electric vehicle lithium-ion battery recycling.

Project description:Economically viable electric vehicle lithium-ion battery recycling is increasingly needed; however routes to profitability are still unclear. We present a comprehensive, holistic techno-economic model as a framework to directly compare recycling locations and processes, providing a key tool for recycling cost optimization in an international battery recycling economy. We show that recycling can be economically viable, with cost/profit ranging from (-21.43 - +21.91) $·kWh-1 but strongly depends on transport distances, wages, pack design and recycling method. Comparing commercial battery packs, the Tesla Model S emerges as the most profitable, having low disassembly costs and high revenues for its cobalt. In-country recycling is suggested, to lower emissions and transportation costs and secure the materials supply chain. Our model thus enables identification of strategies for recycling profitability.

| S-EPMC8283134 | biostudies-literature

An open tool for creating battery-electric vehicle time series from empirical data, emobpy.

Project description:There is substantial research interest in how future fleets of battery-electric vehicles will interact with the power sector. Various types of energy models are used for respective analyses. They depend on meaningful input parameters, in particular time series of vehicle mobility, driving electricity consumption, grid availability, or grid electricity demand. As the availability of such data is highly limited, we introduce the open-source tool emobpy. Based on mobility statistics, physical properties of battery-electric vehicles, and other customizable assumptions, it derives time series data that can readily be used in a wide range of model applications. For an illustration, we create and characterize 200 vehicle profiles for Germany. Depending on the hour of the day, a fleet of one million vehicles has a median grid availability between 5 and 7 gigawatts, as vehicles are parking most of the time. Four exemplary grid electricity demand time series illustrate the smoothing effect of balanced charging strategies.

| S-EPMC8196066 | biostudies-literature

Predictive modeling of battery degradation and greenhouse gas emissions from U.S. state-level electric vehicle operation.

Project description:Electric vehicles (EVs) are widely promoted as clean alternatives to conventional vehicles for reducing greenhouse gas (GHG) emissions from ground transportation. However, the battery undergoes a sophisticated degradation process during EV operations and its effects on EV energy consumption and GHG emissions are unknown. Here we show on a typical 24?kWh lithium-manganese-oxide-graphite battery pack that the degradation of EV battery can be mathematically modeled to predict battery life and to study its effects on energy consumption and GHG emissions from EV operations. We found that under US state-level average driving conditions, the battery life is ranging between 5.2 years in Florida and 13.3 years in Alaska under 30% battery degradation limit. The battery degradation will cause a 11.5-16.2% increase in energy consumption and GHG emissions per km driven at 30% capacity loss. This study provides a robust analytical approach and results for supporting policy making in prioritizing EV deployment in the U.S.

| S-EPMC6013442 | biostudies-literature

Drive circuitry of an electric vehicle enabling rapid heating of the battery pack at low temperatures.

Project description:Heating battery at low temperatures is fundamental to avoiding the range anxiety and the time-consuming charging associated with electric vehicles (EVs). One method for achieving fast and uniform battery heating is to polarize the cell under pulse currents. However, the on-board implementation of this method leads to an increase in the cost and size. Therefore, in this study, an adapted EV circuitry compatible with the existing one and an optimized operating condition are proposed to enable rapid battery heating. With this circuit, electricity transfer between the cells can be realized through a motor, leading to remarkably higher battery currents than those of the conventional circuit. The increase in the maximum heating currents (from 1.41C to 4C) resulted in a battery temperature rise of 8.6°C/min at low temperatures. This heating method exhibits low cost, high efficiency, and negligible effects on battery degradation, practical and promising on battery heating of EVs.

| S-EPMC7773877 | biostudies-literature

A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem

Project description:In their operations private chauffeur companies have to solve variations of the multiple objective dial a ride problem. The number and type of restrictions make the problem extremely intricate and, when manually done, requires specialized people with a deep knowledge of the modus operandi of the company and of the environment in which the procedure takes place. Nevertheless, the scheduling can be automated through mean of computational methods, allowing to deliver solutions faster and, possible, optimized. In this context, this paper compares six algorithms applied to solving a multiple objective dial a ride problem, using data from a company mainly working in the Algarve, Portugal. The achieved results show that

| S-EPMC7304764 | biostudies-literature

Ride-Hailing Services and Alcohol Consumption: Longitudinal Analysis.

Project description:BackgroundAlcohol consumption is associated with a wide range of adverse health consequences and a leading cause of preventable deaths. Ride-hailing services such as Uber have been found to prevent alcohol-related motor vehicle fatalities. These services may, however, facilitate alcohol consumption generally and binge drinking in particular.ObjectiveThe goal of the research is to measure the impact of ride-hailing services on the extent and intensity of alcohol consumption. We allow these associations to depend on population density as the use of ride-hailing services varies across markets.MethodsWe exploit the phased rollout of the ride-hailing platform Uber using a difference-in-differences approach. We use this variation to measure changes in alcohol consumption among a local population following Uber's entry. Data are drawn from Uber press releases to capture platform entry and the Behavioral Risk Factor Surveillance Systems (BRFSS) Annual Survey to measure alcohol consumption in 113 metropolitan areas. Models are estimated using fixed-effects Poisson regression. Pre- and postentry trends are used to validate this approach.ResultsRide-hailing has no association with the extent of alcohol consumption in high (0.61 [95% CI -0.05% to 1.28%]) or low (0.61 [95% CI -0.05% to 1.28%]) density markets, but is associated with increases in the binge drinking rate in high-density markets (0.71 [95% CI 0.13% to 1.29%]). This corresponds to a 4% increase in binge drinking within a Metropolitan Statistical Area.ConclusionsRide-hailing services are associated with an increase in binge drinking, which has been associated with a wide array of adverse health outcomes. Drunk driving rates have fallen for more than a decade, while binge drinking continues to climb. Both trends may be accelerated by ride-hailing services. This suggests that health information messaging should increase emphasis on the direct dangers of alcohol consumption and binge drinking.

| S-EPMC7875688 | biostudies-literature

Understanding Inequalities in Ride-Hailing Services Through Simulations.

Project description:Despite the potential of ride-hailing services to democratize the labor market, they are often accused of fostering unfair working conditions and low wages. This paper investigates the effect of algorithm design decisions on wage inequality in ride-hailing platforms. We create a simplified city environment where taxis serve passengers to emulate a working week in a worker's life. Our simulation approach overcomes the difficulties stemming from both the complexity of transportation systems and the lack of data and algorithmic transparency. We calibrate the model based on empirical data, including conditions about locations of drivers and passengers, traffic, the layout of the city, and the algorithm that matches requests with drivers. Our results show that small changes in the system parameters can cause large deviations in the income distributions of drivers, leading to an unpredictable system that often distributes vastly different incomes to identically performing drivers. As suggested by recent studies about feedback loops in algorithmic systems, these short-term income differences may result in enforced and long-term wage gaps.

| S-EPMC7162900 | biostudies-literature

A benchmark dataset for the multiple depot vehicle scheduling problem.

Project description:This data article presents a description of a benchmark dataset for the multiple depot vehicle scheduling problem (MDVSP). The MDVSP is to assign vehicles from different depots to timetabled trips to minimize the total cost of empty travel and waiting. The dataset has been developed to evaluate the heuristics of the MDVSP that are presented in "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem" (Kulkarni et al., 2018). The dataset contains 60 problem instances of varying size. Researchers can use the dataset to evaluate the future algorithms for the MDVSP and compare the performance with the existing algorithms. The dataset includes a program that can be used to generate new problem instances of the MDVSP.

| S-EPMC6312793 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data