Bibliographic Details
| Title: |
Search for an immobile entity on a network |
| Authors: |
Jotshi, Arun1 arun.jotshi@att.com, Batta, Rajan2 batta@eng.buffalo.edu |
| Source: |
European Journal of Operational Research. Dec2008, Vol. 191 Issue 2, p347-359. 13p. |
| Subjects: |
Heuristic, Famous problems in probabilities, Algorithms, Probability theory, Operations research |
| Abstract: |
We consider the problem of searching for a single, uniformly distributed immobile entity on an undirected network. This problem differs from edge-covering problems, e.g., the Chinese Postman Problem (CPP), since the objective here is not to find the minimum length tour that covers all the edges at least once, but instead to minimize the expected time to find the entity. We introduce a heuristic algorithm to deal with the search process given that the entity is equally likely to be at any point on the network. Computational results are presented. [Copyright &y& Elsevier] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
