DETIENNE, Boris; QUADRI, Dominique; RODRIGUES, Diego Carlos

doi:10.1080/00207543.2014.970714

Métadonnées

Licence d’utilisation du document

DETIENNE, Boris
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

QUADRI, Dominique
Laboratoire de Recherche en Informatique [LRI]

RODRIGUES, Diego Carlos
Universidade Federal do Ceará = Federal University of Ceará [UFC]

Langue

Article de revue

Ce document a été publié dans

International Journal of Production Research. 2014-10-15, vol. 52, n° 24, p. 7177-7192

Taylor & Francis

Résumé en anglais

This paper presents a generic discrete model for the moving, intelligent target problem. Our objective is to maximise the probability of detection of the moving target with respect to target and searcher’s constraints. The solution method proposed here is composed on two stages. The first one aims at providing a large-scale strategy by solving an Integer Linear Program approach. As a direct solution of this problem is not practically possible, we use a decomposition of the problem into a searcher’s strategy on one side, and the target’s strategy on the other side. A good strategy for the searcher is determined using a sliding window procedure. Concerning the target, our approach consists in simulating some of the target’s possible strategies and considering each of these possibilities as an independent and deterministic entity. The second stage is dedicated to adjusting the large-scale strategy provided by stage 1. Finally, numerical results are presented so as to assess the impact of our approach.< Réduire

Mots clés en anglais

detecting search problem

intelligent moving target

Integer Linear Programming

Simulation

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Two phase solution for an intelligent moving target search problem based on a 0–1 linear model

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche