An exactly optimal strategy for a search problem with traveling cost

An exactly optimal strategy for a search problem with traveling cost

0.00 Avg rating0 Votes
Article ID: iaor19921736
Country: Japan
Volume: 34
Issue: 4
Start Page Number: 436
End Page Number: 448
Publication Date: Dec 1991
Journal: Journal of the Operations Research Society of Japan
Authors:
Keywords: graphs
Abstract:

There are n neighboring cells in a straight line. An object is in one of the cells. It is required to determine a strategy that will minimize the expected cost of finding the object. A probability of overlooking the object is equal to zero, when the right cell is searched. Associated with the examination are a traveling cost dependent on the distance from the last cell examined and a fixed examination cost. A procedure for finding an exactly optimal strategy is given.

Reviews

Required fields are marked *. Your email address will not be published.