Integrating On-demand Ride-sharing with Mass Transit at-Scale
Fuente:
arXiv
Saved in:
| Main Authors: | Edirimanna, Danushka, Hu, Hins, Samaranayake, Samitha |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Vehicle Routing Problems in the Age of Semi-Autonomous Driving
by: Hu, Hins, et al.
Published: (2025)
by: Hu, Hins, et al.
Published: (2025)
Ride-pool Assignment Algorithms: Modern Implementation and Swapping Heuristics
by: Zalesak, Matthew, et al.
Published: (2025)
by: Zalesak, Matthew, et al.
Published: (2025)
A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)
by: Gaul, Daniela, et al.
Published: (2023)
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)
by: Kelly, Tom, et al.
Published: (2018)
The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
by: Su, E, et al.
Published: (2025)
by: Su, E, et al.
Published: (2025)
How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)
by: Ibiapina, Allen, et al.
Published: (2025)
Benders decomposition for congested partial set covering location with uncertain demand
by: Calamita, Alice, et al.
Published: (2024)
by: Calamita, Alice, et al.
Published: (2024)
Complexity of the Virtual Network Embedding with uniform demands
by: Benhamiche, Amal, et al.
Published: (2025)
by: Benhamiche, Amal, et al.
Published: (2025)
Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)
by: Hu, Hins, et al.
Published: (2025)
The Phase Transition of Discrepancy in Random Hypergraphs
by: MacRury, Calum, et al.
Published: (2021)
by: MacRury, Calum, et al.
Published: (2021)
Maximal Cliques in Scale-Free Random Graphs
by: Bläsius, Thomas, et al.
Published: (2023)
by: Bläsius, Thomas, et al.
Published: (2023)
Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
by: Cömer, Can, et al.
Published: (2025)
by: Cömer, Can, et al.
Published: (2025)
Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
by: Ingels, Florian, et al.
Published: (2026)
by: Ingels, Florian, et al.
Published: (2026)
Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026)
by: Keita, Amadou, et al.
Published: (2026)
Adversarial Configurations for the ReCom Transition Function
by: Gold, Micah
Published: (2026)
by: Gold, Micah
Published: (2026)
Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
by: Gailhard, Dorian, et al.
Published: (2025)
by: Gailhard, Dorian, et al.
Published: (2025)
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
by: Kutner, David C., et al.
Published: (2025)
by: Kutner, David C., et al.
Published: (2025)
RDNF Oriented Analytics to Random Boolean Functions
by: Aslanyan, Levon, et al.
Published: (2024)
by: Aslanyan, Levon, et al.
Published: (2024)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)
by: Georgiou, Konstantinos, et al.
Published: (2024)
A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
by: Tu, Ziran, et al.
Published: (2024)
by: Tu, Ziran, et al.
Published: (2024)
Morse frames
by: Bertrand, Gilles, et al.
Published: (2024)
by: Bertrand, Gilles, et al.
Published: (2024)
Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)
by: Testa, Lucia, et al.
Published: (2024)
Optimal Delivery with a Faulty Drone
by: Coleman, Jared, et al.
Published: (2024)
by: Coleman, Jared, et al.
Published: (2024)
Interval Posets and Polygon Dissections
by: Bagno, Eli, et al.
Published: (2024)
by: Bagno, Eli, et al.
Published: (2024)
The ultrametric backbone is the union of all minimum spanning forests
by: Rozum, Jordan C, et al.
Published: (2024)
by: Rozum, Jordan C, et al.
Published: (2024)
On the Hardness of Gray Code Problems for Combinatorial Objects
by: Merino, Arturo, et al.
Published: (2024)
by: Merino, Arturo, et al.
Published: (2024)
Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)
by: Sawczuk, Hamilton, et al.
Published: (2024)
Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
Study on (r,s)- Generalised Transformation Graphs, A Novel Perspective Based on Transformation Graphs
by: Ali, Parvez, et al.
Published: (2024)
by: Ali, Parvez, et al.
Published: (2024)
Task scheduling for autonomous vehicles in the Martian environment
by: Burzyński, Wojciech, et al.
Published: (2024)
by: Burzyński, Wojciech, et al.
Published: (2024)
Growth Rate of the Number of Empty Triangles in the Plane
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
Complexity of Deciding the Equality of Matching Numbers
by: Gomes, Guilherme C. M., et al.
Published: (2024)
by: Gomes, Guilherme C. M., et al.
Published: (2024)
A sequential solution to the density classification task using an intermediate alphabet
by: Perrotin, Pacôme, et al.
Published: (2024)
by: Perrotin, Pacôme, et al.
Published: (2024)
Restricted Permutations Enumerated by Inversions
by: Franklín, Atli Fannar, et al.
Published: (2024)
by: Franklín, Atli Fannar, et al.
Published: (2024)
First-Fit Coloring of Forests in Random Arrival Model
by: Bosek, Bartłomiej, et al.
Published: (2024)
by: Bosek, Bartłomiej, et al.
Published: (2024)
Contribution to Blocker and Interdiction optimization problems in networks
by: Martin, Sébastien
Published: (2024)
by: Martin, Sébastien
Published: (2024)
Inflation of 2D boundary ghosts and digital watermarking
by: Svalbe, Imants, et al.
Published: (2024)
by: Svalbe, Imants, et al.
Published: (2024)
Broadcast Graph Is NP-complete
by: Xu, Jinghan, et al.
Published: (2024)
by: Xu, Jinghan, et al.
Published: (2024)
Similar Items
-
Vehicle Routing Problems in the Age of Semi-Autonomous Driving
by: Hu, Hins, et al.
Published: (2025) -
Ride-pool Assignment Algorithms: Modern Implementation and Swapping Heuristics
by: Zalesak, Matthew, et al.
Published: (2025) -
A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023) -
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018) -
The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
by: Su, E, et al.
Published: (2025)