Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT

被引:21
|
作者
Fadda, Edoardo [1 ,2 ]
Perboli, Guido [2 ,3 ]
Tadei, Roberto [1 ]
机构
[1] Politecn Torino, DAUIN, Turin, Italy
[2] Politecn Torino, DAUIN, ICT City Logist & Enterprises Lab, Turin, Italy
[3] CIRRELT, Montreal, PQ, Canada
关键词
Internet of Things; Multi-period stochastic assignment problem; INTERNET; THINGS;
D O I
10.1016/j.cor.2018.01.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:41 / 50
页数:10
相关论文
共 50 条
  • [1] Multi Period Assignment problem for Social Engagement and Opportunistic IoT
    Fadda, Edoardo
    Mana, Dario
    Perboli, Guido
    Tadei, Roberto
    [J]. 2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 2, 2017, : 760 - 765
  • [2] A multi-period machine assignment problem
    Zhang, XH
    Bard, JF
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 170 (02) : 398 - 415
  • [3] The multi-skilled multi-period workforce assignment problem
    Wang, Haibo
    Alidaee, Bahram
    Ortiz, Jaime
    Wang, Wei
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (18) : 5477 - 5494
  • [4] Multi-period channel assignment
    Mabed, H
    Caminada, A
    Hao, JK
    [J]. PERSONAL WIRELESS COMMUNICATIONS, PROCEEDINGS, 2003, 2775 : 541 - 554
  • [5] An algorithm for solving the multi-period online fulfillment assignment problem
    Mahar, Stephen
    Bretthauer, Kurt M.
    Venkataramanan, M. A.
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 2009, 50 (9-10) : 1294 - 1304
  • [6] A goal programming approach for a multi-period task assignment problem
    Zolfaghari, S
    Jaber, MY
    Hamoudi, H
    [J]. INFOR, 2004, 42 (04) : 299 - 309
  • [7] MULTI-PERIOD STOCHASTIC DOMINANCE
    LEVY, H
    PAROUSH, J
    [J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1974, 21 (04): : 428 - 435
  • [8] The multi-period newsboy problem
    Matsuyama, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (01) : 170 - 188
  • [9] A MULTI-PERIOD TRANSPORTATION PROBLEM
    DENNIS, DE
    [J]. ECONOMETRICA, 1963, 31 (03) : 595 - 595
  • [10] On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
    Escudero, Laureano F.
    Araceli Garin, Maria
    Pizarro, Celeste
    Unzueta, Aitziber
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2018, 70 (03) : 865 - 888