research-article

The car sharing problem

Authors:

Patrick Briest,

Christoph RaupachAuthors Info & Claims

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Pages 167 - 176

https://doi.org/10.1145/1989493.1989518

Published: 04 June 2011 Publication History

Abstract

We consider a novel type of metric task system, termed the car sharing problem, in which the operator of a car sharing program aims to serve the requests of customers occurring at different locations. Requests are modeled as a stochastic process with known parameters and a request is served if a car is located at the position of its occurrence at this time. Customers pay the service provider according to the distance they travel and similarly the service provider incurs cost proportional to the distance traveled when relocating a car from one position to another between requests.

We derive an efficient algorithm to compute a redistribution policy that yields average long-term revenue within a factor of 2 of optimal and provide a complementing proof of APX-hardness. Considering a variation of the problem in which requests occur simultaneously in all locations, we arrive at an interesting repeated balls-into-bins process, for which we prove bounds on the average number of occupied bins.

References

[1]

Y. Azar. On-line Load Balancing. Theoretical Computer Science, 1992.

[2]

F. Baskett, K. Chandy, R. Muntz, and F. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22, 1975.

Digital Library

[3]

G. Bolch, S. Greiner, H. Meer, and K. Trivedi. Queuing Networks and Markov Chains. John Wiley & Sons, 2006.

Digital Library

[4]

M. Englert, D. Özmen, and M. Westermann. The Power of Reordering for Online Minimum Makespan Scheduling. In Proc. of the 49th Symposium on Foundations of Computer Science (FOCS), 2008.

Digital Library

[5]

M. Gendreaub, G. Laportea, and R. Seguin. Stochastic Vehicle Routing. European Journal of Operational Research, 88(1), 1996.

[6]

W. Gordon and G. Newell. Closed Queuing Systems With Exponential Servers. Operations Research, 15, 1967.

[7]

E. Hazan, S. Safra, and O. Schwartz. On the Complexity of Approximating k-Set Packing. In Computational Complexity, 15, 2006.

Digital Library

[8]

J. Jackson. Jobshop-Like Queuing Systems. Management Science, 50, 2004.

Digital Library

[9]

E. Koutsoupias and C. Papadimitriou. On the k-Server Conjecture. Journal of the ACM, 42, 1995.

Digital Library

[10]

M. Manasse, L. McGeoch, and D. Sleator. Competitive Algorithms for Server Problems. Journal of Algorithms, 11(2), 1990.

Digital Library

[11]

M. Maxwell, M. Restrepo, S. Henderson, and H. Topaloglu. Approximate Dynamic Programming for Ambulance Redeployment. INFORMS Journal on Computing, 22(2), 2010.

Digital Library

[12]

Y. Peres, K. Talwar, and U. Wieder. The (1+β)-Choice Process and Weighted Balls-into-Bins. In Proc. of the 21st Symposium on Discrete Algorithms (SODA), 2010.

Digital Library

[13]

W. Powell. A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. Transportation Science, 30(3), 1996.

[14]

M. Raab and A. Steger. "Balls into Bins" - A Simple and Tight Analysis. In Proc. of the 2nd Workshop on Randomization and Approximation Techniques in Computer Science, 1998.

Digital Library

[15]

M. Reiser and S. Lavenberg. Mean Value Analysis of Closed Multichain Queuing Networks. Journal of the ACM, 27, 1980.

Digital Library

Cited By

Hamroun ALabadi KLazri MBarbot J(2023)A Petri Nets-Based Simulation Methodology for Modular Modeling and Performance Evaluation of Car-Sharing NetworksIEEE Transactions on Automation Science and Engineering10.1109/TASE.2022.318940520:3(1945-1961)Online publication date: Jul-2023
https://doi.org/10.1109/TASE.2022.3189405
Wang LJin YWang LMa WLi T(2019)Incentive-Based Approach to Control Demands for Operation of One-Way Carsharing SystemTransportation Research Record: Journal of the Transportation Research Board10.1177/03611981198374972673:4(427-438)Online publication date: 22-Mar-2019
https://doi.org/10.1177/0361198119837497
Di Febbraro ASacco NSaeednia M(2019)One-Way Car-Sharing Profit Maximization by Means of User-Based Vehicle RelocationIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2018.282411920:2(628-641)Online publication date: Feb-2019
https://doi.org/10.1109/TITS.2018.2824119
Show More Cited By

Index Terms

The car sharing problem
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Approximation Algorithms for Car-Sharing Problems
Computing and Combinatorics
Abstract
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegative, symmetric travel times that satisfy the triangle inequality. ...
On the complexity of the highway problem

In the highway problem, we are given a path, and a set of buyers interested in buying sub-paths of this path; each buyer declares a non-negative budget, which is the maximum amount of money she is willing to pay for that sub-path. The problem is to ...
Analysis of Networks of the Resource Queuing Systems

Consideration was given to the model of a queuing network with resource queuing systems--the multi-server systems with losses where servicing of the accepted customer occupies random volumes of resources with the given distribution function depending on ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

June 2011

404 pages

ISBN:9781450307437

DOI:10.1145/1989493

Co-chairs:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany
,
Rajmohan Rajaraman
Northeastern University, USA

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA '11

Sponsor:

SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures

June 4 - 6, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
575
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hamroun ALabadi KLazri MBarbot J(2023)A Petri Nets-Based Simulation Methodology for Modular Modeling and Performance Evaluation of Car-Sharing NetworksIEEE Transactions on Automation Science and Engineering10.1109/TASE.2022.318940520:3(1945-1961)Online publication date: Jul-2023
https://doi.org/10.1109/TASE.2022.3189405
Wang LJin YWang LMa WLi T(2019)Incentive-Based Approach to Control Demands for Operation of One-Way Carsharing SystemTransportation Research Record: Journal of the Transportation Research Board10.1177/03611981198374972673:4(427-438)Online publication date: 22-Mar-2019
https://doi.org/10.1177/0361198119837497
Di Febbraro ASacco NSaeednia M(2019)One-Way Car-Sharing Profit Maximization by Means of User-Based Vehicle RelocationIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2018.282411920:2(628-641)Online publication date: Feb-2019
https://doi.org/10.1109/TITS.2018.2824119
Bazan PDjanatliev APruckner MGerman RLauer CJohansson BJain S(2018)Rebalancing and fleet sizing of mobility-on-demand networks with combined simulation, optimization and queueing network analysisProceedings of the 2018 Winter Simulation Conference10.5555/3320516.3320704(1527-1538)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.5555/3320516.3320704
Dmitrienko APlappert CAhn GPretschner AGhinita G(2017)Secure Free-Floating Car Sharing for Offline CarsProceedings of the Seventh ACM on Conference on Data and Application Security and Privacy10.1145/3029806.3029807(349-360)Online publication date: 22-Mar-2017
https://dl.acm.org/doi/10.1145/3029806.3029807
Gavalas DKonstantopoulos CPantziou G(2016)Design and management of vehicle-sharing systems: a survey of algorithmic approachesSmart Cities and Homes10.1016/B978-0-12-803454-5.00013-4(261-289)Online publication date: 2016
https://doi.org/10.1016/B978-0-12-803454-5.00013-4
Di Febbraro ASacco NSaeednia M(2012)One-Way CarsharingTransportation Research Record: Journal of the Transportation Research Board10.3141/2319-132319:1(113-120)Online publication date: 1-Jan-2012
https://doi.org/10.3141/2319-13

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten