An enormous number of devices are currently available to collect data. One of the main applications of these devices is in the urban environment, where they can collect data useful for improving the operations management and reducing economic, environmental and social costs. This is the main goal of smart cities. To gather these data from devices, companies can build expensive networks able of reaching every part of the city or they can use cheaper alternatives as opportunistic connections, i.e., use the devices of selected people (e.g., mobile users) as mobile hotspots in exchange for a reward. In this paper, we consider this second choice and, in particular, we solve the problem of minimizing the sum of the rewards while providing the connectivity to all sensors. We show that the stochastic approach must be considered since deterministic solutions produce considerable waste. Finally, to reduce the computational time we apply the loss of reduced costs-based variable fixing (LRCVF) heuristic and we compare, by means of computational tests, the performances of the heuristic and a commercial solver. The results prove the effectiveness of the LRCVF heuristic.
Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT / Fadda, Edoardo; Perboli, Guido; Tadei, Roberto. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - STAMPA. - 93:(2018), pp. 41-50. [10.1016/j.cor.2018.01.010]
Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT
FADDA, EDOARDO;PERBOLI, GUIDO;TADEI, Roberto
2018
Abstract
An enormous number of devices are currently available to collect data. One of the main applications of these devices is in the urban environment, where they can collect data useful for improving the operations management and reducing economic, environmental and social costs. This is the main goal of smart cities. To gather these data from devices, companies can build expensive networks able of reaching every part of the city or they can use cheaper alternatives as opportunistic connections, i.e., use the devices of selected people (e.g., mobile users) as mobile hotspots in exchange for a reward. In this paper, we consider this second choice and, in particular, we solve the problem of minimizing the sum of the rewards while providing the connectivity to all sensors. We show that the stochastic approach must be considered since deterministic solutions produce considerable waste. Finally, to reduce the computational time we apply the loss of reduced costs-based variable fixing (LRCVF) heuristic and we compare, by means of computational tests, the performances of the heuristic and a commercial solver. The results prove the effectiveness of the LRCVF heuristic.File | Dimensione | Formato | |
---|---|---|---|
Roberto-Tadei_MPSA.pdf
accesso aperto
Tipologia:
1. Preprint / submitted version [pre- review]
Licenza:
PUBBLICO - Tutti i diritti riservati
Dimensione
253.46 kB
Formato
Adobe PDF
|
253.46 kB | Adobe PDF | Visualizza/Apri |
2018_CAOR_Customized multi-period stochastic assignment.pdf
non disponibili
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
605.58 kB
Formato
Adobe PDF
|
605.58 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2668763
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo