scientific article

Norbert Ascheuer, Sven O. Krumke, Jörg Rambau

Publication date: 6 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

transportation combinatorial optimization metric space server competitive algorithms online dial-a-ride problem transportation schedule

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (43)

New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Algorithms for the on-line quota traveling salesman problem ⋮ Optimal deterministic algorithms for some variants of online quota traveling salesman problem ⋮ Online \(k\)-server routing problems ⋮ The Post-Disaster Debris Clearance Problem Under Incomplete Information ⋮ A hard dial-a-ride problem that is easy on average ⋮ Algorithms for online car-sharing problem ⋮ The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail ⋮ 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 ⋮ Improved bounds for open online dial-a-ride on the line ⋮ The covering Canadian traveller problem ⋮ Computational bounds for elevator control policies by large scale linear programming ⋮ The on-line asymmetric traveling salesman problem ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ Car-sharing between two locations: online scheduling with flexible advance bookings ⋮ Improved bounds for revenue maximization in time-limited online dial-a-ride ⋮ Competitive analysis of a dispatch policy for a dynamic multi-period routing problem ⋮ 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 ⋮ The online prize-collecting traveling salesman problem ⋮ Algorithms for on-line order batching in an order picking warehouse ⋮ New policies for the dynamic traveling salesman problem ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones ⋮ 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 ⋮ Fleet management for autonomous vehicles using flows in time-expanded networks ⋮ Discrete online TSP ⋮ Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ⋮ Online traveling salesman problems with service flexibility ⋮ Dynamic pickup and delivery problems ⋮ Fleet management for autonomous vehicles: Online PDP under special constraints ⋮ The online food delivery problem on stars ⋮ Tight competitive analyses of online car-sharing problems ⋮ Two short notes on the on-line travelling salesman: handling times and lookahead.

This page was built for publication: