Results 61 to 70 of about 114,072,099 (194)
Dynamic Intercity Ride‐Sharing Optimisation Based on Two‐Stage Information Feedback
The article introduces a novel two‐stage scheduling approach for intercity dynamic ridesharing that separates the process into a coarse scheduling phase (with online and offline vehicle matching) and a fine scheduling phase that refines the solution using a large neighbourhood search algorithm. By integrating deep Q‐learning to dynamically trigger fine
Cheng Wang, Shangyu Gao, Jin Jiang
wiley +1 more source
This paper studies the coordinated scheduling and management for hybrid DRT systems offering both direct door‐to‐door rides and feeder connections to mass transit, incorporating passenger mode choice behaviour to account for heterogeneous passenger preferences in a multimodal environment.
Jingxuan Ren, Wenzhou Jin
wiley +1 more source
Regional dial-a-ride passenger survey report [PDF]
: Valley Metro periodically conducts surveys with Dial-A-Ride passengers to gather information on trip making, demographic, and rider satisfaction with transit services. Previous Dial-a-Ride studies were conducted in 2000, 2002, and 2007.
core
Minimum Makespan Multi-vehicle Dial-a-Ride * [PDF]
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {( , where each object requires to be moved from its source to destination ...
R Ravi +3 more
core
Increasing urbanization has led to rising mobility and infrastructural challenges for cities and surrounding areas. Electrical vertical takeoff and landing aircrafts, also known as air taxis, enable the use of a new dimension, the skyscape.
Laura Riza +3 more
doaj +1 more source
ABSTRACT Existing literature largely agrees that authoritarian regimes establish channels for political participation to gather valuable information on citizens' anti‐regime sentiments and policy preferences and to supervise lower‐level bureaucrats and firms.
Anton Bogs
wiley +1 more source
A Study on the application of genetic algorithms on the Dial-A-Ride Problem [PDF]
The Dial-a-Ride Problem (DARP) is a vehicle routing problem faced in arranging Dial-a-Ride services. The DARP has been proven a NP-Hard problem; therefore, most research has used heuristic solution methods to address this issue. The purpose of this study
HSIEN-MING CHIU (hmchra@mail.tku.edu.tw) +1 more
core
Improved Approximations for Dial-a-Ride Problems
The multi-vehicle dial-a-ride problem (mDaRP) is a fundamental vehicle routing problem with pickups and deliveries, widely applicable in ride-sharing, economics, and transportation. Given a set of $n$ locations, $h$ vehicles of identical capacity $λ$ located at various depots, and $m$ ride requests each defined by a source and a destination, the goal ...
Jingyang Zhao 0001, Mingyu Xiao 0001
openaire +2 more sources
On-line single-server dial-a-ride problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Feuerstein, L. Stougie (Leen)
openaire +6 more sources
This paper presents a new two‐stage protection strategy for active distribution networks that not only addresses selectivity constraints along protected lines but also incorporates fault‐ride‐through (FRT) requirements of inverter‐based distributed energy resources (IBDERs). The proposed coordination strategy (PCS), which distinguishes it from previous
Amin Yazdaninejadi +4 more
wiley +1 more source

