Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems

DOI10.1002/net.22062zbMath1528.90030OpenAlexW3167805577MaRDI QIDQ6065891

Jan Fabian Ehmke, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22062

zbMATH Keywords

anticipationdial-a-ride problemlarge neighborhood searchdynamic vehicle routingride-sharingstochastic requests

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• The team orienteering problem
• An approximate dynamic programming approach to attended home delivery management
• Typology and literature review for dial-a-ride problems
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Dynamic transportation of patients in hospitals
• An optimization approach to the ordering phase of an attended home delivery service
• Column generation for real-time ride-sharing operations
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Handbook of metaheuristics

This page was built for publication: Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems