Heuristics for determining a patrol path of an unmanned combat vehicle

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 374
  • Download : 0
We consider a problem of finding a path of an unmanned combat vehicle that patrols a given area by visiting a given set of checkpoints with the objective of minimizing possibility of enemy's infiltration. In this study, we focus on a situation in which the possibility of enemy's infiltration at (through) each checkpoint is increased nonlinearly as time passes and the checkpoint may be patrolled multiple times during a planning horizon. We develop two-phase heuristics in which an initial path is constructed in the first phase and then it is improved in the second phase. For evaluation of the performance of the proposed heuristics, computational experiments are performed on randomly generated problem instances, and results show that the heuristics give good solutions in a reasonably short time. (C) 2012 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2012-08
Language
English
Article Type
Article
Keywords

TRAVELING SALESMAN PROBLEM; ALGORITHM

Citation

COMPUTERS & INDUSTRIAL ENGINEERING, v.63, no.1, pp.150 - 160

ISSN
0360-8352
DOI
10.1016/j.cie.2012.02.007
URI
http://hdl.handle.net/10203/101616
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0