GPS network design: logistics solution using optimal and near-optimal methods

被引:36
|
作者
Dare, P [1 ]
Saleh, H [1 ]
机构
[1] Univ E London, Sch Surveying, Appl Geodesy Res Grp, Dagenham RM8 2AS, Essex, England
关键词
GPS; operational research; optimal design; heuristics; travelling salesman problem;
D O I
10.1007/s001900000104
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Although permanently installed global positioning system (GPS) networks are necessary when investigating many geophysical descriptors, there is still a need for epoch surveys consisting of temporarily placing GPS receivers sequentially at pre-chosen points. It is shown how the cost of carrying out an epoch survey can be reduced by using techniques within the field of operational research. An epoch survey design consists partly of a list of sessions to be observed, with the length of observing time for each session also specified. The issue of how long to spend observing a session is not addressed, but cheap session schedules are identified given the required sessions and the cost of moving receivers between points. For small networks, optimal solutions are possible; however, for larger networks, non-optimal solutions based upon heuristics have to be accepted. This is necessary because for large networks the optimal solution could take days or weeks to determine, whereas heuristic methods can provide results within seconds.
引用
收藏
页码:467 / 478
页数:12
相关论文
共 50 条
  • [41] Near-optimal adaptive polygonization
    Seibold, W
    Joy, KI
    COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS, 1999, : 206 - 213
  • [42] Near-Optimal Light Spanners
    Chechik, Shiri
    Wulff-Nilsen, Christian
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (03)
  • [43] Near-optimal block alignments
    Tseng, Kuo-Tsung
    Yang, Chang-Biau
    Huang, Kuo-Si
    Peng, Yung-Hsing
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (03): : 789 - 795
  • [44] Near-optimal list colorings
    Molloy, M
    Reed, B
    RANDOM STRUCTURES & ALGORITHMS, 2000, 17 (3-4) : 376 - 402
  • [45] Near-optimal sequence alignment
    Vingron, M
    CURRENT OPINION IN STRUCTURAL BIOLOGY, 1996, 6 (03) : 346 - 352
  • [46] On some classes of optimal and near-optimal polynomial codes
    Aydin, N
    Ray-Chaudhuri, DK
    FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 24 - 35
  • [47] Near-optimal detection of geometric objects by fast multiscale methods
    Arias-Castro, E
    Donoho, DL
    Huo, XM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (07) : 2402 - 2425
  • [48] Comparative Synthesis: Learning Near-Optimal Network Designs by Query
    Wang, Yanjun
    Li, Zixuan
    Jiang, Chuan
    Qiu, Xiaokang
    Rao, Sanjay
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL): : 91 - 120
  • [49] NEAR-OPTIMAL APPROXIMATION METHODS FOR ELLIPTIC PDES WITH LOGNORMAL COEFFICIENTS
    Cohen, Albert
    Migliorati, Giovanni
    MATHEMATICS OF COMPUTATION, 2023, 92 (342) : 1665 - 1691
  • [50] Near-Optimal Quantization and Linear Network Coding for Relay Networks
    Muralidhar, Anand
    Kumar, P. R.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) : 2777 - 2793