Exact and approximation algorithms for the expanding search problem

Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence of the vertices so as to minimize the expected time for finding the target, where the time for reaching the next vertex is determined by its distance to the region that was already searched. This problem has numerous applications, such as searching for hidden explosives, mining coal, and disaster relief. In this paper, we develop exact algorithms and heuristics, including a branch-and-cut procedure, a greedy algorithm with a constant-factor approximation guarantee, and a novel local search procedure based on a spanning tree neighborhood. Computational experiments show that our branch-and-cut procedure outperforms all existing methods for general instances and both heuristics compute near-optimal solutions with little computational effort.

[1]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[2]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[3]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[4]  Steve Alpern,et al.  Mining Coal or Finding Terrorists: The Expanding Search Paradigm , 2013, Oper. Res..

[5]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[6]  B. O. Koopman.  The Theory of Search. II. Target Detection , 1956 .

[7]  B. O. Koopman.  The Theory of Search , 1957 .

[8]  Songtao Li,et al.  Multiple searchers searching for a randomly distributed immobile target on a unit network , 2018, Networks.

[9]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[10]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[11]  Jane W.-S. Liu,et al.  Scheduling tasks with AND/OR precedence constraints , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[12]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[13]  Christoph Dürr,et al.  The Expanding Search Ratio of a Graph , 2016, STACS.

[14]  J. Pereira,et al.  The flowtime network construction problem , 2012 .

[15]  Piotr Indyk,et al.  A Nearly-Linear Time Framework for Graph-Structured Sparsity , 2015, ICML.

[16]  Steve Alpern,et al.  Approximate solutions for expanding search games on general networks , 2019, Ann. Oper. Res..

[17]  Igor Averbakh,et al.  Emergency path restoration problems , 2012, Discret. Optim..

[18]  D. T. Lee,et al.  The density maximization problem in graphs , 2011, Journal of Combinatorial Optimization.

[19]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[20]  K E Trummel,et al.  Technical Note - The Complexity of the Optimal Searcher Path Problem , 1986, Oper. Res..

[21]  David P. Williamson,et al.  A Faster, Better Approximation Algorithm for the Minimum Latency Problem , 2008, SIAM J. Comput..

[22]  B. O. Koopman.  The Theory of Search. I. Kinematic Bases , 1956 .

[23]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[24]  László Lovász,et al.  Approximating Min Sum Set Cover , 2004, Algorithmica.

[25]  Hoong Chuin Lau,et al.  Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics , 2006, Discret. Optim..

[26]  Giorgio Ausiello,et al.  On Salesmen, Repairmen, Spiders, and Other Traveling Agents , 2000, CIAC.

[27]  Feng Qiu,et al.  Scheduling Post-Disaster Repairs in Electricity Distribution Networks , 2017, IEEE Transactions on Power Systems.

[28]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[29]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[30]  Lisa Hellerstein,et al.  Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games , 2019, Oper. Res..

[31]  Robbert Fokkink,et al.  On Submodular Search and Machine Scheduling , 2016, Math. Oper. Res..

[32]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[33]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.