Approximation Algorithms for the Generalized Team Orienteering Problem and its Applications

• Published in: IEEE/ACM transactions on networking Vol. 29; no. 1; pp. 176 - 189
• Main Authors: Xu, Wenzheng, Liang, Weifa, Xu, Zichuan, Peng, Jian, Peng, Dezhong, Liu, Tang, Jia, Xiaohua, Das, Sajal K.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.02.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation; Approximation algorithms; Dispatching; Electronic mail; Intelligent sensors; Mathematical analysis; Monitoring; Multiple vehicle scheduling; Nodes; Orienteering; submodular function; the generalized team orienteering problem; Vehicles
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2020.3027434

In this article we study a generalized team orienteering problem (GTOP), which is to find service paths for multiple homogeneous vehicles in a network such that the profit sum of serving the nodes in the paths is maximized, subject to the cost budget of each vehicle. This problem has many potential applications in IoTs and smart cities, such as dispatching energy-constrained mobile chargers to charge as many energy-critical sensors as possible to prolong the network lifetime. In this article, we first formulate the GTOP problem, where each node can be served by different vehicles, and the profit of serving the node is a submodular function of the number of vehicles serving it. We then propose a novel <inline-formula> <tex-math notation="LaTeX">\left(1-(1/e)^{\frac {1}{2+\epsilon }}\right) </tex-math></inline-formula>-approximation algorithm for the problem, where <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula> is a given constant with <inline-formula> <tex-math notation="LaTeX">0 \lt \epsilon \le 1 </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">e </tex-math></inline-formula> is the base of the natural logarithm. In particular, the approximation ratio is about 0.33 when <inline-formula> <tex-math notation="LaTeX">\epsilon =0.5 </tex-math></inline-formula>. In addition, we devise an improved approximation algorithm for a special case of the problem where the profit is the same by serving a node once and multiple times. We finally evaluate the proposed algorithms with simulation experiments, and the results of which are very promising. Especially, the profit sums delivered by the proposed algorithms are up to 14% higher than those by existing algorithms, and about 93.6% of the optimal solutions.