Route optimization for multiple searchers

DOI10.1002/NAV.20432MaRDI QIDQ3065632zbMATHOpenAlexFDO

Authors Johannes O. Royset, Hiroyuki Sato

Publication date 6 January 2011

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

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

zbMATH Keywords

military operations researchroute planningsearch and surveillancemixed-integer nonlinear programing

Mathematics Subject Classification ID

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

Recommendations

• Using multiple searchers in constrained-path, moving-target search problems
• Search-trajectory optimization. II: Algorithms and computations
• Search-trajectory optimization. I: Formulation and theory
• Optimal ambushing search for a moving target
• Path optimization for the resource-constrained searcher

Cites work

• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 3637580 (Why is no real title available?)
• scientific article; zbMATH DE number 1314978 (Why is no real title available?)
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• An algorithmic framework for convex mixed integer nonlinear programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Branch and bound methods for a search problem
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Maximizing a class of submodular utility functions
• Optimal Search for a Moving Target in Discrete Time and Space
• Path optimization for the resource-constrained searcher
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• The Cutting-Plane Method for Solving Convex Programs
• Using multiple searchers in constrained-path, moving-target search problems

Cited in

(15)

• Path optimization for the resource-constrained searcher
• Search-trajectory optimization. I: Formulation and theory
• Multi-objective search game: long-term vs short-term
• Persistent monitoring by multiple unmanned aerial vehicles using Bernstein polynomials
• Moving target search optimization -- a literature review
• The eye and the fist: optimizing search and interdiction
• A simple model of optimal clearance of improvised explosive devices
• An information theoretic based integer linear programming approach for the discrete search path planning problem
• Optimal search path for service in the presence of disruptions
• Solving the moving target search problem using indistinguishable searchers
• Consistent approximation of a nonlinear optimal control problem with uncertain parameters
• A semidefinite optimization approach to the target visitation problem
• An innovative multi-agent search-and-rescue path planning approach
• Static target search path planning optimization with heterogeneous agents
• ROUTING PROBLEM IN SURVEILLANCE OPERATION AT SEA

Describes a project that uses

Uses Software

• CPLEX
• Bonmin
• GAMS
• MINOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065632)