Investigating the benefits of re-optimisation while searching for two immobile entities on a network Online publication date: Sat, 31-Jan-2009
by Arun Jotshi, Rajan Batta
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 1/2, 2009
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com