Finding a risk-constrained shortest path for an unmanned combat vehicle

Cited 11 time in webofscience Cited 11 time in scopus
  • Hit : 569
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBae, Kyung-Yeolko
dc.contributor.authorKim, Yeong-Daeko
dc.contributor.authorHan, Jun Heeko
dc.date.accessioned2015-04-08T06:24:43Z-
dc.date.available2015-04-08T06:24:43Z-
dc.date.created2014-12-29-
dc.date.created2014-12-29-
dc.date.issued2015-02-
dc.identifier.citationCOMPUTERS INDUSTRIAL ENGINEERING, v.80, pp.245 - 253-
dc.identifier.issn0360-8352-
dc.identifier.urihttp://hdl.handle.net/10203/195800-
dc.description.abstractWe consider a problem of finding a reconnaissance route of an unmanned combat vehicle (UCV) in a terrain, which is modeled as a grid. It is assumed that the traverse time to pass through each cell in the grid and risk level associated with each cell are given and that the cells where the reconnaissance points to be visited by the UCV are located and the visiting sequence of such cells are given in advance as in real situation of military operation. We focus on the problem with the objective of minimizing the total travel time of the UCV for a given limit on the sum of risk level values associated with the cells on the path of the UCV. We develop an optimal solution algorithm based on a dynamic programming algorithm for multiple-choice knapsack problems. We also present a heuristic algorithm, which can be used for large-size problems. For evaluation of the performance of the proposed algorithms, computational experiments are performed on a number of problem instances, and results show that the proposed algorithms give optimal or good solutions within an acceptable time for real military operations.-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectTRAVELING-SALESMAN PROBLEM-
dc.subjectHEAD PLACEMENT MACHINES-
dc.subjectCHOICE KNAPSACK-PROBLEM-
dc.subjectGENETIC ALGORITHM-
dc.subjectSCHEDULING PROBLEM-
dc.subjectSIDE CONSTRAINTS-
dc.subjectAPPROXIMATION-
dc.subjectGENERATION-
dc.subjectOPERATIONS-
dc.subjectBRANCH-
dc.titleFinding a risk-constrained shortest path for an unmanned combat vehicle-
dc.typeArticle-
dc.identifier.wosid000349591400023-
dc.identifier.scopusid2-s2.0-84920434905-
dc.type.rimsART-
dc.citation.volume80-
dc.citation.beginningpage245-
dc.citation.endingpage253-
dc.citation.publicationnameCOMPUTERS INDUSTRIAL ENGINEERING-
dc.identifier.doi10.1016/j.cie.2014.12.016-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.nonIdAuthorBae, Kyung-Yeol-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorResource-constrained shortest-path problem-
dc.subject.keywordAuthorUnmanned combat vehicle-
dc.subject.keywordAuthorMultiple-choice knapsack problem-
dc.subject.keywordAuthorDynamic programming-
dc.subject.keywordPlusTRAVELING-SALESMAN PROBLEM-
dc.subject.keywordPlusHEAD PLACEMENT MACHINES-
dc.subject.keywordPlusCHOICE KNAPSACK-PROBLEM-
dc.subject.keywordPlusGENETIC ALGORITHM-
dc.subject.keywordPlusSCHEDULING PROBLEM-
dc.subject.keywordPlusSIDE CONSTRAINTS-
dc.subject.keywordPlusAPPROXIMATION-
dc.subject.keywordPlusGENERATION-
dc.subject.keywordPlusOPERATIONS-
dc.subject.keywordPlusBRANCH-
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 11 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0