Tour planning for crowdsourcing sensor data collection
| Autor: | K. L. Yeh, Jane W. S. Liu, E. T. H. Chu |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
021103 operations research
Data collection Theoretical computer science Linear programming business.industry Computer science 0211 other engineering and technologies Graph partition 02 engineering and technology Crowdsourcing Travelling salesman problem 03 medical and health sciences 0302 clinical medicine 030212 general & internal medicine business Cluster analysis Assignment problem Integer programming |
| Zdroj: | SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI |
| DOI: | 10.1109/uic-atc.2017.8397396 |
| Popis: | A disaster surveillance system that crowdsources observation data needs to compute a tour for each volunteer to follow during the data collection process. A common approach to do this computation is to first assign a subset of locations to each volunteer, and then solve the classical traveling salesman problem to find an optimal tour connecting locations in each subset. This paper describes the use of graph partitioning and integer programming techniques to solve the location assignment problem and presents preliminary data on their merits. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|