On the public citation graph

A Decentralized Optimization Framework for Scalable, Flexible, and Robust Dynamic Ridesharing

https://doi.org/10.2139/ssrn.6149633
0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-19212-9_31openalex-snapshot
Column Generation for Real-Time Ride-Sharing Operations
inferredcites →https://doi.org/10.1007/s11116-006-9101-9openalex-snapshot
The ambivalence of ridesharing
inferredcites →https://doi.org/10.1007/s11222-007-9033-zopenalex-snapshot
A tutorial on spectral clustering
inferredcites →https://doi.org/10.1007/s11590-020-01698-6openalex-snapshot
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
inferredcites →https://doi.org/10.1016/b978-012722442-8/50060-4openalex-snapshot
Supporting Frequent Updates in R-Trees
inferredcites →https://doi.org/10.1016/j.ejor.2005.02.038openalex-snapshot
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
inferredcites →https://doi.org/10.1016/j.ejor.2006.02.051openalex-snapshot
Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
inferredcites →https://doi.org/10.1016/j.ejor.2012.05.028openalex-snapshot
Optimization for dynamic ride-sharing: A review
inferredcites →https://doi.org/10.1016/j.eswa.2015.04.060openalex-snapshot
Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive
inferredcites →https://doi.org/10.1016/j.parco.2003.12.001openalex-snapshot
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
inferredcites →https://doi.org/10.1016/j.trb.2011.05.017openalex-snapshot
Dynamic ride-sharing: A simulation study in metro Atlanta
inferredcites →https://doi.org/10.1016/j.trb.2014.09.011openalex-snapshot
The shared-taxi problem: Formulation and solution methods
inferredcites →https://doi.org/10.1016/j.trc.2015.07.016openalex-snapshot
Agent based model for dynamic ridesharing
inferredcites →https://doi.org/10.1016/j.trc.2019.01.019openalex-snapshot
Real-time city-scale ridesharing via linear assignment problems
inferredcites →https://doi.org/10.1016/j.trc.2022.103658openalex-snapshot
A scalable vehicle assignment and routing strategy for real-time on-demand ridesharing considering endogenous congestion
inferredcites →https://doi.org/10.1016/j.tre.2017.10.009openalex-snapshot
Novel dynamic formulations for real-time ride-sharing systems
inferredcites →https://doi.org/10.1016/j.trpro.2016.12.087openalex-snapshot
A Matching Algorithm for Dynamic Ridesharing
inferredcites →https://doi.org/10.1016/s0305-0548(97)00030-0openalex-snapshot
Optimizing tabu list size for the traveling salesman problem
inferredcites →https://doi.org/10.1057/jors.1969.75openalex-snapshot
An Algorithm for the Vehicle-dispatching Problem
inferredcites →https://doi.org/10.1080/01441647.2011.621557openalex-snapshot
Ridesharing in North America: Past, Present, and Future
inferredcites →https://doi.org/10.1080/03052159808941240openalex-snapshot
INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING
inferredcites →https://doi.org/10.1080/088395196118669openalex-snapshot
Cooperative transportation scheduling: An application domain for dai
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/bigdata.2015.7363837openalex-snapshot
A scalable approach for data-driven taxi ride-sharing simulation
inferredcites →https://doi.org/10.1109/iat.2003.1241043openalex-snapshot
A distributed agent approach to global transportation scheduling
inferredcites →https://doi.org/10.1109/jproc.2011.2158181openalex-snapshot
Dynamic Vehicle Routing for Robotic Systems
inferredcites →https://doi.org/10.1109/tkde.2014.2334313openalex-snapshot
Real-Time City-Scale Taxi Ridesharing
inferredcites →https://doi.org/10.1111/mice.12157openalex-snapshot
Dynamic Shared‐Taxi Dispatch Algorithm with Hybrid‐Simulated Annealing
inferredcites →https://doi.org/10.1145/2508028.2505987openalex-snapshot
Decomposing combinatorial auctions and set packing problems
inferredcites →https://doi.org/10.1145/2876480.2876483openalex-snapshot
Dynamic ridesharing
inferredcites →https://doi.org/10.1145/3183344openalex-snapshot
Spatio-Temporal Matching for Urban Transportation Applications
inferredcites →https://doi.org/10.1145/602259.602266openalex-snapshot
R-trees
inferredcites →https://doi.org/10.1145/98524.98564openalex-snapshot
K-d trees for semidynamic point sets
inferredcites →https://doi.org/10.1177/0361198118788462openalex-snapshot
Is There a Limit to Adoption of Dynamic Ridesharing Systems? Evidence from Analysis of Uber Demand Data from New York City
inferredcites →https://doi.org/10.1186/s12544-024-00644-2openalex-snapshot
Shared autonomous vehicles and agent based models: a review of methods and impacts
inferredcites →https://doi.org/10.1287/ijoc.1110.0454openalex-snapshot
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
inferredcites →https://doi.org/10.1287/opre.1060.0283openalex-snapshot
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/trsc.1100.0336openalex-snapshot
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
inferredcites →https://doi.org/10.5038/2375-0901.10.4.6openalex-snapshot
Casual Carpooling-Enhanced
inferredcites →https://doi.org/10.65109/mzxa2058openalex-snapshot
Online Decentralised Mechanisms for Dynamic Ridesharing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.