Regional surveillance of disjoint rectangles: a travelling salesman formulation
Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling s...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 2009-02, Vol.60 (2), p.215-220 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 220 |
|---|---|
| container_issue | 2 |
| container_start_page | 215 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 60 |
| creator | Ng, K Y K Sancho, N G F |
| description | Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling salesman problem. The uniqueness of the problem lies in the different allowed entry and exit points. Additionally, the mission schedule has to ensure the probability of target detection must not be compromised. From the practical perspective, any reduction in travelling time provides immediate cost savings to the defence department. A dynamic programming formulation is derived for the regional surveillance problem. An example is included to illustrate the methodology. |
| doi_str_mv | 10.1057/palgrave.jors.2602507 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_21093220</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>20202287</jstor_id><sourcerecordid>20202287</sourcerecordid><originalsourceid>FETCH-LOGICAL-c489t-5068dbc8c54a896265d20f93154fb6c7daeb8ac044e6d2a5aa40371989b6063c3</originalsourceid><addsrcrecordid>eNqFkF-L1DAUxYsoOK5-hIUi-NjxJmnSxCdl8R8sLIg-hztpWloyyZikK_vtTemsAz4oeQjknHvuya-qrgnsCfDu7QndGPHe7ucQ054KoBy6J9WOtJ1oFBPwtNoBEdBwIenz6kVKMwAoIGpX3X2z4xQ8ujot8d5OzqE3tg5D3U9pDpPPdbQmox-dTe9qrPO6ybnJj3XC8nZEXw8hHheHuQS9rJ4N6JJ9db6vqh-fPn6_-dLc3n3-evPhtjGtVLnhIGR_MNLwFqUSVPCewqAY4e1wEKbr0R4kGmhbK3qKHLEF1hEl1UGAYIZdVa-33FMMPxebsp7DEss_kqaMMCm4YsXEN5OJIaVoB32K0xHjgyagV3T6EZ1e0ekzujL35hyOyaAbYmEypT_DlIBilELxic2XiuRHGy8l_rfgehv0mJdoL8l_63PKIV5kKIfKVX-_6ZNf2eOvEF2vMz64EB_bsn9X-A1TlbBl</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231386593</pqid></control><display><type>article</type><title>Regional surveillance of disjoint rectangles: a travelling salesman formulation</title><source>JSTOR Archive Collection A-Z Listing</source><creator>Ng, K Y K ; Sancho, N G F</creator><creatorcontrib>Ng, K Y K ; Sancho, N G F</creatorcontrib><description>Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling salesman problem. The uniqueness of the problem lies in the different allowed entry and exit points. Additionally, the mission schedule has to ensure the probability of target detection must not be compromised. From the practical perspective, any reduction in travelling time provides immediate cost savings to the defence department. A dynamic programming formulation is derived for the regional surveillance problem. An example is included to illustrate the methodology.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/palgrave.jors.2602507</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Aircraft ; Applied sciences ; Business and Management ; Distance functions ; Dynamic programming ; Exact sciences and technology ; Gas turbine engines ; Integers ; Logistics ; Management ; military applications ; National security ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Planning ; Rectangles ; Regional planning ; Regions ; Studies ; Supersonic transport ; Surveillance ; Theoretical Paper ; Theoretical Papers ; Traveling salesman problem ; travelling salesman problem</subject><ispartof>The Journal of the Operational Research Society, 2009-02, Vol.60 (2), p.215-220</ispartof><rights>Copyright © 2007, Operational Research Society Ltd. 2007</rights><rights>Copyright 2009 Operational Research Society Ltd.</rights><rights>Operational Research Society Ltd. 2007</rights><rights>2009 INIST-CNRS</rights><rights>Operational Research Society Ltd. 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c489t-5068dbc8c54a896265d20f93154fb6c7daeb8ac044e6d2a5aa40371989b6063c3</citedby><cites>FETCH-LOGICAL-c489t-5068dbc8c54a896265d20f93154fb6c7daeb8ac044e6d2a5aa40371989b6063c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/20202287$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/20202287$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,803,27924,27925,58017,58250</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21093220$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ng, K Y K</creatorcontrib><creatorcontrib>Sancho, N G F</creatorcontrib><title>Regional surveillance of disjoint rectangles: a travelling salesman formulation</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling salesman problem. The uniqueness of the problem lies in the different allowed entry and exit points. Additionally, the mission schedule has to ensure the probability of target detection must not be compromised. From the practical perspective, any reduction in travelling time provides immediate cost savings to the defence department. A dynamic programming formulation is derived for the regional surveillance problem. An example is included to illustrate the methodology.</description><subject>Aircraft</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>Distance functions</subject><subject>Dynamic programming</subject><subject>Exact sciences and technology</subject><subject>Gas turbine engines</subject><subject>Integers</subject><subject>Logistics</subject><subject>Management</subject><subject>military applications</subject><subject>National security</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Planning</subject><subject>Rectangles</subject><subject>Regional planning</subject><subject>Regions</subject><subject>Studies</subject><subject>Supersonic transport</subject><subject>Surveillance</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Traveling salesman problem</subject><subject>travelling salesman problem</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFkF-L1DAUxYsoOK5-hIUi-NjxJmnSxCdl8R8sLIg-hztpWloyyZikK_vtTemsAz4oeQjknHvuya-qrgnsCfDu7QndGPHe7ucQ054KoBy6J9WOtJ1oFBPwtNoBEdBwIenz6kVKMwAoIGpX3X2z4xQ8ujot8d5OzqE3tg5D3U9pDpPPdbQmox-dTe9qrPO6ybnJj3XC8nZEXw8hHheHuQS9rJ4N6JJ9db6vqh-fPn6_-dLc3n3-evPhtjGtVLnhIGR_MNLwFqUSVPCewqAY4e1wEKbr0R4kGmhbK3qKHLEF1hEl1UGAYIZdVa-33FMMPxebsp7DEss_kqaMMCm4YsXEN5OJIaVoB32K0xHjgyagV3T6EZ1e0ekzujL35hyOyaAbYmEypT_DlIBilELxic2XiuRHGy8l_rfgehv0mJdoL8l_63PKIV5kKIfKVX-_6ZNf2eOvEF2vMz64EB_bsn9X-A1TlbBl</recordid><startdate>20090201</startdate><enddate>20090201</enddate><creator>Ng, K Y K</creator><creator>Sancho, N G F</creator><general>Taylor & Francis</general><general>Palgrave Macmillan Publishers</general><general>Palgrave Macmillan UK</general><general>Palgrave Macmillan</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20090201</creationdate><title>Regional surveillance of disjoint rectangles: a travelling salesman formulation</title><author>Ng, K Y K ; Sancho, N G F</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c489t-5068dbc8c54a896265d20f93154fb6c7daeb8ac044e6d2a5aa40371989b6063c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Aircraft</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>Distance functions</topic><topic>Dynamic programming</topic><topic>Exact sciences and technology</topic><topic>Gas turbine engines</topic><topic>Integers</topic><topic>Logistics</topic><topic>Management</topic><topic>military applications</topic><topic>National security</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Planning</topic><topic>Rectangles</topic><topic>Regional planning</topic><topic>Regions</topic><topic>Studies</topic><topic>Supersonic transport</topic><topic>Surveillance</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Traveling salesman problem</topic><topic>travelling salesman problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ng, K Y K</creatorcontrib><creatorcontrib>Sancho, N G F</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ng, K Y K</au><au>Sancho, N G F</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Regional surveillance of disjoint rectangles: a travelling salesman formulation</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2009-02-01</date><risdate>2009</risdate><volume>60</volume><issue>2</issue><spage>215</spage><epage>220</epage><pages>215-220</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling salesman problem. The uniqueness of the problem lies in the different allowed entry and exit points. Additionally, the mission schedule has to ensure the probability of target detection must not be compromised. From the practical perspective, any reduction in travelling time provides immediate cost savings to the defence department. A dynamic programming formulation is derived for the regional surveillance problem. An example is included to illustrate the methodology.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/palgrave.jors.2602507</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 2009-02, Vol.60 (2), p.215-220 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_21093220 |
| source | JSTOR Archive Collection A-Z Listing |
| subjects | Aircraft Applied sciences Business and Management Distance functions Dynamic programming Exact sciences and technology Gas turbine engines Integers Logistics Management military applications National security Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory Planning Rectangles Regional planning Regions Studies Supersonic transport Surveillance Theoretical Paper Theoretical Papers Traveling salesman problem travelling salesman problem |
| title | Regional surveillance of disjoint rectangles: a travelling salesman formulation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T11%3A28%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Regional%20surveillance%20of%20disjoint%20rectangles:%20a%20travelling%20salesman%20formulation&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Ng,%20K%20Y%20K&rft.date=2009-02-01&rft.volume=60&rft.issue=2&rft.spage=215&rft.epage=220&rft.pages=215-220&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2602507&rft_dat=%3Cjstor_pasca%3E20202287%3C/jstor_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=231386593&rft_id=info:pmid/&rft_jstor_id=20202287&rfr_iscdi=true |