Optimal routing of coordinated aircraft to identify moving surface contacts
A warship at sea requires awareness of the ships in its vicinity in order to operate safely. This can be a daunting task, even when equipped with multiple shipboard systems. If naval air assets are available, a Tactical Action Officer (TAO) directs them to gain additional information about as many s...
Main Author: | |
---|---|
Other Authors: | , , , |
Format: | Thesis |
Language: | unknown |
Published: |
Monterey, California: Naval Postgraduate School
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10945/55621 |
id |
ftnavalpschool:oai:calhoun.nps.edu:10945/55621 |
---|---|
record_format |
openpolar |
spelling |
ftnavalpschool:oai:calhoun.nps.edu:10945/55621 2024-06-09T07:48:53+00:00 Optimal routing of coordinated aircraft to identify moving surface contacts Herraiz Solla, Alvaro Dell, Robert F. Carlyle, W. Matthew Operations Research (OR) McLemore, Connor 2017-06 application/pdf https://hdl.handle.net/10945/55621 unknown Monterey, California: Naval Postgraduate School https://hdl.handle.net/10945/55621 Copyright is reserved by the copyright owner. generalized orieenteering problem traveling salesman problem heuristic vehicle routing problem optimal routing of coordinated aircraft Thesis 2017 ftnavalpschool 2024-05-15T00:47:40Z A warship at sea requires awareness of the ships in its vicinity in order to operate safely. This can be a daunting task, even when equipped with multiple shipboard systems. If naval air assets are available, a Tactical Action Officer (TAO) directs them to gain additional information about as many surface Contacts of Interest (COI) as possible. These air asset routes can be inefficient because there are no shipboard systems to aid with route planning. Additional complications include COIs moving during a route and some COIs being more important to visit than others. This thesis formulates and implements two Optimal Routing of Coordinated Aircraft (ORCA) Integer Linear Programs (ILP) to plan air asset routes that visit as many prioritized COIs as possible in a fixed time horizon. We report computation results planning for up to four air assets and up to 80 COIs. Solution time for both ILPs is less than half an hour for typically encountered routing scenarios with less than 40 COIs. For 80 COIs, we find solutions in less than two minutes to visit 61 COIs, or up to 77 if we can wait two hours to obtain the solution. Approved for public release; distribution is unlimited. Lieutenant Commander, Spanish Navy http://archive.org/details/optimalroutingof1094555621 Thesis Orca Naval Postgraduate School: Calhoun |
institution |
Open Polar |
collection |
Naval Postgraduate School: Calhoun |
op_collection_id |
ftnavalpschool |
language |
unknown |
topic |
generalized orieenteering problem traveling salesman problem heuristic vehicle routing problem optimal routing of coordinated aircraft |
spellingShingle |
generalized orieenteering problem traveling salesman problem heuristic vehicle routing problem optimal routing of coordinated aircraft Herraiz Solla, Alvaro Optimal routing of coordinated aircraft to identify moving surface contacts |
topic_facet |
generalized orieenteering problem traveling salesman problem heuristic vehicle routing problem optimal routing of coordinated aircraft |
description |
A warship at sea requires awareness of the ships in its vicinity in order to operate safely. This can be a daunting task, even when equipped with multiple shipboard systems. If naval air assets are available, a Tactical Action Officer (TAO) directs them to gain additional information about as many surface Contacts of Interest (COI) as possible. These air asset routes can be inefficient because there are no shipboard systems to aid with route planning. Additional complications include COIs moving during a route and some COIs being more important to visit than others. This thesis formulates and implements two Optimal Routing of Coordinated Aircraft (ORCA) Integer Linear Programs (ILP) to plan air asset routes that visit as many prioritized COIs as possible in a fixed time horizon. We report computation results planning for up to four air assets and up to 80 COIs. Solution time for both ILPs is less than half an hour for typically encountered routing scenarios with less than 40 COIs. For 80 COIs, we find solutions in less than two minutes to visit 61 COIs, or up to 77 if we can wait two hours to obtain the solution. Approved for public release; distribution is unlimited. Lieutenant Commander, Spanish Navy http://archive.org/details/optimalroutingof1094555621 |
author2 |
Dell, Robert F. Carlyle, W. Matthew Operations Research (OR) McLemore, Connor |
format |
Thesis |
author |
Herraiz Solla, Alvaro |
author_facet |
Herraiz Solla, Alvaro |
author_sort |
Herraiz Solla, Alvaro |
title |
Optimal routing of coordinated aircraft to identify moving surface contacts |
title_short |
Optimal routing of coordinated aircraft to identify moving surface contacts |
title_full |
Optimal routing of coordinated aircraft to identify moving surface contacts |
title_fullStr |
Optimal routing of coordinated aircraft to identify moving surface contacts |
title_full_unstemmed |
Optimal routing of coordinated aircraft to identify moving surface contacts |
title_sort |
optimal routing of coordinated aircraft to identify moving surface contacts |
publisher |
Monterey, California: Naval Postgraduate School |
publishDate |
2017 |
url |
https://hdl.handle.net/10945/55621 |
genre |
Orca |
genre_facet |
Orca |
op_relation |
https://hdl.handle.net/10945/55621 |
op_rights |
Copyright is reserved by the copyright owner. |
_version_ |
1801380866805465088 |