Skip to main content

Advertisement

SpringerLink
Log in

Crowdsourcing planar facility location allocation problems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Facility location allocation is key to success of urban design, mainly in designing transport systems, finding locations for warehouse, fire stations and so on. The problem of determining locations of k facilities so that provides service to n customers, also known as p-median problems, is one of the well-known \(\mathcal NP\)-hard problems. Several heuristics have been proposed to solve location allocation problems, each of which has several limitations such as accuracy, time and flexibility, besides their advantages. In this paper, we propose to solve the p-median problems using crowdsourcing and gamification techniques. We present a crowdsourced game, called SolveIt, which employs wisdom and intelligence of the crowd to solve location allocation problems. We have presented a data model for representing p-median problems, designed and implemented the game and tested it using gold standards generated using a genetic algorithm tool. We have also compared the results obtained from SolveIt with the results of a well-known approach called Cooper. The evaluations show the accuracy and superiority of the results obtained from SolveIt players. We have also discussed the limitations and possible applications of the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. http://webtech.uoz.ac.ir/projects/solveit.

  2. https://github.com/webtechuoz/SolveIt.

  3. http://php.net/.

  4. http://mariadb.org/.

  5. http://www.tomnod.com/.

  6. http://genesinspace.org/.

  7. http://smorballgame.org/.

