Results 81 to 90 of about 118,691,665 (153)
The electric autonomous dial-a-ride problem
, 2020 This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a-Ride Problem (e-ADARP), and includes battery management and autonomous aspects along with classic
openaire +1 more source
, 1998 "November 17, 1998."; Discusses whether it is a common practice for towns to require senior citizens to pay a fee for dial-a-ride ...
Niesz, Helga,
core
Multimodal TransportationThis study addresses the integrated dial-a-ride problem using a fleet of electric vehicles. We propose a mixed-integer-linear programming modelling approach considering multiple depots, customer rejection, partial recharge policy and capacitated charging
Yumeng Fang, Tai-Yu Ma, Francesco Viti
doaj +1 more source
Autonomous dial-a-ride transit : benefit-cost evaluation [PDF]
Among public transit and for-hire modes, fixed-route bus and rail are most effective in maintaining high ridership in high density areas such as urban centers.
Lau, Samuel W. +1 more
core
Smart CitiesAs customers’ expectations continue to rise, advanced on-demand transport services face the challenge of meeting new requirements. This study addresses a specific transportation issue belonging to dial-a-ride problems, including constraints aimed at ...
Sonia Nasri +2 more
doaj +1 more source
The Line-Based Dial-a-Ride Problem
20 pages, 5 figures, to be published in OASIcs, Volume 123, ATMOS ...
Kendra Reiter +2 more
openaire +5 more sources
CoRRUrban mobility systems are transitioning toward electric, on-demand services, creating operational challenges for fleet management under energy and service-quality constraints. The Electric Dial-a-Ride Problem (E-DARP) extends the classical dial-a-ride problem by incorporating limited battery capacity and nonlinear charging dynamics, increasing ...
Sten Elling Tingstad Jacobsen +3 more
openaire +3 more sources
Municipal dial-a-ride grant legislation
, 2002 Electronic data.; Title from title screen.; "October 22, 2002."; Summarizes provisions in 1999 legislation that required the state to make grants to municipalities for Dial-a-Ride programs.; Harvested from the web on 9/28 ...
Niesz, Helga.
core +1 more source
, 2007 The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V, with m demand pairs ⊆ V × V and a “target ” k ≤ m, the goal is to find a minimum cost subgraph that ...
R. Ravi +3 more
core
Online multi-server dial-a-ride problems [PDF]
, 2006 . In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible ob-jective functions include minimizing the makespan and minimizing the sum of completion times.
Bonifaci, V. +8 more
core