覆盖无人地面车辆路线的途中警戒问题

IF 0.5 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Military Operations Research Pub Date : 2013-12-01 DOI:10.1002/9781118918937.CH2

H. Tan

{"title":"覆盖无人地面车辆路线的途中警戒问题","authors":"H. Tan","doi":"10.1002/9781118918937.CH2","DOIUrl":null,"url":null,"abstract":"Abstract : The routing of unmanned ground vehicles for the surveillance and protection of key installations is modeled as a new variant of the Covering Tour Problem (CTP). The CTP structure provides both the routing and target sensing components of the installation protection problem. Our variant is called the in-transit Vigilant Covering Tour Problem (VCTP) and considers not only the vertex cover but also the additional edge coverage capability of the unmanned ground vehicle while sensing in-transit between vertices. The VCTP is formulated as a Traveling Salesman Problem (TSP) with a dual set covering structure involving vertices and edges. An empirical study compares the performance of the VCTP against the CTP on test problems modified from standard benchmark TSP problems to apply to the VCTP. The VCTP performed generally better with shorter tour lengths but at higher computational cost.","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"181 ","pages":"5-18"},"PeriodicalIF":0.5000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/9781118918937.CH2","citationCount":"1","resultStr":"{\"title\":\"The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles\",\"authors\":\"H. Tan\",\"doi\":\"10.1002/9781118918937.CH2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract : The routing of unmanned ground vehicles for the surveillance and protection of key installations is modeled as a new variant of the Covering Tour Problem (CTP). The CTP structure provides both the routing and target sensing components of the installation protection problem. Our variant is called the in-transit Vigilant Covering Tour Problem (VCTP) and considers not only the vertex cover but also the additional edge coverage capability of the unmanned ground vehicle while sensing in-transit between vertices. The VCTP is formulated as a Traveling Salesman Problem (TSP) with a dual set covering structure involving vertices and edges. An empirical study compares the performance of the VCTP against the CTP on test problems modified from standard benchmark TSP problems to apply to the VCTP. The VCTP performed generally better with shorter tour lengths but at higher computational cost.\",\"PeriodicalId\":54242,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":\"181 \",\"pages\":\"5-18\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1002/9781118918937.CH2\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1002/9781118918937.CH2\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1002/9781118918937.CH2","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 1

摘要

摘要:将用于关键设施监视保护的无人地面车辆路径建模为覆盖漫游问题(CTP)的一种新变体。CTP结构同时提供了路由和目标传感组件的安装保护问题。我们的变体被称为过境警戒覆盖巡回问题(VCTP)，它不仅考虑了顶点覆盖，而且考虑了无人驾驶地面车辆在感知顶点之间的过境时的附加边缘覆盖能力。VCTP被表述为具有双集覆盖结构的旅行商问题(TSP)。一项实证研究比较了VCTP与CTP在测试问题上的性能，这些测试问题是由标准基准TSP问题修改而来的，适用于VCTP。VCTP通常在较短的行程长度下表现较好，但计算成本较高。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

Abstract : The routing of unmanned ground vehicles for the surveillance and protection of key installations is modeled as a new variant of the Covering Tour Problem (CTP). The CTP structure provides both the routing and target sensing components of the installation protection problem. Our variant is called the in-transit Vigilant Covering Tour Problem (VCTP) and considers not only the vertex cover but also the additional edge coverage capability of the unmanned ground vehicle while sensing in-transit between vertices. The VCTP is formulated as a Traveling Salesman Problem (TSP) with a dual set covering structure involving vertices and edges. An empirical study compares the performance of the VCTP against the CTP on test problems modified from standard benchmark TSP problems to apply to the VCTP. The VCTP performed generally better with shorter tour lengths but at higher computational cost.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Military Operations Research Engineering-Mechanical Engineering

CiteScore

0.40

自引率

0.00%

发文量

期刊介绍： Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.