Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userdFDA-VeD: A Dynamic Future Demand Aware Vehicle Dispatching System
65
0
0.0
(
0
)
Added by
Yang Guo
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
With the rising demand of smart mobility, ride-hailing service is getting popular in the urban regions. These services maintain a system for serving the incoming trip requests by dispatching available vehicles to the pickup points. As the process should be socially and economically profitable, the task of vehicle dispatching is highly challenging, specially due to the time-varying travel demands and traffic conditions. Due to the uneven distribution of travel demands, many idle vehicles could be generated during the operation in different subareas. Most of the existing works on vehicle dispatching system, designed static relocation centers to relocate idle vehicles. However, as traffic conditions and demand distribution dynamically change over time, the static solution can not fit the evolving situations. In this paper, we propose a dynamic future demand aware vehicle dispatching system. It can dynamically search the relocation centers considering both travel demand and traffic conditions. We evaluate the system on real-world dataset, and compare with the existing state-of-the-art methods in our experiments in terms of several standard evaluation metrics and operation time. Through our experiments, we demonstrate that the proposed system significantly improves the serving ratio and with a very small increase in operation cost.
rate research
Read More
Over the past few years, ride-sharing has emerged as an effective way to relieve traffic congestion. A key problem for these platforms is to come up with a revenue-optimal (or GMV-optimal) pricing scheme and an induced vehicle dispatching policy that incorporate geographic and temporal information. In this paper, we aim to tackle this problem via an economic approach. Modeled naively, the underlying optimization problem may be non-convex and thus hard to compute. To this end, we use a so-called ironing technique to convert the problem into an equivalent convex optimization one via a clean Markov decision process (MDP) formulation, where the states are the driver distributions and the decision variables are the prices for each pair of locations. Our main finding is an efficient algorithm that computes the exact revenue-optimal (or GMV-optimal) randomized pricing schemes. We characterize the optimal solution of the MDP by a primal-dual analysis of a corresponding convex program. We also conduct empirical evaluations of our solution through real data of a major ride-sharing platform and show its advantages over fixed pricing schemes as well as several prevalent surge-based pricing schemes.
As a foreseeable future mode of transport with lower emissions and higher efficiencies, electric vehicles have received worldwide attention. For convenient centralized management, taxis are considered as the fleet with electrification priority. In this work, we focus on the study on electric taxis dispatching, with consideration of picking up customers and recharging, based on real world traffic data of a large number of taxis in Beijing. First, the assumed electric taxi charging stations are located using the K mean method. Second, based on the station locations and the order demands, which are in form of origin-destination pairs and extracted from the trajectory data, a dispatching strategy as well as the simulation framework is developed with consideration of reducing customer waiting time, mitigating electric taxi charging congestion, and balancing order number distribution among electric taxis. The proposed method models the electric taxi charging behaviors temporally discretely from the aspects of charging demands and availability of chargers, and further incorporates a centralized and intelligent fleet dispatching platform, which is capable of handling taxi service requests and arranging electric taxis recharging in real time. The methodology in this paper is readily applicable to dispatching of different types of electric vehicle fleet with similar dataset available. Among the method, we use queueing theory to model the electric vehicle charging station waiting phenomena and include this factor into dispatching platform. Carbon emission is also surveyed and analyzed.
On-demand delivery has become increasingly popular around the world. Brick-and-mortar grocery stores, restaurants, and pharmacies are providing fast delivery services to satisfy the growing home delivery demand. Motivated by a large meal and grocery delivery company, we model and solve a multiperiod driver dispatching and routing problem for last-mile delivery systems where on-time performance is the main target. The operator of this system needs to dispatch a set of drivers and specify their delivery routes in a stochastic environment, in which random demand arrives over a fixed number of periods. The resulting dynamic program is challenging to solve due to the curse of dimensionality. We propose a novel approximation framework to approximate the value function via a simplified dispatching program. We then develop efficient exact algorithms for this problem based on Benders decomposition and column generation. We validate the superior performance of our framework and algorithms via extensive numerical experiments. Tested on a real-world data set, we quantify the value of adaptive dispatching and routing in on-time delivery and highlight the need of coordinating these two decisions in a dynamic setting. We show that dispatching multiple vehicles with short trips is preferable for on-time delivery, as opposed to sending a few vehicles with long travel times.
Given the rise of electric vehicle (EV) adoption, supported by government policies and dropping technology prices, new challenges arise in the modeling and operation of electric transportation. In this paper, we present a model for solving the EV routing problem while accounting for real-life stochastic demand behavior. We present a mathematical formulation that minimizes travel time and energy costs of an EV fleet. The EV is represented by a battery energy consumption model. To adapt our formulation to real-life scenarios, customer pick-ups and drop-offs were modeled as stochastic parameters. A chance-constrained optimization model is proposed for addressing pick-ups and drop-offs uncertainties. Computational validation of the model is provided based on representative transportation scenarios. Results obtained showed a quick convergence of our model with verifiable solutions. Finally, the impact of electric vehicles charging is validated in Downtown Manhattan, New York by assessing the effect on the distribution grid.
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, leading to new challenges which, to the best of our knowledge, have not been addressed by existing works. To fill the gap, we design novel trip-vehicle dispatch algorithms to handle both types of requests while taking into account an estimated request distribution of on-demand requests. At the core of the algorithms is the newly proposed Constrained Spatio-Temporal value function (CST-function), which is polynomial-time computable and represents the expected value a vehicle could gain with the constraint that it needs to arrive at a specific location at a given time. Built upon CST-function, we design a randomized best-fit algorithm for scheduled requests and an online planning algorithm for on-demand requests given the scheduled requests as constraints. We evaluate the algorithms through extensive experiments on a real-world dataset of an online ride-hailing platform.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