References

  1. Allahbakhsh M, Benatallah B, Ignjatovic A, Motahari-Nezhad HR, Bertino E, Dustdar S (2013) Quality control in crowdsourcing systems: issues and directions. IEEE Internet Comput 17(2):76–81

    Article  Google Scholar 

  2. Allahbakhsh M, Amintoosi H, Kanhere SS (2018) A game-theoretic approach to quality improvement in crowdsourcing tasks. In: Beheshti A, Hashmi M, Dong H, Zhang WE (eds) Service research and innovation. Springer, Cham, pp 116–130

    Chapter  Google Scholar 

  3. Antamoshkin Alexander N, Kazakovtsev Lev A (2013) Random search algorithm for the p-median problem. Informatica 37(3):267–278

    MathSciNet  Google Scholar 

  4. Archak Nikolay, Sundararajan Arun (2009) Optimal design of crowdsourcing contests. In: ICIS 2009 proceedings, p 200

  5. Brimberg J, Drezner Z (2013) A new heuristic for solving the p-median problem in the plane. Comput Oper Res 40(1):427–437

    Article  MathSciNet  MATH  Google Scholar 

  6. Brimberg J, Hansen P, Mladenović N, Taillard ED (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper Res 48(3):444–460

    Article  Google Scholar 

  7. Burkard RE, Çela E, Dollani H (2000) 2-medians in trees with pos/neg weights. Discrete Appl Math 105(1):51–71

    Article  MathSciNet  MATH  Google Scholar 

  8. Cappanera Paola (1999) A survey on obnoxious facility location problems

  9. Cooper L (1963) Location-allocation problems. Oper Res 11(3):331–343

    Article  MathSciNet  MATH  Google Scholar 

  10. Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6(1):37–53

    Article  MathSciNet  MATH  Google Scholar 

  11. Cooper S, Khatib F, Treuille A, Barbero J, Lee J, Beenen M, Leaver-Fay A, Baker D, Popović Z et al (2010) Predicting protein structures with a multiplayer online game. Nature 466(7307):756–760

    Article  Google Scholar 

  12. Daniel F, Kucherbaev P, Cappiello C, Benatallah B, Allahbakhsh M (2018) Quality control in crowdsourcing: a survey of quality attributes, assessment techniques, and assurance actions. ACM Comput Surv 51(1):7:1–7:40

    Article  Google Scholar 

  13. Daskin MS, Maass KL (2015) The p-median problem. Springer, Cham, pp 21–45

    Google Scholar 

  14. DiPalantino D, Vojnovic M (2009) Crowdsourcing and all-pay auctions. In: Proceedings of the 10th ACM conference on electronic commerce, ACM, pp 119–128

  15. Doan A, Ramakrishnan R, Halevy AY (2011) Crowdsourcing systems on the world-wide web. Commun ACM 54(4):86–96

    Article  Google Scholar 

  16. Dow S, Kulkarni A, Klemmer S, Hartmann B (2012) Shepherding the crowd yields better work. In: Proceedings of the ACM 2012 conference on computer supported cooperative work, ACM, pp 1013–1022

  17. Drezner Z, Brimberg J, Mladenović N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296–304

    Article  MathSciNet  MATH  Google Scholar 

  18. Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Berlin

    MATH  Google Scholar 

  19. Feyisetan O, Simperl E, Van Kleek M, Shadbolt N (2015) Improving paid microtasks through gamification and adaptive furtherance incentives. In: Proceedings of the 24th international conference on world wide web, ACM, pp 333–343

  20. Gao H, Liu CH, Wang W, Zhao J, Song Z, Su X, Crowcroft J, Leung KK (2015) A survey of incentive mechanisms for participatory sensing. IEEE Commun Surv Tutor 17(2):918–943 Secondquarter

    Article  Google Scholar 

  21. Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, Berlin

    MATH  Google Scholar 

  22. Goncalves J, Hosio S, Ferreira D, Kostakos V (2014) Game of words: tagging places through crowdsourcing on public displays. In: Proceedings of the 2014 conference on designing interactive systems, DIS ’14, New York, NY, USA, ACM, pp 705–714

  23. Guo S, Parameswaran A, Garcia-Molina H (2012) So who won?: dynamic max discovery with the crowd. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, SIGMOD ’12, New York, NY, USA, ACM, pp 385–396

  24. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450–459

    Article  MATH  Google Scholar 

  25. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(3):462–475

    Article  MathSciNet  MATH  Google Scholar 

  26. Hamari J, Koivisto J, Sarsa H (2014) Does gamification work? A literature review of empirical studies on gamification. In: 2014 47th Hawaii international conference on system sciences (HICSS), IEEE, pp 3025–3034

  27. Huotari K, Hamari J (2012) Defining gamification: a service marketing perspective. In: Proceeding of the 16th international academic MindTrek conference, ACM, pp 17–22

  28. Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761–779 Location Analysis

    Article  MathSciNet  MATH  Google Scholar 

  29. Jia H, Ordonez F, Dessouky MM (2007) Solution approaches for facility location of medical supplies for large-scale emergencies. Comput Ind Eng 52(2):257–276

    Article  Google Scholar 

  30. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: the p-centers. SIAM J Appl Math 37(3):513–538

    Article  MathSciNet  MATH  Google Scholar 

  31. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. ii: the p-medians. SIAM J Appl Math 37(3):539–560

    Article  MathSciNet  MATH  Google Scholar 

  32. Kittur A, Smus B, Khamkar S, Kraut RE (2011) Crowdforge: crowdsourcing complex work. In: Proceedings of the 24th annual ACM symposium on User interface software and technology, ACM, pp 43–52

  33. Laporte G, Nickel S, da Gama FS (2015) Introduction to location science. Springer, Cham, pp 1–18

    Google Scholar 

  34. Little G, Chilton LB, Goldman M, Miller RC (2010) Turkit: human computation algorithms on mechanical turk. In: Proceedings of the 23nd annual ACM symposium on User interface software and technology, ACM, pp 57–66

  35. Luo T, Kanhere SS, Das SK, Tan H-P (2014) Optimal prizes for all-pay contests in heterogeneous crowdsourcing. In: 2014 IEEE 11th international conference on mobile ad hoc and sensor systems (MASS), IEEE, pp 136–144

  36. Mirchandani PB (1990) The p-median problem and generalizations. Discrete Locat Theory 1:55–117

    MathSciNet  MATH  Google Scholar 

  37. Morschheuser B, Hamari J, Koivisto J (2016) Gamification in crowdsourcing: a review. In: 2016 49th Hawaii international conference on system sciences (HICSS), IEEE, pp 4375–4384

  38. Pfeiffer III JJ, Moreno S, La Fond T, Neville J, Gallagher B (2014) Attributed graph models: modeling network structure with correlated attributes. In: Proceedings of the 23rd international conference on World Wide Web, WWW ’14, New York, NY, USA, ACM, pp 831–842

  39. Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48(3):125–142

    Article  MathSciNet  MATH  Google Scholar 

  40. Rogstadius J, Kostakos V, Kittur A, Smus B, Laredo J, Vukovic M (2011) An assessment of intrinsic and extrinsic motivation on task performance in crowdsourcing markets. In: ICWSM

  41. Stieglitz S, Lattemann C, Robra-Bissantz S, Zarnekow R, Brockmann T (2017) Gamification. Springer, Berlin

    Book  Google Scholar 

  42. Venetis P, Garcia-Molina H, Huang K, Polyzotis N (2012) Max algorithms in crowdsourcing environments. In: Proceedings of the 21st international conference on World Wide Web, WWW ’12, New York, NY, USA, ACM, pp 989–998

  43. Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math J First Ser 43:355–386

    MATH  Google Scholar 

  44. Welinder P, Perona P (2010) Online crowdsourcing: rating annotators and obtaining cost-effective labels. In: 2010 IEEE computer society conference on computer vision and pattern recognition workshops (CVPRW), , IEEE, pp 25–32

Download references

Acknowledgements

This research has been partially supported by the University of Zabol, with the grant No.:UoZGR-9517-105.

Author information

Authors and Affiliations

  1. University of Zabol, Zabol, Iran

    Mohammad Allahbakhsh, Saeed Arbabi & Mohammadreza Galavii

  2. Politecnico di Milano, Milan, Italy

    Florian Daniel

  3. The University of New South Wales, Sydney, Australia

    Mohammad Allahbakhsh & Boualem Benatallah

Authors
  1. Mohammad Allahbakhsh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saeed Arbabi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammadreza Galavii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Florian Daniel
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Boualem Benatallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Allahbakhsh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Allahbakhsh, M., Arbabi, S., Galavii, M. et al. Crowdsourcing planar facility location allocation problems. Computing 101, 237–261 (2019). https://doi.org/10.1007/s00607-018-0670-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-018-0670-1

Keywords

Mathematics Subject Classification

Search

Navigation