IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v277y2019i2p643-652.html
   My bibliography  Save this article

A progressive hedging method for the optimization of social engagement and opportunistic IoT problems

Author

Listed:
  • Fadda, Edoardo
  • Perboli, Guido
  • Tadei, Roberto

Abstract

Due to the spread of the social engagement paradigm, several companies are asking people to perform tasks in exchange for a reward. The advantages of this business model are savings in economic and environmental terms. In previous works, it has been proved that the problem of finding the minimum amount of reward such that all tasks are performed is difficult to solve, even for medium-size realistic instances (if more than one type of person is considered). In this paper, we propose a customized version of the progressive hedging algorithm that is able to provide good solutions for large realistic instances. The proposed method reaches the goal of defining a procedure that can be used in real environments.

Suggested Citation

  • Fadda, Edoardo & Perboli, Guido & Tadei, Roberto, 2019. "A progressive hedging method for the optimization of social engagement and opportunistic IoT problems," European Journal of Operational Research, Elsevier, vol. 277(2), pages 643-652.
    • Handle: RePEc:eee:ejores:v:277:y:2019:i:2:p:643-652
    DOI: 10.1016/j.ejor.2019.02.052
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719302164
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.02.052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    2. Michal Kaut & Hercules Vladimirou & Stein W. Wallace & Stavros A. Zenios, 2007. "Stability analysis of portfolio management with conditional value-at-risk," Quantitative Finance, Taylor & Francis Journals, vol. 7(4), pages 397-409.
    3. Jean-Paul Watson & David Woodruff, 2011. "Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems," Computational Management Science, Springer, vol. 8(4), pages 355-370, November.
    4. Walid Klibi & Francis Lasalle & Alain Martel & Soumia Ichoua, 2010. "The Stochastic Multiperiod Location Transportation Problem," Transportation Science, INFORMS, vol. 44(2), pages 221-237, May.
    5. Lamghari, Amina & Dimitrakopoulos, Roussos, 2016. "Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty," European Journal of Operational Research, Elsevier, vol. 253(3), pages 843-855.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Yuchen & Zhang, Jianghua & Yu, Guodong, 2020. "A scenario-based hybrid robust and stochastic approach for joint planning of relief logistics and casualty distribution considering secondary disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    2. Farough Motamed Nasab & Zukui Li, 2023. "Multistage Adaptive Robust Binary Optimization: Uncertainty Set Lifting versus Partitioning through Breakpoints Optimization," Mathematics, MDPI, vol. 11(18), pages 1-24, September.
    3. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    4. Perboli, Guido & Brotcorne, Luce & Bruni, Maria Elena & Rosano, Mariangela, 2021. "A new model for Last-Mile Delivery and Satellite Depots management: The impact of the on-demand economy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lanza, Giacomo & Crainic, Teodor Gabriel & Rei, Walter & Ricciardi, Nicoletta, 2021. "Scheduled service network design with quality targets and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 30-46.
    2. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    3. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    4. Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson, 2020. "Optimization-Driven Scenario Grouping," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 805-821, July.
    5. Fan, Yingjie & Schwartz, Frank & Voß, Stefan, 2017. "Flexible supply chain planning based on variable transportation modes," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 654-666.
    6. Gilles Bareilles & Yassine Laguel & Dmitry Grishchenko & Franck Iutzeler & Jérôme Malick, 2020. "Randomized Progressive Hedging methods for multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 295(2), pages 535-560, December.
    7. Hu, Shaolong & Han, Chuanfeng & Dong, Zhijie Sasha & Meng, Lingpeng, 2019. "A multi-stage stochastic programming model for relief distribution considering the state of road network," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 64-87.
    8. Zhicheng Zhu & Yisha Xiang & Bo Zeng, 2021. "Multicomponent Maintenance Optimization: A Stochastic Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 898-914, July.
    9. Yongxi (Eric) Huang & Yueyue Fan & Chien-Wei Chen, 2014. "An Integrated Biofuel Supply Chain to Cope with Feedstock Seasonality and Uncertainty," Transportation Science, INFORMS, vol. 48(4), pages 540-554, November.
    10. Kazemi Zanjani, Masoumeh & Sanei Bajgiran, Omid & Nourelfath, Mustapha, 2016. "A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 466-476.
    11. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2021. "Inventory routing under stochastic supply and demand," Omega, Elsevier, vol. 102(C).
    12. Fan, Yueyue & Huang, Yongxi & Chen, Chien-Wei, 2012. "Multistage Infrastructure System Design: An Integrated Biofuel Supply Chain against Feedstock Seasonality and Uncertainty," Institute of Transportation Studies, Working Paper Series qt9g8413m5, Institute of Transportation Studies, UC Davis.
    13. Cristian Camilo Marín-Cano & Juan Esteban Sierra-Aguilar & Jesús M. López-Lezama & Álvaro Jaramillo-Duque & Juan G. Villegas, 2020. "A Novel Strategy to Reduce Computational Burden of the Stochastic Security Constrained Unit Commitment Problem," Energies, MDPI, vol. 13(15), pages 1-19, July.
    14. Can Li & Ignacio E. Grossmann, 2019. "A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables," Journal of Global Optimization, Springer, vol. 75(4), pages 921-947, December.
    15. Bismark Singh & Bernard Knueven, 2021. "Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system," Journal of Global Optimization, Springer, vol. 80(4), pages 965-989, August.
    16. Nur Banu Demir & Serhat Gul & Melih Çelik, 2021. "A stochastic programming approach for chemotherapy appointment scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 112-133, February.
    17. Aghalari, Amin & Nur, Farjana & Marufuzzaman, Mohammad, 2021. "Solving a stochastic inland waterway port management problem using a parallelized hybrid decomposition algorithm," Omega, Elsevier, vol. 102(C).
    18. Huang, Zhouchun & Zheng, Qipeng Phil, 2020. "A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1036-1051.
    19. Sushil R. Poudel & Md Abdul Quddus & Mohammad Marufuzzaman & Linkan Bian & Reuben F. Burch V, 2019. "Managing congestion in a multi-modal transportation network under biomass supply uncertainty," Annals of Operations Research, Springer, vol. 273(1), pages 739-781, February.
    20. Crainic, Teodor Gabriel & Perboli, Guido & Rei, Walter & Rosano, Mariangela & Lerma, Veronica, 2024. "Capacity planning with uncertainty on contract fulfillment," European Journal of Operational Research, Elsevier, vol. 314(1), pages 152-175.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:277:y:2019:i:2:p:643-652. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.