Skip to main content
Erschienen in: The Journal of Supercomputing 9/2018

28.10.2016

New parallel swarm algorithm for smart sensor systems redundancy allocation problems in the Internet of Things

verfasst von: Wei-Chang Yeh, Jsen-Shung Lin

Erschienen in: The Journal of Supercomputing | Ausgabe 9/2018

Einloggen

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

search-config
loading …

Abstract

In recent years, various smart sensor systems have been integrated into the “Internet of Things (IOT)” with the advancement of sensing technology. A redundancy allocation is the safest, most convenient, and most economical way to increase the reliability of smart sensor systems. To solve the smart sensor systems redundancy allocation problem (RAP) in IOT, a cooperative parallel simplified swarm algorithm (pSSO) is presented in this study. This pilot study includes several innovative points. First, research is conducted to use the RAP in IOT. Second, the proposed pSSO is the first parallel algorithm to solve the RAP and the first one to parallelize the simplified swarm optimization (SSO) with the Taguchi method. A simple real-life example regarding shopping and shipping in TAOBAO is given to describe the way how to model the IOT used the RAP. As proof of the success of the proposed pSSO, detailed computational results from solving a series-parallel redundancy allocation problem with a mix of components is presented. The computational results reflect the efficiency of the pSSO proposed.

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 Nemhauser GL, Rinnooy KAHG, Todd MJ (eds) (1989) Optimization. Handbooks in Operations Research and Management Science, vol 1. North-Holland Publishing Co., Amsterdam Nemhauser GL, Rinnooy KAHG, Todd MJ (eds) (1989) Optimization. Handbooks in Operations Research and Management Science, vol 1. North-Holland Publishing Co., Amsterdam
2.
Zurück zum Zitat Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Inc, USAMATH Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Inc, USAMATH
3.
Zurück zum Zitat Zadeh LA (1994) Fuzzy logic, neural networks, and soft computing. Commun ACM 37(3):77–84CrossRef Zadeh LA (1994) Fuzzy logic, neural networks, and soft computing. Commun ACM 37(3):77–84CrossRef
4.
Zurück zum Zitat Tabli EG (2002) A taxonomy of hybrid of metaheuristics. J Heuristics 8:541–544CrossRef Tabli EG (2002) A taxonomy of hybrid of metaheuristics. J Heuristics 8:541–544CrossRef
5.
Zurück zum Zitat Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268–308CrossRef
6.
Zurück zum Zitat Blum C, Roli A (2008) Hybrid Metaheuristics: an introduction. In: Blum C, Blesa Aguilera MJ, Roli A, Sampels M (eds) Hybrid Metaheuristics. Springer, Berlin, pp 1–30CrossRef Blum C, Roli A (2008) Hybrid Metaheuristics: an introduction. In: Blum C, Blesa Aguilera MJ, Roli A, Sampels M (eds) Hybrid Metaheuristics. Springer, Berlin, pp 1–30CrossRef
9.
Zurück zum Zitat Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166CrossRef Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166CrossRef
10.
Zurück zum Zitat Holland JH (1992) Adaptation in natural and artificial systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Science, Cambridge Holland JH (1992) Adaptation in natural and artificial systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Science, Cambridge
11.
Zurück zum Zitat Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. actes de la première conférence européenne sur la vie artificielle. Elsevier Publishing, Paris, France, pp 134–142 Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. actes de la première conférence européenne sur la vie artificielle. Elsevier Publishing, Paris, France, pp 134–142
12.
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol IV, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol IV, pp 1942–1948
13.
Zurück zum Zitat Larrañaga P, Lozano JA (eds) (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers, BostonMATH Larrañaga P, Lozano JA (eds) (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers, BostonMATH
14.
Zurück zum Zitat Storn R (1996) On the usage of differential evolution for function optimization. Biennial Conference of the North American Fuzzy Information Processing Society (NAFIPS), pp 519–523 Storn R (1996) On the usage of differential evolution for function optimization. Biennial Conference of the North American Fuzzy Information Processing Society (NAFIPS), pp 519–523
15.
Zurück zum Zitat Karaboga DD (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department Karaboga DD (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department
16.
Zurück zum Zitat Yeh WC (2008) Study on Quickest Path Networks with Dependent Components and Apply to RAP. NSC97-2221-E-007-099-MY3 (Individual & Basic Research), Multiyear Research Project, “Distinguished Scholars Research Project” granted by National Science Council, Taiwan (2008/08/01\(\sim \)2011/07/31) Yeh WC (2008) Study on Quickest Path Networks with Dependent Components and Apply to RAP. NSC97-2221-E-007-099-MY3 (Individual & Basic Research), Multiyear Research Project, “Distinguished Scholars Research Project” granted by National Science Council, Taiwan (2008/08/01\(\sim \)2011/07/31)
17.
Zurück zum Zitat Yeh WC (2009) A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems. Expert Syst Appl 36:9192–9200CrossRef Yeh WC (2009) A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems. Expert Syst Appl 36:9192–9200CrossRef
18.
Zurück zum Zitat Yeh WC (2012) Simplified swarm optimization in disassembly sequencing problems with learning effects. comput oper res 39:2168–2177CrossRefMATH Yeh WC (2012) Simplified swarm optimization in disassembly sequencing problems with learning effects. comput oper res 39:2168–2177CrossRefMATH
19.
Zurück zum Zitat Yeh WC (2012) Novel swarm optimization for mining classification rules on thyroid gland data. Inf Sci 197:65–76CrossRef Yeh WC (2012) Novel swarm optimization for mining classification rules on thyroid gland data. Inf Sci 197:65–76CrossRef
20.
Zurück zum Zitat Yeh WC (2013) A new parameter-free simplified swarm optimization for artificial neural network training and its application in prediction of time-series. IEEE Trans Neural Netw Learn Syst 24:661–665CrossRef Yeh WC (2013) A new parameter-free simplified swarm optimization for artificial neural network training and its application in prediction of time-series. IEEE Trans Neural Netw Learn Syst 24:661–665CrossRef
21.
Zurück zum Zitat Yeh WC (2014) Orthogonal simplified swarm optimization for the series-parallel redundancy allocation problem with a mix of components. Knowl Based Syst 64:1–12CrossRef Yeh WC (2014) Orthogonal simplified swarm optimization for the series-parallel redundancy allocation problem with a mix of components. Knowl Based Syst 64:1–12CrossRef
22.
Zurück zum Zitat Crainic TG, Toulouse M (2003) Parallel strategies for meta-heuristics. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Norwell, pp 475–513CrossRef Crainic TG, Toulouse M (2003) Parallel strategies for meta-heuristics. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Norwell, pp 475–513CrossRef
23.
Zurück zum Zitat Cantú-Paz E (2011) Migration policies, selection pressure, and parallel evolutionary algorithms. J Heuristics 7:311–334CrossRefMATH Cantú-Paz E (2011) Migration policies, selection pressure, and parallel evolutionary algorithms. J Heuristics 7:311–334CrossRefMATH
24.
Zurück zum Zitat Hung YF, Chen WC (2011) A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm. J Global Optim 51:133–148MathSciNetCrossRefMATH Hung YF, Chen WC (2011) A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm. J Global Optim 51:133–148MathSciNetCrossRefMATH
25.
Zurück zum Zitat Ho SJ, Ho SY, Shu LS (2004) OSA: orthogonal simulated annealing algorithm and Its application to designing mixed H2/H\(\infty \) optimal controllers. IEEE Trans Syst Man Cybern Part A 34:588–600CrossRef Ho SJ, Ho SY, Shu LS (2004) OSA: orthogonal simulated annealing algorithm and Its application to designing mixed H2/H\(\infty \) optimal controllers. IEEE Trans Syst Man Cybern Part A 34:588–600CrossRef
26.
Zurück zum Zitat Fyffe DE, Hines WW, Lee NK (1968) System reliability allocation and a computation algorithm. IEEE Trans Reliab R-17:64–69 Fyffe DE, Hines WW, Lee NK (1968) System reliability allocation and a computation algorithm. IEEE Trans Reliab R-17:64–69
27.
Zurück zum Zitat Chern MS (1992) On the computational complexity of reliability redundancy allocation in a series system. Oper Res Lett 11:309–315MathSciNetCrossRefMATH Chern MS (1992) On the computational complexity of reliability redundancy allocation in a series system. Oper Res Lett 11:309–315MathSciNetCrossRefMATH
28.
Zurück zum Zitat Liang YC, Wu CC (2005) A variable neighborhood descent algorithm for the redundancy allocation problem. Ind Eng Manage Syst 4:109–16 Liang YC, Wu CC (2005) A variable neighborhood descent algorithm for the redundancy allocation problem. Ind Eng Manage Syst 4:109–16
29.
Zurück zum Zitat Hsieh YC (2002) A linear approximation for redundant reliability problems with multiple component choices. Comput Ind Eng 44:91–103CrossRef Hsieh YC (2002) A linear approximation for redundant reliability problems with multiple component choices. Comput Ind Eng 44:91–103CrossRef
30.
Zurück zum Zitat Coit DWC, Smith AE (1996) Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach. Comput Oper Res 23:515–526CrossRefMATH Coit DWC, Smith AE (1996) Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach. Comput Oper Res 23:515–526CrossRefMATH
31.
Zurück zum Zitat Liang YH, Smith AE (2004) An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans Reliab 53(3):417–423CrossRef Liang YH, Smith AE (2004) An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans Reliab 53(3):417–423CrossRef
32.
Zurück zum Zitat Kulturel-Konak S, Smith A, Coit D (2003) Efficiently solving the redundancy allocation problem using Tabu search. IIE Trans 35(6):515–526CrossRef Kulturel-Konak S, Smith A, Coit D (2003) Efficiently solving the redundancy allocation problem using Tabu search. IIE Trans 35(6):515–526CrossRef
33.
Zurück zum Zitat Liang YC, Chen YC (2007) Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab Eng Syst Saf 92:323–331CrossRef Liang YC, Chen YC (2007) Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab Eng Syst Saf 92:323–331CrossRef
34.
Zurück zum Zitat Onishi J, Kimura S, James RJW, Nakagawa Y (2007) Solving the redundancy allocation problem with a mix of components using the improved surrogate constraint method. IEEE Trans Reliab 56(1):94–101CrossRef Onishi J, Kimura S, James RJW, Nakagawa Y (2007) Solving the redundancy allocation problem with a mix of components using the improved surrogate constraint method. IEEE Trans Reliab 56(1):94–101CrossRef
35.
Zurück zum Zitat Yeh WC, Hsieh TJ (2011) Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput Oper Res 38(1):1465–1473 Yeh WC, Hsieh TJ (2011) Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput Oper Res 38(1):1465–1473
Metadaten
Titel
New parallel swarm algorithm for smart sensor systems redundancy allocation problems in the Internet of Things
verfasst von
Wei-Chang Yeh
Jsen-Shung Lin
Publikationsdatum
28.10.2016
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 9/2018
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-016-1903-8

Weitere Artikel der Ausgabe 9/2018

The Journal of Supercomputing 9/2018 Zur Ausgabe