Skip to main content
Erschienen in: Computing 3/2019

20.10.2018

Crowdsourcing planar facility location allocation problems

verfasst von: Mohammad Allahbakhsh, Saeed Arbabi, Mohammadreza Galavii, Florian Daniel, Boualem Benatallah

Erschienen in: Computing | Ausgabe 3/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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–81CrossRef 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–81CrossRef
2.
Zurück zum Zitat 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–130CrossRef 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–130CrossRef
3.
Zurück zum Zitat Antamoshkin Alexander N, Kazakovtsev Lev A (2013) Random search algorithm for the p-median problem. Informatica 37(3):267–278MathSciNet Antamoshkin Alexander N, Kazakovtsev Lev A (2013) Random search algorithm for the p-median problem. Informatica 37(3):267–278MathSciNet
4.
Zurück zum Zitat Archak Nikolay, Sundararajan Arun (2009) Optimal design of crowdsourcing contests. In: ICIS 2009 proceedings, p 200 Archak Nikolay, Sundararajan Arun (2009) Optimal design of crowdsourcing contests. In: ICIS 2009 proceedings, p 200
5.
6.
Zurück zum Zitat 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–460CrossRef 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–460CrossRef
8.
Zurück zum Zitat Cappanera Paola (1999) A survey on obnoxious facility location problems Cappanera Paola (1999) A survey on obnoxious facility location problems
11.
Zurück zum Zitat 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–760CrossRef 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–760CrossRef
12.
Zurück zum Zitat 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:40CrossRef 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:40CrossRef
13.
Zurück zum Zitat Daskin MS, Maass KL (2015) The p-median problem. Springer, Cham, pp 21–45 Daskin MS, Maass KL (2015) The p-median problem. Springer, Cham, pp 21–45
14.
Zurück zum Zitat DiPalantino D, Vojnovic M (2009) Crowdsourcing and all-pay auctions. In: Proceedings of the 10th ACM conference on electronic commerce, ACM, pp 119–128 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.
Zurück zum Zitat Doan A, Ramakrishnan R, Halevy AY (2011) Crowdsourcing systems on the world-wide web. Commun ACM 54(4):86–96CrossRef Doan A, Ramakrishnan R, Halevy AY (2011) Crowdsourcing systems on the world-wide web. Commun ACM 54(4):86–96CrossRef
16.
Zurück zum Zitat 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 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.
Zurück zum Zitat Drezner Z, Brimberg J, Mladenović N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296–304MathSciNetMATHCrossRef Drezner Z, Brimberg J, Mladenović N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296–304MathSciNetMATHCrossRef
18.
Zurück zum Zitat Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, BerlinMATH Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, BerlinMATH
19.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 SecondquarterCrossRef 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 SecondquarterCrossRef
21.
Zurück zum Zitat Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, BerlinMATH Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, BerlinMATH
22.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450–459MATHCrossRef Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450–459MATHCrossRef
25.
Zurück zum Zitat Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(3):462–475MathSciNetMATHCrossRef Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(3):462–475MathSciNetMATHCrossRef
26.
Zurück zum Zitat 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 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.
Zurück zum Zitat Huotari K, Hamari J (2012) Defining gamification: a service marketing perspective. In: Proceeding of the 16th international academic MindTrek conference, ACM, pp 17–22 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.
Zurück zum Zitat 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 AnalysisMathSciNetMATHCrossRef 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 AnalysisMathSciNetMATHCrossRef
29.
Zurück zum Zitat 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–276CrossRef 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–276CrossRef
30.
Zurück zum Zitat Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: the p-centers. SIAM J Appl Math 37(3):513–538MathSciNetMATHCrossRef Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: the p-centers. SIAM J Appl Math 37(3):513–538MathSciNetMATHCrossRef
31.
Zurück zum Zitat Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. ii: the p-medians. SIAM J Appl Math 37(3):539–560MathSciNetMATHCrossRef Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. ii: the p-medians. SIAM J Appl Math 37(3):539–560MathSciNetMATHCrossRef
32.
Zurück zum Zitat 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 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.
Zurück zum Zitat Laporte G, Nickel S, da Gama FS (2015) Introduction to location science. Springer, Cham, pp 1–18 Laporte G, Nickel S, da Gama FS (2015) Introduction to location science. Springer, Cham, pp 1–18
34.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Mirchandani PB (1990) The p-median problem and generalizations. Discrete Locat Theory 1:55–117MathSciNetMATH Mirchandani PB (1990) The p-median problem and generalizations. Discrete Locat Theory 1:55–117MathSciNetMATH
37.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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
40.
Zurück zum Zitat 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 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.
Zurück zum Zitat Stieglitz S, Lattemann C, Robra-Bissantz S, Zarnekow R, Brockmann T (2017) Gamification. Springer, BerlinCrossRef Stieglitz S, Lattemann C, Robra-Bissantz S, Zarnekow R, Brockmann T (2017) Gamification. Springer, BerlinCrossRef
42.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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–386MATH 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–386MATH
44.
Zurück zum Zitat 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 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
Metadaten
Titel
Crowdsourcing planar facility location allocation problems
verfasst von
Mohammad Allahbakhsh
Saeed Arbabi
Mohammadreza Galavii
Florian Daniel
Boualem Benatallah
Publikationsdatum
20.10.2018
Verlag
Springer Vienna
Erschienen in
Computing / Ausgabe 3/2019
Print ISSN: 0010-485X
Elektronische ISSN: 1436-5057
DOI
https://doi.org/10.1007/s00607-018-0670-1

Weitere Artikel der Ausgabe 3/2019

Computing 3/2019 Zur Ausgabe