Abstract
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs \(\{(s_i,t_i)\}^m_{i=1}\), where each object requires to be moved from its source to destination vertex. In the multi-vehicle Dial-a-Ride problem, there are q vehicles each having capacity k and where each vehicle j ∈ [q] has its own depot-vertex r j ∈ V. A feasible schedule consists of a capacitated route for each vehicle (where vehicle j originates and ends at its depot r j ) that together move all objects from their sources to destinations. The objective is to find a feasible schedule that minimizes the maximum completion time (i.e. makespan) of vehicles, where the completion time of vehicle j is the time when it returns to its depot r j at the end of its route. We consider the preemptive version of multi-vehicle Dial-a-Ride, where an object may be left at intermediate vertices and transported by more than one vehicle, while being moved from source to destination. Approximation algorithms for the single vehicle Dial-a-Ride problem (q = 1) have been considered in [3,10].
Our main results are an O(log3 n)-approximation algorithm for preemptive multi-vehicle Dial-a-Ride, and an improved O(logt)-approximation for its special case when there is no capacity constraint (here t ≤ n is the number of distinct depot-vertices). There is an Ω(log1/4 n) hardness of approximation known [9] even for single vehicle capacitated preemptive Dial-a-Ride. We also obtain an improved constant factor approximation algorithm for the uncapacitated multi-vehicle problem on metrics induced by graphs excluding any fixed minor.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM 41, 153–180 (1994)
Chao, I.-M.: A tabu search method for the truck and trailer routing problem. Computer & Operations Research 29, 469–488 (2002)
Charikar, M., Raghavachari, B.: The Finite Capacity Dial-A-Ride Problem. In: FOCS, pp. 458–467 (1998)
Cordeau, J.-F., Laporte, G.: The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research 1(2) (2003)
de Paepe, W.E., Lenstra, J.K., Sgall, J., Sitters, R.A., Stougie, L.: Computer-Aided Complexity Classification of Dial-a-Ride Problems. Informs J. Comp. 16(2), 120–132 (2004)
Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A.: Covering Graphs Using Trees and Stars. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 24–35. Springer, Heidelberg (2003)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC, pp. 448–455 (2003)
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178–193 (1978)
Gørtz, I.L.: Hardness of Preemptive Finite Capacity Dial-a-Ride. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 200–211. Springer, Heidelberg (2006)
Gupta, A., Hajiaghayi, M., Nagarajan, V., Ravi, R.: Dial a Ride from k-forest. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 241–252. Springer, Heidelberg (2007)
Haimovich, M., Kan, A.H.G.R.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10, 527–542 (1985)
Hochbaum, D., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J. ACM 32, 130–136 (1985)
Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning and shortest path trees. In: SODA, pp. 243–250 (1993)
Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: STOC, pp. 682–690 (1993)
Mitrović-Minić, S., Laporte, G.: The Pickup and Delivery Problem with Time Windows and Transshipment. INFOR Inf. Syst. Oper. Res. 44, 217–227 (2006)
Mues, C., Pickl, S.: Transshipment and time windows in vehicle routing. In: 8th Int. Symp. on Parallel Architectures, Algorithms and Networks, pp. 113–119 (2005)
Nakao, Y., Nagamochi, H.: Worst case analysis for pickup and delivery problems with transfer. IEICE Trans. on Fund. of Electronics, Comm. and Computer Sci. E91-A(9) (2008)
Savelsbergh, M., Sol, M.: The general pickup and delivery problem. Transportation Science 29, 17–29 (1995)
Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Computer & Operations Research 33, 894–909 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gørtz, I.L., Nagarajan, V., Ravi, R. (2009). Minimum Makespan Multi-vehicle Dial-a-Ride. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)