Investigating the benefits of re-optimisation while searching for two immobile entities on a network

Arun Jotshi and Rajan Batta

International Journal of Mathematics in Operational Research, 2009, vol. 1, issue 1/2, 37-75

Abstract: 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 by Jotshi, A. and Batta, R. (2008) 'Search for an immobile entity on a network', European Journal of Operational Research, Vol. 192, pp.347-359 – 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.

Keywords: immobile entities; re-optimisation; search problems; undirected networks. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=22875 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:1:y:2009:i:1/2:p:37-75

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().