Online dial-a-ride problems: Minimizing the completion time
From MaRDI portal
Recommendations
Cited in
(61)- Dynamic pickup and delivery problems
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
- Typology and literature review for dial-a-ride problems
- From theory to practice: maximizing revenues for on-line dial-a-ride
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
- Algorithms for on-line order batching in an order picking warehouse
- Two short notes on the on-line travelling salesman: handling times and lookahead.
- On-line dial-a-ride problems under a restricted information model
- Improved bounds for revenue maximization in time-limited online dial-a-ride
- The online food delivery problem on stars
- Tight competitive analyses of online car-sharing problems
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- The covering Canadian traveller problem
- Computational bounds for elevator control policies by large scale linear programming
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- How to whack moles
- Improved bounds for open online dial-a-ride on the line
- The online dial-a-ride problem under reasonable load
- Maximizing Revenues for On-Line Dial-a-Ride
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem
- Online traveling salesman problems with service flexibility
- The post-disaster debris clearance problem under incomplete information
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Online Vehicle Routing Problems: A Survey
- Discrete online TSP
- scientific article; zbMATH DE number 1947431 (Why is no real title available?)
- Competitive analysis of the online dial-a-ride problem
- New Bounds for Maximizing Revenue in Online Dial-a-Ride
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
- Fleet management for autonomous vehicles: online PDP under special constraints
- Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
- New policies for the dynamic traveling salesman problem
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
- Algorithmic Applications in Management
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- Car-sharing between two locations: online scheduling with flexible advance bookings
- Approximation and Online Algorithms
- Fleet management for autonomous vehicles using flows in time-expanded networks
- Euler is standing in line dial-a-ride problems with precedence-constraints
- On-line single-server dial-a-ride problems
- Algorithms for online car-sharing problem
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- Minimizing the maximum flow time in the online food delivery problem
- Tight analysis of the lazy algorithm for open online dial-a-ride
- An improved algorithm for open online dial-a-ride
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Tight analysis of the lazy algorithm for open online dial-a-ride
- Measuring and evaluating the multi-compartment vehicle routing problem in dynamic environment using two hybrid meta-heuristics approaches
- Picking operations in warehouses with dynamically arriving orders: how good is reoptimization?
- Traveling repairperson, unrelated machines, and other stories about average completion times
- Scheduling on identical machines with setup time and unknown execution time
- Algorithms for the on-line quota traveling salesman problem
- Online k-server routing problems
- A hard dial-a-ride problem that is easy on average
- The on-line asymmetric traveling salesman problem
- On the power of lookahead in on-line server routing problems
- The online prize-collecting traveling salesman problem
- Clever or smart: strategies for the online target date assignment problem
- New lower bounds for online k-server routing problems
This page was built for publication: Online dial-a-ride problems: Minimizing the completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728857)
