Adaptive forecast-driven repositioning for dynamic ride-sharing
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Cites work
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- Customizable contraction hierarchies
- Look-ahead strategies for dynamic pickup and delivery problems
- Predicting citywide crowd flows using deep spatio-temporal residual networks
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- The dial-a-ride problem: Models and algorithms
- Value function approximation for dynamic multi-period vehicle routing
This page was built for publication: Adaptive forecast-driven repositioning for dynamic ride-sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949441)