Route optimization for multiple searchers

DOI10.1002/nav.20432zbMath1202.90038OpenAlexW1984142532MaRDI QIDQ3065632

Johannes O. Royset, Hiroyuki Sato

Publication date: 6 January 2011

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20432

zbMATH Keywords

route planningmilitary operations researchsearch and surveillancemixed-integer nonlinear programing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)

Related Items

Search-trajectory optimization. I: Formulation and theory ⋮ An innovative multi-agent search-and-rescue path planning approach ⋮ The eye and the fist: optimizing search and interdiction ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Moving target search optimization -- a literature review ⋮ Static target search path planning optimization with heterogeneous agents ⋮ Persistent monitoring by multiple unmanned aerial vehicles using Bernstein polynomials ⋮ Consistent approximation of a nonlinear optimal control problem with uncertain parameters

Uses Software

• CPLEX
• Bonmin
• GAMS
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing a class of submodular utility functions
• An algorithmic framework for convex mixed integer nonlinear programs
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• The Cutting-Plane Method for Solving Convex Programs
• Path optimization for the resource-constrained searcher
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Optimal Search for a Moving Target in Discrete Time and Space
• Branch and bound methods for a search problem
• Using multiple searchers in constrained-path, moving-target search problems
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Route optimization for multiple searchers