Revenue maximization in online dial-a-ride

DOI10.4230/OASICS.ATMOS.2017.1zbMATH Open1547.90024MaRDI QIDQ6571013FDOQ6571013

Authors: Ananya D. Christman, Christine Chung, Nicholas Jaczko, Marina Milan, Anna Vasilchenko, Scott Westvold 

Publication date: 11 July 2024

Recommendations

• From theory to practice: maximizing revenues for on-line dial-a-ride
• Maximizing Revenues for On-Line Dial-a-Ride
• Improved bounds for revenue maximization in time-limited online dial-a-ride
• New Bounds for Maximizing Revenue in Online Dial-a-Ride
• Maximizing the number of rides served for dial-a-ride

zbMATH Keywords

online algorithmscompetitive analysismetric spacevehicle routingdial-a-ride

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cited In (3)

• Maximizing the number of rides served for dial-a-ride
• Earliest deadline first is a 2-approximation for DARP with time windows
• Revenue maximization in transportation networks

This page was built for publication: Revenue maximization in online dial-a-ride

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571013)