Skip to main content
SpringerLink
Log in

A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Meta-heuristic search algorithms were successfully used to solve a variety of problems in engineering, science, business, and finance. Meta-heuristic algorithms share common features since they are population-based approaches that use a set of tuning parameters to evolve new solutions based on the natural behavior of creatures. In this paper, we present a novel nature-inspired search optimization algorithm called the capuchin search algorithm (CapSA) for solving constrained and global optimization problems. The key inspiration of CapSA is the dynamic behavior of capuchin monkeys. The basic optimization characteristics of this new algorithm are designed by modeling the social actions of capuchins during wandering and foraging over trees and riverbanks in forests while searching for food sources. Some of the common behaviors of capuchins during foraging that are implemented in this algorithm are leaping, swinging, and climbing. Jumping is an effective mechanism used by capuchins to jump from tree to tree. The other foraging mechanisms exercised by capuchins, known as swinging and climbing, allow the capuchins to move small distances over trees, tree branches, and the extremities of the tree branches. These locomotion mechanisms eventually lead to feasible solutions of global optimization problems. The proposed algorithm is benchmarked on 23 well-known benchmark functions, as well as solving several challenging and computationally costly engineering problems. A broad comparative study is conducted to demonstrate the efficacy of CapSA over several prominent meta-heuristic algorithms in terms of optimization precision and statistical test analysis. Overall results show that CapSA renders more precise solutions with a high convergence rate compared to competitive meta-heuristic methods.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Abedinia O, Amjady N, Ghasemi A (2016) A new metaheuristic algorithm based on shark smell optimization. Complexity 21(5):97–116

    MathSciNet  Google Scholar 

  2. Acevedo J, Pistikopoulos EN (1997) A multiparametric programming approach for linear process engineering problems under uncertainty. Ind Eng Chem Res 36(3):717–728

    Google Scholar 

  3. Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001–1014

    Google Scholar 

  4. Aktemur C, Gusseinov I (2017) A comparison of sequential quadratic programming, genetic algorithm, simulated annealing, particle swarm optimization and hybrid algorithm for the design and optimization of golinski’s speed reducer. Int J Energy Appl Technol 4(2):34–52

    Google Scholar 

  5. Alfaro JWL, Silva JDSE, Rylands AB (2012) How different are robust and gracile capuchin monkeys? An argument for the use of sapajus and cebus. Am J Primatol 74(4):273–286

    Google Scholar 

  6. Arnay R, Fumero F, Sigut J (2017) Ant colony optimization-based method for optic cup segmentation in retinal images. Appl Soft Comput 52:409–417

    Google Scholar 

  7. Arora JS (2004) Optimum design concepts: optimality conditions. In: Introduction to optimum design

  8. Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12

    Google Scholar 

  9. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation. IEEE, pp 4661–4667

  10. Basturk B (2006) An artificial bee colony (ABC) algorithm for numeric function optimization. In: IEEE swarm intelligence symposium, Indianapolis

  11. Baykasoğlu A, Akpinar Ş (2015) Weighted superposition attraction (wsa): a swarm intelligence algorithm for optimization problems-part 2: constrained optimization. Appl Soft Comput 37:396–415

    Google Scholar 

  12. Beni G, Wang J (1993) Swarm intelligence in cellular robotic systems. In: Dario P, Sandini G, Aebischer P (eds) Robots and biological systems: towards a new bionics?. Springer, Berlin, pp 703–712

    Google Scholar 

  13. Bonabeau E, de Recherches D, Marco DF, Dorigo M, Theraulaz G et al (1999) Swarm intelligence: from natural to artificial systems, vol 1. Oxford University Press, Oxford

    MATH  Google Scholar 

  14. Cagnina LC, Esquivel SC, Coello CAC (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32:3

    MATH  Google Scholar 

  15. Chen MK, Lakshminarayanan V, Santos LR (2006) How basic are behavioral biases? Evidence from capuchin monkey trading behavior. J Polit Econ 114(3):517–537

    Google Scholar 

  16. Chumburidze M, Basheleishvili I, Khetsuriani A (2019) Dynamic programming and greedy algorithm strategy for solving several classes of graph optimization problems. Broad Res Artif Intell Neurosci 10(1):101–107

    Google Scholar 

  17. Colorni A, Dorigo M, Maniezzo V et al (1992) Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life, Cambridge, vol 142, pp 134–142

  18. Devi SG, Sabrigiriraj M (2019) A hybrid multi-objective firefly and simulated annealing based algorithm for big data classification. Concurr Comput Pract Exp 31(14):e4985

    Google Scholar 

  19. Dhiman G, Kumar V (2017) Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications. Adv Eng Softw 114:48–70

    Google Scholar 

  20. Dorigo M, Birattari M (2010) Ant colony optimization. Springer, Berlin

    Google Scholar 

  21. Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Micro machine and human science. In: Proceedings of the sixth international symposium on MHS’95. IEEE, pp 39–43

  22. Fausto F, Cuevas E, Valdivia A, González A (2017) A global optimization algorithm inspired in the behavior of selfish herds. Biosystems 160:39–55

    Google Scholar 

  23. Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845

    MathSciNet  MATH  Google Scholar 

  24. Gandomi AH, Yang XS (2011) Benchmark problems in structural optimization. In: Computational optimization, methods and algorithms, vol 356. Springer, Berlin, Heidelberg, pp 259–281

    MATH  Google Scholar 

  25. Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(1):17–35

    Google Scholar 

  26. García-Hernández L, Lorenzo Salas-Morera C, Carmona-Muñoz JAG-H, Salcedo-Sanz S (2020) A novel island model based on coral reefs optimization algorithm for solving the unequal area facility layout problem. Eng Appl Artif Intell 89:103445

    Google Scholar 

  27. García-Hernández L, Lorenzo Salas-Morera JA, Garcia-Hernandez SS-S, de Oliveira JV (2019) Applying the coral reefs optimization algorithm for solving unequal area facility layout problems. Expert Syst Appl 138:112819

    Google Scholar 

  28. Garg H (2014) Solving structural engineering design optimization problems using an artificial bee colony algorithm. J Ind Manag Optim 10(3):777–794

    MathSciNet  MATH  Google Scholar 

  29. Garg H (2016) A hybrid pso-ga algorithm for constrained optimization problems. Appl Math Comput 274:292–305

    MathSciNet  MATH  Google Scholar 

  30. Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68

    Google Scholar 

  31. Gilli M, Maringer D, Schumann E (2019) Numerical methods and optimization in finance. Academic Press, Cambridge

    MATH  Google Scholar 

  32. Grossmann IE, Apap RM, Calfa BA, Garcia-Herreros P, Zhang Q (2017) Mathematical programming techniques for optimization under uncertainty and their application in process systems engineering. Theor Found Chem Eng 51(6):893–909

    Google Scholar 

  33. Harjunkoski I, Grossmann IE (2002) Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput Chem Eng 26(11):1533–1552

    Google Scholar 

  34. He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99

    Google Scholar 

  35. He S, Prempain E, Wu QH (2004) An improved particle swarm optimizer for mechanical design optimization problems. Eng Opt 36(5):585–605

    MathSciNet  Google Scholar 

  36. He S, Wu QH, Saunders JR (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973–990

    Google Scholar 

  37. Hedar A-R, Fukushima M (2006) Derivative-free filter simulated annealing method for constrained continuous global optimization. J Global Optim 35(4):521–549

    MathSciNet  MATH  Google Scholar 

  38. Holland JH et al (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press, Cambridge

    Google Scholar 

  39. Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356

    MathSciNet  MATH  Google Scholar 

  40. Jahani E, Chizari M (2018) Tackling global optimization problems with a novel algorithm-mouth brooding fish algorithm. Appl Soft Comput 62:987–1002

    Google Scholar 

  41. Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: squirrel search algorithm. Swarm Evolut Comput 44:148–175

    Google Scholar 

  42. Kannan BK, Kramer SN (1994) An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116:405–411

    Google Scholar 

  43. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459–471

    MathSciNet  MATH  Google Scholar 

  44. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8(1):687–697

    Google Scholar 

  45. Karasulu B, Korukoglu S (2011) A simulated annealing-based optimal threshold determining method in edge-based segmentation of grayscale images. Appl Soft Comput 11(2):2246–2259

    Google Scholar 

  46. Kaveh A, Dadras A (2017) A novel meta-heuristic optimization algorithm: thermal exchange optimization. Adv Eng Softw 110:69–84

    Google Scholar 

  47. Kaveh A, Farhoudi N (2013) A new optimization method: dolphin echolocation. Adv Eng Softw 59:53–70

    Google Scholar 

  48. Kaveh A, Talatahari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155–182

    MATH  Google Scholar 

  49. Kennedy J, Eberhart R (1995) Particle swarm optimization (pso). In: Proceedings of the IEEE international conference on neural networks, Perth, Australia, pp 1942–1948

  50. Kirkpatrick S, Gelatt CD, P Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680

    MathSciNet  MATH  Google Scholar 

  51. Koppen M, Wolpert DH, Macready WG (2001) Remarks on a recent paper on the “no free lunch” theorems. IEEE Trans Evol Comput 5(3):295–296

    Google Scholar 

  52. KS SR, Murugan S (2017) Memory based hybrid dragonfly algorithm for numerical optimization problems. Expert Syst Appl 83:63–78

    Google Scholar 

  53. Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36–38):3902–3933

    MATH  Google Scholar 

  54. Li MD, Zhao H, Weng XW, Han T (2016) A novel nature-inspired algorithm for optimization: virus colony search. Adv Eng Softw 92:65–88

    Google Scholar 

  55. Li X (2003) A new intelligent optimization method-artificial fish school algorithm. Doctor thesis of Zhejiang University

  56. Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188(2):1567–1579

    MathSciNet  MATH  Google Scholar 

  57. Mao X-B, Min W, Dong J-Y, Wan S-P, Jin Z (2019) A new method for probabilistic linguistic multi-attribute group decision making: application to the selection of financial technologies. Appl Soft Comput 77:155–175

    Google Scholar 

  58. Martin R, Stephen W (2006) Termite: a swarm intelligent routing algorithm for mobilewireless ad-hoc networks. In: Stigmergic optimization, vol 31. Springer, Berlin, Heidelberg, pp 155–184

    Google Scholar 

  59. Mehta VK, Dasgupta B (2012) A constrained optimization algorithm based on the simplex search method. Eng Optim 44(5):537–550

    MathSciNet  Google Scholar 

  60. Mezura-Montes E, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37(4):443–473

    MathSciNet  MATH  Google Scholar 

  61. Mezura-Montes E, Coello CA, Velázquez-Reyes J, Muñoz-Dávila L (2007) Multiple trial vectors in differential evolution for engineering design. Eng Optim 39(5):567–589

    MathSciNet  Google Scholar 

  62. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Google Scholar 

  63. Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 89:228–249

    Google Scholar 

  64. Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053–1073

    MathSciNet  Google Scholar 

  65. Mirjalili S (2016) Sca: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120–133

    Google Scholar 

  66. Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191

    Google Scholar 

  67. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Google Scholar 

  68. Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513

    Google Scholar 

  69. Mlinarić D, Perić T, Matejaš J (2019) Multi-objective programming methodology for solving economic diplomacy resource allocation problem. Croat Oper Res Rev 8:165–174

    MathSciNet  MATH  Google Scholar 

  70. Mosavi MR, Khishe M, Naseri MJ, Parvizi GR, Mehdi AYAT (2019) Multi-layer perceptron neural network utilizing adaptive best-mass gravitational search algorithm to classify sonar dataset. Arch Acoust 44(1):137–151

    Google Scholar 

  71. Mucherino A, Seref O (2007) Monkey search: a novel metaheuristic search for global optimization. In: AIP conference proceedings, vol 953. AIP, pp 162–173

  72. Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203

    Google Scholar 

  73. Foroughi Nematollahi A, Rahiminejad A, Vahidi B (2017) A novel physical based meta-heuristic optimization method known as lightning attachment procedure optimization. Appl Soft Comput 59:596–621

    Google Scholar 

  74. Nguyen P, Kim J-M (2016) Adaptive ecg denoising using genetic algorithm-based thresholding and ensemble empirical mode decomposition. Inf Sci 373:499–511

    Google Scholar 

  75. Noshadi A, Shi J, Lee WS, Shi P, Kalam A (2016) Optimal pid-type fuzzy logic controller for a multi-input multi-output active magnetic bearing system. Neural Comput Appl 27(7):2031–2046

    Google Scholar 

  76. Ottoni EB, Izar P (2008) Capuchin monkey tool use: overview and implications. Evolut Anthropol Issues News Rev Issues News Rev 17(4):171–178

    Google Scholar 

  77. Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69–74

    Google Scholar 

  78. Pereira DG, Afonso A, Medeiros FM (2015) Overview of Friedman’s test and post-hoc analysis. Commun Stat Simulat Comput 44(10):2636–2653

    MathSciNet  Google Scholar 

  79. Perić T, Babić Z, Matejaš J (2018) Comparative analysis of application efficiency of two iterative multi objective linear programming methods (mp method and stem method). CEJOR 26(3):565–583

    MathSciNet  MATH  Google Scholar 

  80. Pulgar-Rubio F, Rivera-Rivas AJ, Pérez-Godoy MD, González P, Carmona CJ, Mefasd-bd MJDJ (2017) multi-objective evolutionary fuzzy algorithm for subgroup discovery in big data environments-a mapreduce solution. Knowl Based Syst 117:70–78

    Google Scholar 

  81. Qi X, Zhu Y, Zhang H (2017) A new meta-heuristic butterfly-inspired algorithm. J Comput Sci 23:226–239

    MathSciNet  Google Scholar 

  82. Qi Y, Jin L, Wang Y, Xiao L, Zhang J (2019) Complex-valued discrete-time neural dynamics for perturbed time-dependent complex quadratic programming with applications. IEEE Trans Neural Netw Learn Syst. https://doi.org/10.1109/TNNLS.2019.2944992

    Article  Google Scholar 

  83. Rashaideh H, Sawaie A, Al-Betar MA, Abualigah LM, Al-Laham MM, Ra’ed M, Braik M (2018) A grey wolf optimizer for text document clustering. J Intell Syst 29(1):814–830

    Google Scholar 

  84. Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    MATH  Google Scholar 

  85. Rodriguez N, Gupta A, Zabala PL, Cabrera-Guerrero G (2018) Optimization algorithms combining (meta) heuristics and mathematical programming and its application in engineering. Math Probl Eng 2018:3967457. https://doi.org/10.1155/2018/3967457

    Article  Google Scholar 

  86. Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612

    Google Scholar 

  87. Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30–47

    Google Scholar 

  88. Saremi S, Mirjalili SZ, Mirjalili SM (2015) Evolutionary population dynamics and grey wolf optimizer. Neural Comput Appl 26(5):1257–1263

    Google Scholar 

  89. Shareef H, Ibrahim AA, Mutlag AH (2015) Lightning search algorithm. Appl Soft Comput 36:315–333

    Google Scholar 

  90. Tabari A, Ahmad A (2017) A new optimization method: electro-search algorithm. Comput Chem Eng 103:1–11

    Google Scholar 

  91. Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (aaa) for nonlinear global optimization. Appl Soft Comput 31:153–171

    Google Scholar 

  92. Wang G-G (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Comput 10(2):151–164

    Google Scholar 

  93. Wang G-G, Guo L, Gandomi AH, Hao G-S, Wang H (2014) Chaotic krill herd algorithm. Inf Sci 274:17–34

    MathSciNet  Google Scholar 

  94. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Google Scholar 

  95. Yang XS (2009) Firefly algorithms for multimodal optimization. In: International symposium on stochastic algorithms. Springer, pp 169–178

  96. Yang X-S (2010) Nature-inspired metaheuristic algorithms. Luniver Press, London

    Google Scholar 

  97. Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), vol 284. Springer, Berlin, Heidelberg, pp 65–74

    Google Scholar 

  98. Yang XS (2012) Flower pollination algorithm for global optimization. In: International conference on unconventional computing and natural computation. Springer, pp 240–249

  99. Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature and biologically inspired computing (NaBIC). IEEE, pp 210–214

  100. Yazdani M, Jolai F (2016) Lion optimization algorithm (loa): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24–36

    Google Scholar 

  101. Ye Y, Li J, Li K, Hui F (2018) Cross-docking truck scheduling with product unloading/loading constraints based on an improved particle swarm optimisation algorithm. Int J Prod Res 56(16):5365–5385

    Google Scholar 

  102. Yong W, Tao W, Cheng-Zhi Z, Hua-Juan H (2016) A new stochastic optimization approach-dolphin swarm optimization algorithm. Int J Comput Intell Appl 15(02):1650011

    Google Scholar 

  103. Zaidan AA, Bayda Atiya MR, Bakar A, Zaidan BB (2019) A new hybrid algorithm of simulated annealing and simplex downhill for solving multiple-objective aggregate production planning on fuzzy environment. Neural Comput Appl 31(6):1823–1834

    Google Scholar 

  104. Zhalechian M, Tavakkoli-Moghaddam R, Rahimi Y, Jolai F (2017) An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental design. Appl Soft Comput 52:699–713

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Al-Balqa Applied University, Salt, Jordan

    Malik Braik & Heba Al-Hiary

  2. Computer Science Department, Southern Connecticut State University, 501 Crescent St., New Haven, CT, 06515, USA

    Alaa Sheta

Authors
  1. Malik Braik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alaa Sheta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heba Al-Hiary
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Malik Braik.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A. Objective test problems used in this work

Unimodal test functions

A description of the unimodal test functions (\(\hbox{F}_1\)–\(\hbox{F}_7\)) is shown in Table 19.

Table 19 Unimodal benchmark functions
Full size table

Multimodal test functions

A description of the multimodal test functions (F8-\(\hbox{F}_{13}\)) is shown in Table 20.

Table 20 Multimodal benchmark functions
Full size table

Fixed-dimension multimodal test functions

A description of the fixed-dimension multimodal test functions (\(\hbox{F}_{14}\)–\(\hbox{F}_{23}\)) is shown in Table 21.

Table 21 Fixed-dimension multimodal benchmark functions
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Braik, M., Sheta, A. & Al-Hiary, H. A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm. Neural Comput & Applic 33, 2515–2547 (2021). https://doi.org/10.1007/s00521-020-05145-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-05145-6

Keywords

Search

Navigation