Pages that link to "Item:Q5129204"
From MaRDI portal
The following pages link to Empty-Car Routing in Ridesharing Systems (Q5129204):
Displaying 15 items.
- Stochastic ridesharing user equilibrium in transport networks (Q2005886) (← links)
- Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice (Q2031092) (← links)
- Double-ended queues with non-Poisson inputs and their effective algorithms (Q2147076) (← links)
- Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles (Q2178143) (← links)
- Optimizing large on-demand transportation systems through stochastic conic programming (Q2239886) (← links)
- The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path (Q2459390) (← links)
- On the Optimal Design of a Bipartite Matching Queueing System (Q5031017) (← links)
- A Probabilistic Approach to Growth Networks (Q5060510) (← links)
- Spatial Capacity Planning (Q5080677) (← links)
- Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework (Q5095174) (← links)
- Dynamic Matching for Real-Time Ride Sharing (Q5119412) (← links)
- Graph-Based Equilibrium Metrics for Dynamic Supply–Demand Systems With Applications to Ride-sourcing Platforms (Q5881955) (← links)
- A new <scp>ride‐sharing</scp> model incorporating the passengers' efforts (Q6076477) (← links)
- Applications of fluid models in service operations management (Q6163558) (← links)
- Matched queues with matching batch pair \((m, n)\) (Q6572459) (← links)
