On the online min-wait relocation problem

DOI10.1016/J.ENDM.2015.07.047MaRDI QIDQ324815zbMATH OpenOpenAlexFDO

Authors Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.047

zbMATH Keywords

competitive ratiomax/max ratiorelocation problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Recommendations

• A Fast Greedy Algorithm for the Relocation Problem
• Car-sharing between two locations: online scheduling with two servers
• Car-sharing problem: online scheduling with flexible advance bookings
• Online scheduling of car-sharing request pairs between two locations
• Car-sharing between two locations: online scheduling with flexible advance bookings

Cites work

• A new measure for the study of on-line algorithms
• Bike sharing systems: solving the static rebalancing problem
• Inventory rebalancing and vehicle routing in bike sharing systems
• On randomization in on-line computation.
• Online algorithms. The state of the art

Cited in

(6)

• An adaptive large neighborhood search for relocating vehicles in electric carsharing services
• Carrying umbrellas: An online relocation game on a graph
• scientific article; zbMATH DE number 1522930 (Why is no real title available?)
• Maximizing rides served for dial-a-ride on the uniform metric
• A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system

This page was built for publication: On the online min-wait relocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324815)