Revenue maximization in online dial-a-ride

DOI10.4230/OASICS.ATMOS.2017.1MaRDI QIDQ6571013zbMATH OpenFDO

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

Publication date 11 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2017.1

zbMATH Keywords

competitive analysisdial-a-ridemetric spaceonline algorithmsvehicle routing

Mathematics Subject Classification ID

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

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

Cited in

(5)

• New Bounds for Maximizing Revenue in Online Dial-a-Ride
• Revenue maximization in transportation networks
• Maximizing the number of rides served for dial-a-ride
• Earliest deadline first is a 2-approximation for DARP with time windows
• Maximizing rides served for dial-a-ride on the uniform metric

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)