Skip to main content
Erschienen in: Cluster Computing 3/2019

01.01.2019

Benchmarking based search framework

verfasst von: A. S. Xie

Erschienen in: Cluster Computing | Ausgabe 3/2019

Einloggen

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

search-config
loading …

Abstract

Most of the issues in science, engineering, and management can be turned into optimization problems by modeling. However, for most of which, the operations research methods based on rigid mathematical logic can do nothing, intelligent methods are helpful. Traditionally, the so-called intelligent methods, whose “intelligence” is mainly dependent on the probability rules of their operators. Thus there are always some probability equations or mathematical formulations that need to be updated. This paper proposed a new framework for intelligent optimization/search, which is based on artful organizing tactics rather than “intelligent” probability rules. Thus it needs no probability equations. In addition, it is helpful to balance the exploration and the exploitation, keep the population diversity and avoid useless and ineffective repetitious operations. The mentioned above had been proved by theoretical analyses and simulation experiments. Of course, any method has its disadvantages, the defects and the possible improvement measures of this framework were summarized in the conclusion part.

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

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!

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"

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!

Literatur
1.
Zurück zum Zitat Abdi, H., Coefficient, TKrc: The Kendall Rank Correlation Coefficient. Sage, Thousand Oaks, CA (2007) Abdi, H., Coefficient, TKrc: The Kendall Rank Correlation Coefficient. Sage, Thousand Oaks, CA (2007)
2.
Zurück zum Zitat Casanovas, J.M., Montserrat, M.: A new Minkowski distance based on induced aggregation operators. Int. J. Comput. Intell. Syst. 2011(2), 123–133 (2012) Casanovas, J.M., Montserrat, M.: A new Minkowski distance based on induced aggregation operators. Int. J. Comput. Intell. Syst. 2011(2), 123–133 (2012)
3.
Zurück zum Zitat Castro, L.N.D., José, F.: Artificial immune systems: Part I—basic theory and application. In: Paper presented at the Universidade Estadual de Campinas, Dezembro de, Tech. Rep, p. 210 (1999) Castro, L.N.D., José, F.: Artificial immune systems: Part I—basic theory and application. In: Paper presented at the Universidade Estadual de Campinas, Dezembro de, Tech. Rep, p. 210 (1999)
4.
Zurück zum Zitat Castro, L.N.D., Zuben, F.J.V.: The clonal selection algorithm with engineering applications. In: Paper presented at the Proceedings of GECCO, (2000) Castro, L.N.D., Zuben, F.J.V.: The clonal selection algorithm with engineering applications. In: Paper presented at the Proceedings of GECCO, (2000)
6.
Zurück zum Zitat Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: an autocatalytic optimizing process technical report 91-016. Clustering 3(12), 340 (1991) Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: an autocatalytic optimizing process technical report 91-016. Clustering 3(12), 340 (1991)
7.
Zurück zum Zitat Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: International Symposium on MICRO Machine and Human Science, pp. 39–43. (1995) Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: International Symposium on MICRO Machine and Human Science, pp. 39–43. (1995)
8.
Zurück zum Zitat Erol, O.K., Eksin, I.: A new optimization method: big Bang-Big Crunch. Adv. Eng. Softw. 37(2), 106–111 (2006)CrossRef Erol, O.K., Eksin, I.: A new optimization method: big Bang-Big Crunch. Adv. Eng. Softw. 37(2), 106–111 (2006)CrossRef
9.
Zurück zum Zitat Eusuff, M.M., Lansey, K.E.: Water distribution network design using the shuffled frog leaping algorithm. In: Paper Presented at the World Water and Environmental Resources Congress (2001) Eusuff, M.M., Lansey, K.E.: Water distribution network design using the shuffled frog leaping algorithm. In: Paper Presented at the World Water and Environmental Resources Congress (2001)
10.
Zurück zum Zitat Fogel, D.: Artificial Intelligence Through Simulated Evolution, pp. 227–296. Wiley, Oxford (1966)MATH Fogel, D.: Artificial Intelligence Through Simulated Evolution, pp. 227–296. Wiley, Oxford (1966)MATH
11.
Zurück zum Zitat Formato, R.A.: Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog. Electromagn. Res. 77, 425–491 (2007)CrossRef Formato, R.A.: Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog. Electromagn. Res. 77, 425–491 (2007)CrossRef
13.
Zurück zum Zitat Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)MathSciNetMATHCrossRef Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)MathSciNetMATHCrossRef
14.
Zurück zum Zitat Gordon, N., Wagner, I.A., Brucks, A.M.: Discrete bee dance algorithms for pattern formation on a grid. In: Paper presented at the IEEE/Wic International Conference on Intelligent Agent Technology (2003) Gordon, N., Wagner, I.A., Brucks, A.M.: Discrete bee dance algorithms for pattern formation on a grid. In: Paper presented at the IEEE/Wic International Conference on Intelligent Agent Technology (2003)
15.
Zurück zum Zitat Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222(3), 175–184 (2013)MathSciNetCrossRef Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222(3), 175–184 (2013)MathSciNetCrossRef
16.
Zurück zum Zitat Hauke, J., Kossowski, T.: Comparison of values of Pearson’s and Spearman’s correlation coefficients on the same sets of data. Quaest. Geogr. 30(2), 87–93 (2011)CrossRef Hauke, J., Kossowski, T.: Comparison of values of Pearson’s and Spearman’s correlation coefficients on the same sets of data. Quaest. Geogr. 30(2), 87–93 (2011)CrossRef
17.
Zurück zum Zitat Havens, T.C., Spain, C.J., Salmon, N.G., Keller, J. M.: Roach infestation optimization. In: Paper presented at the Swarm Intelligence Symposium (2008) Havens, T.C., Spain, C.J., Salmon, N.G., Keller, J. M.: Roach infestation optimization. In: Paper presented at the Swarm Intelligence Symposium (2008)
18.
Zurück zum Zitat Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Paper presented at the International Conference on Parallel Problem Solving from Nature (2008) Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Paper presented at the International Conference on Parallel Problem Solving from Nature (2008)
19.
Zurück zum Zitat Hillis, W.D.: Co-evolving parasites improve simulated evolution as an optimization procedure. Phys. D 42(1–3), 228–234 (1990)CrossRef Hillis, W.D.: Co-evolving parasites improve simulated evolution as an optimization procedure. Phys. D 42(1–3), 228–234 (1990)CrossRef
20.
Zurück zum Zitat Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. Control Artif. Intell. Univ. Michigan Press 6(2), 126–137 (1975) Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. Control Artif. Intell. Univ. Michigan Press 6(2), 126–137 (1975)
21.
Zurück zum Zitat Ingo, R.: Evolution strategy: optimization of technical systems by means of biological evolution. Fromman-Holzboog Stuttgart 104, 15–16 (1973) Ingo, R.: Evolution strategy: optimization of technical systems by means of biological evolution. Fromman-Holzboog Stuttgart 104, 15–16 (1973)
22.
Zurück zum Zitat Godden, Jeffrey W., Xue, L., Bajorath, J.: Combinatorial preferences affect molecular similarity/diversity calculations using binary fingerprints and Tanimoto coefficients. J. Chem. Inf. Comput. Sci. 40(1), 163–166 (2000)CrossRef Godden, Jeffrey W., Xue, L., Bajorath, J.: Combinatorial preferences affect molecular similarity/diversity calculations using binary fingerprints and Tanimoto coefficients. J. Chem. Inf. Comput. Sci. 40(1), 163–166 (2000)CrossRef
23.
Zurück zum Zitat Jung, S.H.: Queen-bee evolution for genetic algorithms. Electron. Lett. 39(6), 575–576 (2003)CrossRef Jung, S.H.: Queen-bee evolution for genetic algorithms. Electron. Lett. 39(6), 575–576 (2003)CrossRef
24.
Zurück zum Zitat Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report—TR06. (2005) Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report—TR06. (2005)
25.
Zurück zum Zitat Kaveh, A., Khayatazad, M.: A new meta-heuristic method: ray optimization. Comput. Struct. 112–113(4), 283–294 (2012)CrossRef Kaveh, A., Khayatazad, M.: A new meta-heuristic method: ray optimization. Comput. Struct. 112–113(4), 283–294 (2012)CrossRef
26.
Zurück zum Zitat Kaveh, A., Talatahari, S.: A novel heuristic optimization method: charged system search. Acta Mech. 213(3), 267–289 (2010)MATHCrossRef Kaveh, A., Talatahari, S.: A novel heuristic optimization method: charged system search. Acta Mech. 213(3), 267–289 (2010)MATHCrossRef
27.
Zurück zum Zitat Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Paper presented at the IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, (1997) Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Paper presented at the IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, (1997)
28.
29.
Zurück zum Zitat Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection. Complex Adapt. Syst. 4, 87–112 (1992)MATH Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection. Complex Adapt. Syst. 4, 87–112 (1992)MATH
30.
Zurück zum Zitat Krishnanand, K.N., Ghose, D.: Detection of multiple source locations using a glowworm metaphor with applications to collective robotics. In: Proceedings of the Paper Presented at the Swarm Intelligence Symposium, (2005) Krishnanand, K.N., Ghose, D.: Detection of multiple source locations using a glowworm metaphor with applications to collective robotics. In: Proceedings of the Paper Presented at the Swarm Intelligence Symposium, (2005)
31.
Zurück zum Zitat Krivulin, N.: Algebraic solutions to multidimensional minimax location problems with Chebyshev distance. WSEAS Trans. Math. 10(6), 191–200 (2012) Krivulin, N.: Algebraic solutions to multidimensional minimax location problems with Chebyshev distance. WSEAS Trans. Math. 10(6), 191–200 (2012)
32.
Zurück zum Zitat Lavoie, T., Merlo, E.: An accurate estimation of the Levenshtein distance using metric trees and Manhattan distance. In: Proceedings of the 6th International Workshop on the Paper presented at the Software Clones (IWSC), (2012) Lavoie, T., Merlo, E.: An accurate estimation of the Levenshtein distance using metric trees and Manhattan distance. In: Proceedings of the 6th International Workshop on the Paper presented at the Software Clones (IWSC), (2012)
33.
Zurück zum Zitat Li, X.: An optimizing method based on autonomous animats: fish-swarm algorithm. Syst. Eng. Theory Pract. 22(11), 32–38 (2002). (In Chinese) Li, X.: An optimizing method based on autonomous animats: fish-swarm algorithm. Syst. Eng. Theory Pract. 22(11), 32–38 (2002). (In Chinese)
34.
Zurück zum Zitat Linhares, A.: Preying on optima: a predatory search strategy for combinatorial problems. In: Paper presented at the IEEE International Conference on Systems, Man, and Cybernetics (1998) Linhares, A.: Preying on optima: a predatory search strategy for combinatorial problems. In: Paper presented at the IEEE International Conference on Systems, Man, and Cybernetics (1998)
35.
Zurück zum Zitat Lučić, P., Teodorović, D.: Computing with bees: attacking complex transportation engineering problems. Int. J. Artif. Intell. Tools 12(3), 375–394 (2003)CrossRef Lučić, P., Teodorović, D.: Computing with bees: attacking complex transportation engineering problems. Int. J. Artif. Intell. Tools 12(3), 375–394 (2003)CrossRef
36.
Zurück zum Zitat Meng, X., Liu, Y., Gao, X., Zhang, H.: A New Bio-inspired Algorithm: Chicken Swarm Optimization. Springer, Cham (2014) Meng, X., Liu, Y., Gao, X., Zhang, H.: A New Bio-inspired Algorithm: Chicken Swarm Optimization. Springer, Cham (2014)
37.
Zurück zum Zitat Meng, X.B., Gao, X.Z., Lu, L., Liu, Y., Zhang, H.: A new bio-inspired optimisation algorithm: bird swarm algorithm. J. Exp. Theor. Artif. Intell. 28, 673–687 (2015)CrossRef Meng, X.B., Gao, X.Z., Lu, L., Liu, Y., Zhang, H.: A new bio-inspired optimisation algorithm: bird swarm algorithm. J. Exp. Theor. Artif. Intell. 28, 673–687 (2015)CrossRef
38.
Zurück zum Zitat Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69(3), 46–61 (2014)CrossRef Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69(3), 46–61 (2014)CrossRef
39.
Zurück zum Zitat Mladenovic, N.: A variable neighborhood algorithm-a new metaheuristic for combinatorial optimization. In: Papers Presented at Optimization Days, p. 112 (1995) Mladenovic, N.: A variable neighborhood algorithm-a new metaheuristic for combinatorial optimization. In: Papers Presented at Optimization Days, p. 112 (1995)
41.
Zurück zum Zitat Mucherino, A., Seref, O.: Monkey search: a novel metaheuristic search for global optimization. In: Paper presented at the Data Mining, Systems Analysis & Optimization in Biomedicine (2007) Mucherino, A., Seref, O.: Monkey search: a novel metaheuristic search for global optimization. In: Paper presented at the Data Mining, Systems Analysis & Optimization in Biomedicine (2007)
42.
Zurück zum Zitat Mühlenbein, H., Paass, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. Springer, Berlin (1996)CrossRef Mühlenbein, H., Paass, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. Springer, Berlin (1996)CrossRef
43.
Zurück zum Zitat Murase, H.: Finite element inverse analysis using a photosynthetic algorithm. Comput. Electr. Agric. 29(1–2), 115–123 (2000)CrossRef Murase, H.: Finite element inverse analysis using a photosynthetic algorithm. Comput. Electr. Agric. 29(1–2), 115–123 (2000)CrossRef
44.
Zurück zum Zitat Nakrani, S., Tovey, C.: On honey bees and dynamic server allocation in internet hosting centers. Adapt. Behav. 12(3–4), 223–240 (2004)CrossRef Nakrani, S., Tovey, C.: On honey bees and dynamic server allocation in internet hosting centers. Adapt. Behav. 12(3–4), 223–240 (2004)CrossRef
45.
Zurück zum Zitat Niedermeier, R., Sanders, P.: On the Manhattan-Distance Between Points on Space-Filling Mesh-Indexings. Univ., Fak. für Informati (1996) Niedermeier, R., Sanders, P.: On the Manhattan-Distance Between Points on Space-Filling Mesh-Indexings. Univ., Fak. für Informati (1996)
46.
Zurück zum Zitat Niwattanakul, S., Singthongchai, J., Naenudorn, E., Wanapu, S.: Using of jaccard coefficient for keywords similarity. Lect. Notes Eng. Comput. Sci. 2202(1), 13–15 (2013) Niwattanakul, S., Singthongchai, J., Naenudorn, E., Wanapu, S.: Using of jaccard coefficient for keywords similarity. Lect. Notes Eng. Comput. Sci. 2202(1), 13–15 (2013)
47.
Zurück zum Zitat Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P Report 826 (1989) Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P Report 826 (1989)
48.
Zurück zum Zitat Pan, W.C.: Using fruit fly optimization algorithm optimized general regression neural network to construct the operating performance of enterprises model. J. Taiyuan Univ. Technol. 4, 002 (2011) Pan, W.C.: Using fruit fly optimization algorithm optimized general regression neural network to construct the operating performance of enterprises model. J. Taiyuan Univ. Technol. 4, 002 (2011)
49.
Zurück zum Zitat Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. 22(3), 52–67 (2002)MathSciNetCrossRef Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. 22(3), 52–67 (2002)MathSciNetCrossRef
50.
Zurück zum Zitat Rajabzadeh, M., Tabibian, S., Akbari, A., Nasersharif, B.: Improved dynamic match phone lattice search using Viterbi scores and Jaro Winkler distance for keyword spotting system. In: Paper Presented at the CSI International Symposium on Artificial Intelligence and Signal Processing (2012) Rajabzadeh, M., Tabibian, S., Akbari, A., Nasersharif, B.: Improved dynamic match phone lattice search using Viterbi scores and Jaro Winkler distance for keyword spotting system. In: Paper Presented at the CSI International Symposium on Artificial Intelligence and Signal Processing (2012)
51.
Zurück zum Zitat Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf. Sci. 183(1), 1–15 (2012)MathSciNetCrossRef Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf. Sci. 183(1), 1–15 (2012)MathSciNetCrossRef
53.
Zurück zum Zitat Reynolds, R.G.: An introduction to cultural algorithms. In: Proceedings of the Third Annual Conference on Evolutionary Programming, pp. 131–139 (1994) Reynolds, R.G.: An introduction to cultural algorithms. In: Proceedings of the Third Annual Conference on Evolutionary Programming, pp. 131–139 (1994)
54.
Zurück zum Zitat Yang, X.S.: New enzyme algorithm, Tikhonov regularization and inverse parabolic analysis. Adv. Comput. Methods Sci. Eng. 4, 1880–1883 (2005) Yang, X.S.: New enzyme algorithm, Tikhonov regularization and inverse parabolic analysis. Adv. Comput. Methods Sci. Eng. 4, 1880–1883 (2005)
55.
Zurück zum Zitat Shah-Hosseini, H.: Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimisation. Int. J. Comput. Sci. Eng. 6(1–2), 132–140 (2011) Shah-Hosseini, H.: Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimisation. Int. J. Comput. Sci. Eng. 6(1–2), 132–140 (2011)
56.
Zurück zum Zitat Shi, Y., Eberhart, R.: Modified particle swarm optimizer. In: Paper Presented at the IEEE International Conference on Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence (1998) Shi, Y., Eberhart, R.: Modified particle swarm optimizer. In: Paper Presented at the IEEE International Conference on Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence (1998)
57.
Zurück zum Zitat Simon, D.: Biogeography-based optimization. Evolut. Comput. IEEE Trans. 12(6), 702–713 (2008)CrossRef Simon, D.: Biogeography-based optimization. Evolut. Comput. IEEE Trans. 12(6), 702–713 (2008)CrossRef
59.
Zurück zum Zitat Storn, R., Price, K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)MathSciNetMATHCrossRef Storn, R., Price, K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)MathSciNetMATHCrossRef
61.
Zurück zum Zitat Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D.P., Fricker, M.D., Nakagaki, T.: Rules for biologically inspired adaptive network design. Science 327(5964), 439–442 (2010)MathSciNetMATHCrossRef Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D.P., Fricker, M.D., Nakagaki, T.: Rules for biologically inspired adaptive network design. Science 327(5964), 439–442 (2010)MathSciNetMATHCrossRef
62.
Zurück zum Zitat Webster, B., Bernhard, P.J., Webster, B., Bernhard, P.J.: A local search optimization algorithm based on natural principles of gravitation. In: Paper Presented at the International Conference on Information and Knowledge Engineering, Las Vegas, Nevada, USA, Ike’03, 23–26 June 2003 Webster, B., Bernhard, P.J., Webster, B., Bernhard, P.J.: A local search optimization algorithm based on natural principles of gravitation. In: Paper Presented at the International Conference on Information and Knowledge Engineering, Las Vegas, Nevada, USA, Ike’03, 23–26 June 2003
63.
Zurück zum Zitat Wedde, H.F., Farooq, M., Zhang, Y.: BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior. Lecture Notes in Computer Science, pp. 83–94. Springer, Berlin (2004) Wedde, H.F., Farooq, M., Zhang, Y.: BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior. Lecture Notes in Computer Science, pp. 83–94. Springer, Berlin (2004)
64.
Zurück zum Zitat Yang, S.X.: PDGA: the primal–dual genetic algorithm. Des. Appl. Hybrid Intell. Syst. 104, 214–223 (2003) Yang, S.X.: PDGA: the primal–dual genetic algorithm. Des. Appl. Hybrid Intell. Syst. 104, 214–223 (2003)
65.
Zurück zum Zitat Yang, X.S.: Engineering Optimizations via Nature-Inspired Virtual Bee Algorithms. In: Paper presented at the International Work-Conference on the Interplay Between Natural and Artificial Computation, Berlin Heidelberg (2005) Yang, X.S.: Engineering Optimizations via Nature-Inspired Virtual Bee Algorithms. In: Paper presented at the International Work-Conference on the Interplay Between Natural and Artificial Computation, Berlin Heidelberg (2005)
66.
Zurück zum Zitat Yang, X.S.: Firefly algorithms for multimodal optimization. Mathematics 5792, 169–178 (2009)MathSciNetMATH Yang, X.S.: Firefly algorithms for multimodal optimization. Mathematics 5792, 169–178 (2009)MathSciNetMATH
67.
Zurück zum Zitat Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol. 284, 65–74 (2010)MATH Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol. 284, 65–74 (2010)MATH
68.
Zurück zum Zitat Yang, X.S., Deb, S.: Cuckoo Search via Lévy flights. In: Paper Presented at the World Congress on Nature & Biologically Inspired Computing, NaBIC, (2009) Yang, X.S., Deb, S.: Cuckoo Search via Lévy flights. In: Paper Presented at the World Congress on Nature & Biologically Inspired Computing, NaBIC, (2009)
69.
Zurück zum Zitat Yu-Hong, C., Fu-Chun, S., Wei-Jun, W., Chun-Ming, Y.: An improved particle swarm optimization algorithm with search space zoomed factor and attractor. Chin. J. Comput. 34(1), 115–130 (2011)CrossRef Yu-Hong, C., Fu-Chun, S., Wei-Jun, W., Chun-Ming, Y.: An improved particle swarm optimization algorithm with search space zoomed factor and attractor. Chin. J. Comput. 34(1), 115–130 (2011)CrossRef
70.
Zurück zum Zitat Zelinka, I., Lampinen, J.: SOMA—Self-Organizing Migrating Algorithm. In: Paper Presented at the 6th International Conference on Soft Computing, Brno, Czech Republic, (2000) Zelinka, I., Lampinen, J.: SOMA—Self-Organizing Migrating Algorithm. In: Paper Presented at the 6th International Conference on Soft Computing, Brno, Czech Republic, (2000)
71.
Zurück zum Zitat Zong, W.G., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simul. Trans. Soc. Model. Simul. Int. 76(2), 60–68 (2001) Zong, W.G., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simul. Trans. Soc. Model. Simul. Int. 76(2), 60–68 (2001)
Metadaten
Titel
Benchmarking based search framework
verfasst von
A. S. Xie
Publikationsdatum
01.01.2019
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 3/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2881-9

Weitere Artikel der Ausgabe 3/2019

Cluster Computing 3/2019 Zur Ausgabe

Premium Partner