Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ejor.2007.08.032 | European Journal of Operational Research |
Keywords | Field | DocType |
Search problems,Chinese Postman problem,Immobile entity | Mathematical optimization,Route inspection problem,Heuristic (computer science),Search problem,Mathematics | Journal |
Volume | Issue | ISSN |
191 | 2 | 0377-2217 |
Citations | PageRank | References |
11 | 0.93 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arun Jotshi | 1 | 13 | 2.05 |
| Rajan Batta | 2 | 849 | 89.39 |