Search for an immobile entity on a network

Arun Jotshi and Rajan Batta

European Journal of Operational Research, 2008, vol. 191, issue 2, pages 347-359

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.

Downloads: (external link)
http://www.sciencedi ... fa2e8a08682d9dbc0637
Full text for ScienceDirect subscribers only

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

Access Statistics for this article

European Journal of Operational Research is edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Series data maintained by Heidi Boesdal ().