Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems

Thumbnail Image
Files
Dell_Scan-Article-Using_Multiple_Searchers.pdf (2.3 MB)
Authors
Dell, Robert F.
Eagle, James N.
Martins, Gustavo Henrique Alves
Santos, Almir Garnier
Subjects
Advisors
Date of Issue
1996
Date
1996
Publisher
Language
Abstract
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive...
Type
Article
Description
Naval Research Logistics, 43, 1996, pp. 463-480.
URI
https://hdl.handle.net/10945/38187
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Dell, R.F., Eagle, J.N., Martins, G.H.A., and Santos, A.G., â Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems,â Naval Research Logistics, 43, 1996, pp. 463-480.
Distribution Statement
Rights
defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications