Skip to main content Accessibility help
×
Home

Balancing the stations of a self service “bike hire” system

  • Mike Benchimol (a1), Pascal Benchimol (a2), Benoît Chappert (a1), Arnaud de la Taille (a1), Fabien Laroche (a2), Frédéric Meunier (a1) and Ludovic Robinet (a1)...

Abstract

This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that $\sum_{v\in V}x_v=\sum_{v\in V}y_v$ and all quantities are assumed to be integers); given a vehicle of capacity C, find a minimal route that balances all vertices, that is, that allows to have an amount yv of the commodity on each vertex v. This paper presents among other things complexity results, lower bounds, approximation algorithms, and a polynomial algorithm when G is a tree.

Copyright

References

Hide All
[1] S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Nav. Res. Logist. (1997).
[2] Anily, S. and Hassin, R., The swapping problem. Networks 22 (1992) 419433.
[3] Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A. and Naddef, D., Seprating capacity constraints in the CRVP using tabu search. Eur. J. Oper. Res. 106 (1998) 546557.
[4] Chalasani, P. and Motwani, R., Approximating capacited routing and delivery problem. SIAM J. Comput. 28 (1999) 21332149.
[5] Charikar, M., Khuller, S. and Raghavachari, B., Algorithms for capacitated vehicle routing. SIAM J. Comput. 31 (2001) 665682.
[6] N. Christofides, Worst-case analysis for a new heuristic for the Traveling Salesman problem, in Symposium on New Directions and Recent Results in Algorithms and Complexity, edited by J.F. Traub, Academic Press (1976).
[7] M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-completness. W.H. Freeman (1979).
[8] H. Hernández-Pérz and J.-J. Salazar-González, The one-commodity pickup-and-delivery travelling salesman problem, in Lect. Notes Comput. Sci. 2570 (2002) 89–104.
[9] Hernández-Pérz, H. and Salazar-González, J.-J., A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discr. Appl. Math. 145 (2004) 126139.
[10] Hoogeveen, J.A., Analysis of christofides'heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10 (1991) 291295.
[11] König, D., Uber Graphen und ihre Anwendung auf Determinantentheorie une Mengenlehre. Math. Ann. 77 (1916) 453465.
[12] A. Lim, F. Wang and Z. Xu, The capacitated traveling salesman problem with pickups and deliveries on a tree, in Lect. Notes Comput. Sci. Algorithms and Computation. Springer Berlin/Heidelberg 3827 (2005) 1061–1070.

Keywords

Balancing the stations of a self service “bike hire” system

  • Mike Benchimol (a1), Pascal Benchimol (a2), Benoît Chappert (a1), Arnaud de la Taille (a1), Fabien Laroche (a2), Frédéric Meunier (a1) and Ludovic Robinet (a1)...

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed