Geodesic
Two-level optimization of sensors reposition
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 9 (2016) no. 3, pp. 130-136 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of optimal measurements planning with regularly repositioning sensors is considered. This abstract problem may serve as a mathematical model for a variety of different applied problems connected with cost optimization in the experiments where sensors are used for the estimation of the environment parameters. There are two levels of optimization in the considered problem: movement optimization in the process of sensors reposition from one group of points to another and order optimization in which the groups of positions follow each other. The exact solution of the two-level problem is proposed and supported by the results of computation experiment.
Keywords: sensors reposition; route optimization; traveling salesman problem; linear order. 
@article{VYURU_2016_9_3_a10,
     author = {E. E. Ivanko},
     title = {Two-level optimization of sensors reposition},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
     pages = {130--136},
     year = {2016},
     volume = {9},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURU_2016_9_3_a10/}
}
TY  - JOUR
AU  - E. E. Ivanko
TI  - Two-level optimization of sensors reposition
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
PY  - 2016
SP  - 130
EP  - 136
VL  - 9
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VYURU_2016_9_3_a10/
LA  - ru
ID  - VYURU_2016_9_3_a10
ER  - 
%0 Journal Article
%A E. E. Ivanko
%T Two-level optimization of sensors reposition
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
%D 2016
%P 130-136
%V 9
%N 3
%U http://geodesic.mathdoc.fr/item/VYURU_2016_9_3_a10/
%G ru
%F VYURU_2016_9_3_a10
E. E. Ivanko. Two-level optimization of sensors reposition. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 9 (2016) no. 3, pp. 130-136. http://geodesic.mathdoc.fr/item/VYURU_2016_9_3_a10/

[1] S. Anily, G. Mosheiov, “The Traveling Salesman Problem with Delivery and Backhauls”, Operations Research Letters, 16:1 (1994), 11–18 | DOI | MR | Zbl

[2] M. Gendreau, G. Laporte, D. Vigo, “Heuristics for the Traveling Salesman Problem with Pickup and Delivery”, Computers Operations Research, 26:7 (1999), 699–714 | DOI | MR | Zbl

[3] H. Hernandez-Perez, J. J. Salazar-Gonzalez, “A Branch-and-Cut Algorithm for a Traveling Salesman Problem with Pickup and Delivery”, Discret Applied Mathematics, 145 (2004), 126–139 | DOI | MR | Zbl

[4] Ivanko E. E., “Dynamical Programming in One-Type Objects Reposition Problem”, Proceedings of Institute of Mathematics and Mechanics, 19, no. 4, 2013, 125–130 (in Russian) | MR

[5] B. V. Cherkassky, A. V. Goldberg, T. Radzik, “Shortest Paths Algorithms: Theory and Experimental Evaluation”, Mathematical Programming, 73 (1996), 129–174 | MR | Zbl

[6] J. N. MacGregor, Y. Chu, “Human Performance on the Traveling Salesman and Related Problems: A Review”, Journal of Problem Solving, 3:2 (2001), 1–29