Show simple item record

hal.structure.identifierLaboratoire d'Etudes et de Recherche en Informatique d'Angers [LERIA]
dc.contributor.authorDelavernhe, Florian
hal.structure.identifierautre
dc.contributor.authorJaillet, Patrick
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorRossi, André
HAL ID: 1694
hal.structure.identifierLaboratoire des sciences et techniques de l'information, de la communication et de la connaissance [Lab-STICC]
dc.contributor.authorSevaux, Marc
HAL ID: 258
ORCID: 0000-0003-3855-9072
dc.date.accessioned2021-04-12T13:06:27Z
dc.date.available2021-04-12T13:06:27Z
dc.date.issued2020
dc.identifier.issn0377-2217
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/21659
dc.language.isoenen
dc.subjectCombinatorial optimizationen
dc.subjectMulti-sensors searchen
dc.subjectMoving targeten
dc.subjectNon-linear optimizationen
dc.subjectSearch theoryen
dc.subject.ddc003en
dc.titlePlanning a multi-sensors search for a moving target considering traveling costsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper addresses the optimization problem of managing the research efforts of a set of sensors in order to minimize the probability of non-detection of a target. A novel formulation of the problem taking into account the traveling costs between the searched areas is proposed; it is more realistic and extends some previous problems addressed in the literature. A greedy heuristic algorithm is devised, it builds a solution gradually, using a linear approximation of the objective function refined at each step. The heuristic algorithm is complemented by a lower bound based on a piecewise linear approximation of the objective function with a parametric error, and extended to the case where the target is moving. Finally, a set of numerical experiments is performed to analyze and evaluate the proposed contributions.en
dc.relation.isversionofjnlnameEuropean Journal of Operational Research
dc.relation.isversionofjnlvol292en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2021-07
dc.relation.isversionofjnlpages469-482en
dc.relation.isversionofdoi10.1016/j.ejor.2020.11.012en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2021-04-12T13:01:52Z
hal.identifierhal-03134042*
hal.version1*
hal.update.actionupdateFiles*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record