Planning a multi-sensors search for a moving target considering traveling costs
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2020.11.012
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- James M. Dobbie, 1968. "A Survey of Search Theory," Operations Research, INFORMS, vol. 16(3), pages 525-537, June.
- Garrec, Tristan & Scarsini, Marco, 2020. "Search for an immobile hider on a stochastic network," European Journal of Operational Research, Elsevier, vol. 283(2), pages 783-794.
- Bourque, François-Alex, 2019. "Solving the moving target search problem using indistinguishable searchers," European Journal of Operational Research, Elsevier, vol. 275(1), pages 45-52.
- Jacques de Guenin, 1961. "Optimum Distribution of Effort: An Extension of the Koopman Basic Theory," Operations Research, INFORMS, vol. 9(1), pages 1-7, February.
- M. Bellmore & G. L. Nemhauser, 1968. "The Traveling Salesman Problem: A Survey," Operations Research, INFORMS, vol. 16(3), pages 538-558, June.
- Lawrence D. Stone, 1979. "Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 431-440, November.
- Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
- Scott Shorey Brown, 1980. "Optimal Search for a Moving Target in Discrete Time and Space," Operations Research, INFORMS, vol. 28(6), pages 1275-1289, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022.
"A competitive search game with a moving target,"
European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
- Benoit Duvocelle & J'anos Flesch & Mathias Staudigl & Dries Vermeulen, 2020. "A competitive search game with a moving target," Papers 2008.12032, arXiv.org.
- Frédéric Dambreville & Jean‐Pierre Le Cadre, 2007. "Constrained minimax optimization of continuous search efforts for the detection of a stationary target," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 589-601, September.
- Frédéric Dambreville & Jean‐Pierre Le Cadre, 2002. "Detection of a Markovian target with optimization of the search efforts under generalized linear constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 117-142, March.
- Joseph B. Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
- Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
- Alan R. Washburn, 1998. "Branch and bound methods for a search problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 243-257, April.
- Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
- Lyn C. Thomas & James N. Eagle, 1995. "Criteria and approximate methods for path‐constrained moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 27-38, February.
- Benoit Duvocelle & János Flesch & Hui Min Shi & Dries Vermeulen, 2021.
"Search for a moving target in a competitive environment,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 547-557, June.
- Benoit Duvocelle & J'anos Flesch & Hui Min Shi & Dries Vermeulen, 2020. "Search for a moving target in a competitive environment," Papers 2008.09653, arXiv.org, revised Aug 2020.
- Johannes O. Royset & Hiroyuki Sato, 2010. "Route optimization for multiple searchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 701-717, December.
- Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos, 1996. "Using multiple searchers in constrained‐path, moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 463-480, June.
- Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
- Lawrence D. Stone & Alan R. Washburn, 1991. "Introduction special issue on search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 465-468, August.
- Michael P. Atkinson & Moshe Kress & Roberto Szechtman, 2017. "To catch an intruder: Part A—uncluttered scenario," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 29-40, February.
- Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
- Joseph Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
- Michael W. Mehaffy, 2018. "Neighborhood “Choice Architecture”: A New Strategy for Lower-Emissions Urban Planning?," Urban Planning, Cogitatio Press, vol. 3(2), pages 113-127.
- Michael W. Mehaffy, 2018. "Neighborhood “Choice Architecture”: A New Strategy for Lower-Emissions Urban Planning?," Urban Planning, Cogitatio Press, vol. 3(2), pages 113-127.
- Brian Lunday & Hanif Sherali, 2012. "Network interdiction to minimize the maximum probability of evasion with synergy between applied resources," Annals of Operations Research, Springer, vol. 196(1), pages 411-442, July.
More about this item
Keywords
Combinatorial optimization; Multi-sensors search; Moving target; Non-linear optimization; Search theory;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:292:y:2021:i:2:p:469-482. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.