Abstract
We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possible. We refer to this problem as the Prize-Collecting Traveling Salesman Problem with time windows (TW-TSP).
We consider two versions of TW-TSP. In the first version, jobs are located on a line, have release times and deadlines but no processing times. A geometric interpretation of the problem is used that generalizes the Erdős-Szekeres Theorem. We present an O(log n) approximation algorithm for this case, where n denotes the number of jobs. This algorithm can be extended to deal with non-unit job profits.
The second version deals with a general case of asymmetric distances between locations. We define a density parameter that, loosely speaking, bounds the number of zig-zags between locations within a time window. We present a dynamic programming algorithm that finds a tour that visits at least OPT/density locations during their time windows. This algorithm can be extended to deal with non-unit job profits and processing times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Augustine, J., Seiden, S.S.: Linear Time Approximation Schemes for Vehicle Scheduling. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 30–39. Springer, Heidelberg (2002)
de Berg, M., van Kreveld, M., Overmars, M., Schwartzkopf, O.: Computational Geometry – Algorithms and Applications. Springer, Heidelberg (2000)
Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463–470 (1935)
Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math. 11, 29–35 (1975)
Karuno, Y., Nagamochi, H., Ibaraki, T.: A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. Technical Report 98007 (1998)
Karuno, Y., Nagamochi, H.: A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 218–229. Springer, Heidelberg (2001)
Tsitsiklis, J.N.: Special Cases of Traveling Salesman and Repairman Problems with Time Windows. Networks 22, 263–282 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Yehuda, R., Even, G., Shahar, S.(. (2003). On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive