Computer Science > Data Structures and Algorithms
[Submitted on 23 Jun 2020]
Title:The Bike Sharing Problem
View PDFAbstract:Assume that $m \geq 1$ autonomous mobile agents and $0 \leq b \leq m$ single-agent transportation devices (called {\em bikes}) are initially placed at the left endpoint $0$ of the unit interval $[0,1]$. The agents are identical in capability and can move at speed one. The bikes cannot move on their own, but any agent riding bike $i$ can move at speed $v_i > 1$. An agent may ride at most one bike at a time. The agents can cooperate by sharing the bikes; an agent can ride a bike for a time, then drop it to be used by another agent, and possibly switch to a different bike.
We study two problems. In the \BS problem, we require all agents and bikes starting at the left endpoint of the interval to reach the end of the interval as soon as possible. In the \RBS problem, we aim to minimize the arrival time of the agents; the bikes can be used to increase the average speed of the agents, but are not required to reach the end of the interval.
Our main result is the construction of a polynomial time algorithm for the \BS problem that creates an arrival-time optimal schedule for travellers and bikes to travel across the interval. For the \RBS problem, we give an algorithm that gives an optimal solution for the case when at most one of the bikes can be abandoned.
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.