Burdakov, Oleg Doherty, Patrick Kvarnström, Jonas 2014 (English)Rapport (Other academic)
We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be applied in the case of its large-scale instances. For the hop-constrained DSTP, we propose local search strategies aimed at improving any heuristically produced initial Steiner tree. They are based on solving a sequence of hop-constrained shortest path problems for which we have recently developed ecient label correcting algorithms. The presented approach is applied to nding suitable 3D locations where unmanned aerial vehicles (UAVs) can be placed to relay information gathered in multi-target monitoring and surveillance. The eciency of our algorithms is illustrated by results of numerical experiments involving problem instances with up to 40 000 nodes and up to 20 million arcs.
Place, publisher, year, pages
Linköping University Electronic Press, 2014. 25 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2014:10
Steiner trees, hop constraints, local search heuristics, label correcting algorithms, unmanned vehicles placement
National CategoryDiscrete Mathematics Computer Vision and Robotics (Autonomous Systems)
Identifiersurn:nbn:se:liu:diva-109605 (URN)LiTH-MAT-R--2014/10--SE (ISRN)oai:DiVA.org:liu-109605 (OAI)