Browse

Optimal search-relocation trade-off in Markovian-target searching

DC Field Value Language
dc.contributor.authorHong, Sung-Pil-
dc.contributor.authorCho, Sung-Jin-
dc.contributor.authorPark, Myoung-Ju-
dc.contributor.authorLee, Moon-Gul-
dc.date.accessioned2012-03-05T02:30:29Z-
dc.date.available2012-03-05T02:30:29Z-
dc.date.issued2009-06-01-
dc.identifier.citationCOMPUTERS & OPERATIONS RESEARCH; Vol.36 6; 2097-2104-
dc.identifier.issn0305-0548-
dc.identifier.urihttps://hdl.handle.net/10371/75336-
dc.description.abstractIn this study, a standard moving-target search model was extended with a multiple-search-speed option, whereby a trade-off is enabled between the increased detection chances owing to the searcher''''''''s better location and the increased uncertainty of the target''''''''s location resulting from the diminished search performance incurred in the relocation. This enhances the detection probability of the output search path and, thereby, the model''''''''s practicality. However, the scalability of the solution method is essential to its implementation, as the basic model is already NP-hard. We developed an efficient heuristic by combining the idea of approximate nondetection probability minimization and a hybridized shortest-path heuristic that exploits the fast-mixing property of the Markov chain. According to the results of an intensive experiment, the heuristic achieves a near-optimal trade-off within a very reasonable computation time. (C) 2008 Elsevier Ltd. All rights reserved.-
dc.language.isoen-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectOptimization-
dc.subjectNetworks and graphs-
dc.subjectProbability-
dc.subjectSearch-
dc.titleOptimal search-relocation trade-off in Markovian-target searching-
dc.typeArticle-
dc.contributor.AlternativeAuthor홍성필-
dc.contributor.AlternativeAuthor조성진-
dc.contributor.AlternativeAuthor박명주-
dc.contributor.AlternativeAuthor이문글-
dc.identifier.doi10.1016/j.cor.2008.07.007-
dc.citation.journaltitleCOMPUTERS & OPERATIONS RESEARCH-
dc.description.citedreferenceHong SP, 2009, EUR J OPER RES, V193, P351, DOI 10.1016/j.ejor.2007.10.048-
dc.description.citedreferenceDambreville F, 2002, NAV RES LOG, V49, P117, DOI 10.1002/nav.10009-
dc.description.citedreferenceFROST JR, 2001, CGD1501 US COAST GUA-
dc.description.citedreferenceHohzaki R, 1997, EUR J OPER RES, V100, P236-
dc.description.citedreferenceDell RF, 1996, NAV RES LOG, V43, P463-
dc.description.citedreferenceSINCLAIR AJ, 1993, PROGR THEORETICAL CO, P42-
dc.description.citedreferenceEAGLE JN, 1990, OPER RES, V38, P110-
dc.description.citedreferenceTRUMMEL KE, 1986, OPER RES, V34, P324-
dc.description.citedreferenceEAGLE JN, 1984, OPER RES, V32, P1107-
dc.description.citedreferenceBROWN SS, 1980, OPER RES, V28, P1275-
dc.description.citedreferenceSTEWART TJ, 1979, COMPUT OPER RES, V6, P129-
dc.description.citedreferencePOLLOCK SM, 1970, OPER RES, V18, P883-
dc.description.tc0-
dc.identifier.wosid000262120300036-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
Files in This Item:
There are no files associated with this item.
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse