Investigating the benefits of re-optimisation while searching for two immobile entities on a network (Q843390): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1504/ijmor.2009.022875 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2110992643 / rank | |||
Normal rank |
Latest revision as of 09:40, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Investigating the benefits of re-optimisation while searching for two immobile entities on a network |
scientific article |
Statements
Investigating the benefits of re-optimisation while searching for two immobile entities on a network (English)
0 references
12 October 2009
0 references
Summary: 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 of \textit{A. Jotshi} and \textit{R. Batta} [Eur. J. Oper. Res. 191, No.~2, 347--359 (2008; Zbl 1149.90026)] on the 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.
0 references
immobile entities
0 references
re-optimisation
0 references
search problems
0 references
undirected network
0 references