On-line single-server dial-a-ride problems
From MaRDI portal
Publication:5958715
DOI10.1016/S0304-3975(00)00261-9zbMath0984.68003OpenAlexW2098465634MaRDI QIDQ5958715
Leen Stougie, Esteban Feuerstein
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00261-9
Related Items
New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Algorithms for the on-line quota traveling salesman problem ⋮ Online \(k\)-server routing problems ⋮ On multi-threaded metrical task systems ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ Online pickup and delivery problem with constrained capacity to minimize latency ⋮ The Post-Disaster Debris Clearance Problem Under Incomplete Information ⋮ On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis ⋮ A hard dial-a-ride problem that is easy on average ⋮ Algorithms for online car-sharing problem ⋮ News from the online traveling repairman. ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ Typology and literature review for dial-a-ride problems ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Improved bounds for open online dial-a-ride on the line ⋮ The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments ⋮ The on-line asymmetric traveling salesman problem ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Online Vehicle Routing Problems: A Survey ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ On the power of lookahead in on-line server routing problems ⋮ Improving LTL truck load utilization on line ⋮ Algorithms for on-line order batching in an order picking warehouse ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models ⋮ New lower bounds for online \(k\)-server routing problems ⋮ Unnamed Item ⋮ How to whack moles ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems ⋮ Pricing and allocation algorithm designs in dynamic ridesharing system ⋮ A new formulation for the traveling deliveryman problem ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Online traveling salesman problems with service flexibility ⋮ Dynamic pickup and delivery problems ⋮ The online food delivery problem on stars
Uses Software
Cites Work
- Unnamed Item
- Searching in the plane
- Routing a vehicle of capacity greater than one
- The minimum latency problem
- Computer-Aided Complexity Classification of Dial-a-Ride Problems
- Nonpreemptive Ensemble Motion Planning on a Tree
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Preemptive Ensemble Motion Planning on a Tree
- The General Pickup and Delivery Problem
- Scheduling Parallel Machines On-Line
- Scheduling jobs that arrive over time
- Algorithms for the on-line travelling salesman
