Investigating the benefits of re-optimisation while searching for two immobile entities on a network
Summary: We consider the problem of searching for two immobile entities on an undirected network where the entity locations are probabilistically known and dependent. This article extends the work of \textit{A. Jotshi} and \textit{R. Batta} [Eur. J. Oper. Res. 191, No.~2, 347--359 (2008; Zbl 1149.90026)] on the search for a single entity. The problem is first examined for the case where re-optimisation is not allowed, i.e., we are not allowed to change the path once we have started traversing it. In the second case, re-optimisation is allowed after the discovery of the first entity. For both cases, the objective is to minimise the expected search time to find both entities. Heuristic algorithms are introduced and computational results are presented showing the benefits of allowing re-optimisation.
- Search for an immobile entity on a network
- Multiple searchers searching for a randomly distributed immobile target on a unit network
- Optimal search for a moving target with no time information maximizing the expected reward
- scientific article; zbMATH DE number 1750452
- Using multiple searchers in constrained-path, moving-target search problems
This page was built for publication: Investigating the benefits of re-optimisation while searching for two immobile entities on a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843390)
