In this paper we consider the dynamic routing of unmanned aerial vehicles (UAVs) currently in operational use with the US Air Force. Dynamic vehicle routing problems (VRP) have always been challenging, and the airborne version of the VRP adds dimensions and difficulties not present in typical ground-based applications. Previous UAV routing work has focused on primarily on static, pre-planned situations; however, scheduling military operations, which are often ad-hoc, drives the need for a dynamic route solver that can respond to rapidly evolving problem constraints. With these considerations in mind, we examine the use of a Java-encoded metaheuristic to solve these dynamic routing problems, explore its operation with several general problem classes, and look at the advantages it provides in sample UAV routing problems. The end routine provides routing information for a UAV virtual battlespace simulation and allows dynamic routing of operational missions.
"Sinopsis" puede pertenecer a otra edición de este libro.
In this paper we consider the dynamic routing of unmanned aerial vehicles (UAVs) currently in operational use with the US Air Force. Dynamic vehicle routing problems (VRP) have always been challenging, and the airborne version of the VRP adds dimensions and difficulties not present in typical ground-based applications. Previous UAV routing work has focused on primarily on static, pre-planned situations; however, scheduling military operations, which are often ad-hoc, drives the need for a dynamic route solver that can respond to rapidly evolving problem constraints. With these considerations in mind, we examine the use of a Java-encoded metaheuristic to solve these dynamic routing problems, explore its operation with several general problem classes, and look at the advantages it provides in sample UAV routing problems. The end routine provides routing information for a UAV virtual battlespace simulation and allows dynamic routing of operational missions.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 19019657-n
Cantidad disponible: Más de 20 disponibles
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
Paperback or Softback. Condición: New. Dynamic Unmanned Aerial Vehicle Routing With a Java-Encoded Reactive Tabu Search Metaheuristic. Book. Nº de ref. del artículo: BBS-9781249593683
Cantidad disponible: 5 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9781249593683
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9781249593683
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781249593683_new
Cantidad disponible: Más de 20 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 134. Nº de ref. del artículo: 386358301
Cantidad disponible: 4 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Print on Demand pp. 134. Nº de ref. del artículo: 26393274306
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 134. Nº de ref. del artículo: 18393274312
Cantidad disponible: 4 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 19019657-n
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Neuware - In this paper we consider the dynamic routing of unmanned aerial vehicles (UAVs) currently in operational use with the US Air Force. Dynamic vehicle routing problems (VRP) have always been challenging, and the airborne version of the VRP adds dimensions and difficulties not present in typical ground-based applications. Previous UAV routing work has focused on primarily on static, pre-planned situations; however, scheduling military operations, which are often ad-hoc, drives the need for a dynamic route solver that can respond to rapidly evolving problem constraints. With these considerations in mind, we examine the use of a Java-encoded metaheuristic to solve these dynamic routing problems, explore its operation with several general problem classes, and look at the advantages it provides in sample UAV routing problems. The end routine provides routing information for a UAV virtual battlespace simulation and allows dynamic routing of operational missions. Nº de ref. del artículo: 9781249593683
Cantidad disponible: 2 disponibles