From theory to practice: maximizing revenues for on-line dial-a-ride

DOI10.1007/s10878-017-0188-zzbMath1393.90125OpenAlexW2766110821MaRDI QIDQ1702834

Aayam Poudel, William Forcier, Ananya D. Christman

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0188-z

zbMATH Keywords

competitive analysisonline algorithmsgraphsdial-a-ride

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Online car-sharing problem with variable booking times ⋮ Car-sharing between two locations: online scheduling with flexible advance bookings ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ⋮ Tight competitive analyses of online car-sharing problems

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Online vehicle routing and scheduling with dynamic travel times
• The online prize-collecting traveling salesman problem
• Routing a vehicle of capacity greater than one
• A dynamic vehicle routing problem with multiple delivery routes
• A tabu search heuristic for the dynamic transportation of patients between care units
• The covering Canadian traveller problem
• The minimum latency problem
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Maximizing Revenues for On-Line Dial-a-Ride
• Online traveling salesman problems with service flexibility
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online Vehicle Routing Problems: A Survey
• Feasibility Testing for Dial-a-Ride Problems
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems

This page was built for publication: From theory to practice: maximizing revenues for on-line dial-a-ride