Random-Key Cuckoo Search (RKCS) Applications

  • Aziz OuaarabEmail author
Part of the Springer Tracts in Nature-Inspired Computing book series (STNIC)


This chapter represents the random-key encoding scheme originally performed by Bean (1994) to solve, using genetic algorithms, combinatorial optimization problems for which the solutions are a sequence of integers. It is based on the process of interpreting random real numbers from the continuous space to encode a solution for a given combinatorial space. Based on the approach of Ouaarab et al. (2015a). It is combined random keys with cuckoo search to solve combinatorial problems such as traveling salesman and quadratic assignment problems (Ouaarab et al. 2015b). The idea is to try the transition from continuous to discrete space by avoiding the passage of traditional adaptation operators that can affect the performance of the algorithm and to rely firmly on a direct interpretation of operators used by metaheuristics in the continuous search space.


  1. Avriel M (2012) Nonlinear programming: analysis and methods. Courier Dover PublicationsGoogle Scholar
  2. Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–154CrossRefGoogle Scholar
  3. Burkard RE, Karisch SE, Rendl F (1997) Qaplib-a quadratic assignment problem library. J Global Optim 10(4):391–403MathSciNetCrossRefGoogle Scholar
  4. Burkard RE, Offermann DMJ (1977) Entwurf von schreibmaschinentastaturen mittels quadratischer zuordnungsprobleme. Zeitschrift für Oper Res 21(4):B121–B132zbMATHGoogle Scholar
  5. Christofides N, Benavent E (1989) An exact algorithm for the quadratic assignment problem on a tree. Oper Res 37(5):760–768MathSciNetCrossRefGoogle Scholar
  6. Croes A (1958) A method for solving traveling salesman problems. Oper Res:791–812Google Scholar
  7. Elshafei AN (1977) Hospital layout as a quadratic assignment problem. J Oper Res Soc 28(1):167–179CrossRefGoogle Scholar
  8. Feng Y, Jia K, He Y (2014) An improved hybrid encoding cuckoo search algorithm for 0–1 knapsack problems. In: Computational intelligence and neuroscience, 2014Google Scholar
  9. Krarup J, Pruzan PM (1978) Computer-aided layout design. In: Mathematical programming in use. Springer, pp 75–94Google Scholar
  10. Lanczos C (1964) A precision approximation of the gamma function. J Soc Ind Appl Math Ser B Numer Anal 1(1):86–96MathSciNetCrossRefGoogle Scholar
  11. Nugent CE, Vollmann TE, Ruml J (1968) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16(1):150–173CrossRefGoogle Scholar
  12. Ouaarab A, Ahiod B, Yang X-S (2014) Improved and discrete cuckoo search for solving the travelling salesman problem. In: Yang X-S (eds) Cuckoo search and firefly algorithm. Studies in computational intelligence, vol 516. Springer International Publishing, pp 63–84Google Scholar
  13. Ouaarab A, Ahiod B, Yang X-S (2015a) Random-key cuckoo search for the travelling salesman problem. Soft Comput 19(4):1099–1106CrossRefGoogle Scholar
  14. Ouaarab A, Ahiod B, Yang X-S, Abbad M (2015b) Random-key cuckoo search for the quadratic assignment problem (submitted). Nat ComputGoogle Scholar
  15. Reinelt G (1995) Tsplib 1995. Universitat HeidelbergGoogle Scholar
  16. Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1):33–45CrossRefGoogle Scholar
  17. Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4):443–455MathSciNetCrossRefGoogle Scholar
  18. Taillard ED (1995) Comparison of iterative searches for the quadratic assignment problem. Locat Sci 3(2):87–105CrossRefGoogle Scholar
  19. Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IIE Trans 19(1):107–119Google Scholar
  20. Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver PressGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Ecole Supérieure de Technologie d’EssaouiraEssaouiraMorocco

Personalised recommendations