Abstract
The input to the stochastic orienteering problem (Gupta et al. in SODA, pp 1522–1538, 2012) consists of a budget B and metric (V, d) where each vertex \(v\in V\) has a job with a deterministic reward and a random processing time (drawn from a known distribution). The processing times are independent across vertices. The goal is to obtain a non-anticipatory policy (originating from a given root vertex) to run jobs at different vertices, that maximizes expected reward, subject to the total distance traveled plus processing times being at most B. An adaptive policy can choose the next vertex to visit based on observed random instantiations. Whereas, a non-adaptive policy is just given by a fixed ordering of vertices. The adaptivity gap is the worst-case ratio of the optimal adaptive and non-adaptive rewards. We prove an \(\varOmega \left[ (\log \log B)^{1/2}\right] \) lower bound on the adaptivity gap of stochastic orienteering. This provides a negative answer to the O(1)-adaptivity gap conjectured by Gupta et al. (2012), and comes close to the \(O(\log \log B)\) upper bound. This result holds even on a line metric. We also show an \(O(\log \log B)\) upper bound on the adaptivity gap for the correlated stochastic orienteering problem, where the reward of each job is random and possibly correlated to its processing time. Using this, we obtain an improved quasi-polynomial time \( \min \{\log n,\log B\}\cdot \tilde{O}(\log ^2\log B)\)-approximation algorithm for correlated stochastic orienteering.
Similar content being viewed by others
Notes
A quasi-polynomial time algorithm runs in \(2^{\log ^c N}\) time on inputs of size N, where c is some fixed constant.
References
Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: STOC, pp. 166–174 (2004)
Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When LP is the cure for your matching woes: improved bounds for stochastic matchings. Algorithmica 63(4), 733–762 (2012)
Bansal, N., Nagarajan, V.: On the adaptivity gap of stochastic orienteering. CoRR abs/1311.3623 (2013)
Bhalgat, A.: A \((2+\epsilon )\)-approximation algorithm for the stochastic knapsack problem (2011). Unpublished manuscript
Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: SODA, pp. 1647–1665 (2011)
Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37(2), 653–670 (2007)
Chekuri, C., Korula, N., Pál, M.: Improved algorithms for orienteering and related problems. ACM TALG 8(3) (2012)
Chen, N., Immorlica, N., Karlin, A.R., Mahdian, M., Rudra, A.: Approximating matches made in heaven. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 266–278 (2009)
Dean, B.C., Goemans, M.X., Vondrák, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945–964 (2008)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630–652 (2007)
Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. 34(3), 307–318 (1987)
Guha, S., Munagala, K.: Multi-armed bandits with metric switching costs. In: ICALP, pp. 496–507 (2009)
Gupta, A., Krishnaswamy, R., Molinaro, M., Ravi, R.: Approximation algorithms for correlated knapsacks and non-martingale bandits. In: FOCS, pp. 827–836 (2011)
Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Approximation algorithms for stochastic orienteering. In: SODA, pp. 1522–1538 (2012)
Ma, W.: Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms. In: SODA (2014)
Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. In: FOCS, pp. 495–504 (1991)
Tong, Z.: Data dependent concentration bounds for sequential prediction algorithms. In: COLT, pp. 173–187 (2005)
Vansteenwegena, P., Souffriaua, W., Oudheusdena, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)
Weyland, D.: Stochastic vehicle routing—from theory to practice. Ph.D. thesis, University of Lugano, Switzerland (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
N. Bansal’s research was supported by the NWO Grant 639.022.211 and ERC consolidator Grant 617951.
Rights and permissions
About this article
Cite this article
Bansal, N., Nagarajan, V. On the adaptivity gap of stochastic orienteering. Math. Program. 154, 145–172 (2015). https://doi.org/10.1007/s10107-015-0927-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-015-0927-9