Trade-off between exploration and exploitation with genetic algorithm using a novel selection operator

Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Oxford

Osyczka A (2002) Evolutionary algorithms for single and multi-criteria design optimization. Springer, Physica-Verlag, Berlin

Corriveau G, Guilbault R, Tahan A, Sabourin R (2016) Bayesian network as an adaptive parameter setting approach for genetic algorithms. Complex Intell Syst 2(1):1–22

Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Publishing Company, Reading

Sivaraj R, Ravichandran T (2011) A review of selection methods in genetic algorithm. Int J Eng Sci Technol 3(5):3792–3797

Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. Found Genet Algorithms 1:69–93

Pham DT, Castellani M (2010) Adaptive selection routine for evolutionary algorithms. Proc Inst Mech Eng Part I J Syst Control Eng 224(6):623–633

Abd-Rahman R, Ramli R, Jamari Z, Ku-Mahamud KR (2016) Evolutionary algorithm with roulette-tournament selection for solving aquaculture diet formulation. Math Probl Eng 2016:1–10

Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci 180(17):3182–3191

Ramli R (2004) An evolutionary algorithm for the nurse scheduling problem with circadian rhythms. Ph.D. thesis, University Sains Malaysia

Ramli R, Ibrahim H, Shung LT (2013) Innovative crossover and mutation in a genetic algorithm based approach to a campus bus driver scheduling problem with break consideration and embedded overtime. Appl Math Inf Sci 7(5):1921–1928

Yeh HD, Lin CC, Yang BJ (2014) Applying hybrid heuristic approach to identify contaminant source information in transient groundwater flow systems. Math Probl Eng 2014:1–13

Asyikin S.N, Razali M (2011) Menu planning model for Malaysian boarding school using self-adaptive hybrid genetic algorithms. Ph.D. thesis, University Utara Malaysia

Razali N.M, Geraghty J (2011) Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the world congress on engineering, vol 2. International Association of Engineers Hong Kong, pp 1134–1139

Aibinu AM, Salau HB, Rahman NA, Nwohu MN, Akachukwu C (2016) A novel clustering based genetic algorithm for route optimization. Eng Sci Technol Int J 19(4):2022–2034

Yan HS, Wan XQ, Xiong FL (2015) Integrated production planning and scheduling for a mixed batch job-shop based on alternant iterative genetic algorithm. J Oper Res Soc 66(8):1250–1258

Sharma A, Mehta A (2013) Review paper of various selection methods in genetic algorithm. Int J Adv Res Comput Sci Softw Eng 3(7):1476–1479

Mashohor S, Evans J.R, Arslan T (2005) Elitist selection schemes for genetic algorithm based printed circuit board inspection system. In The 2005 IEEE congress on: evolutionary computation, vol 2, pp 974–978

Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122–128

Baker J.E (1985) Adaptive selection methods for genetic algorithms. :In Proceedings of an International Conference on Genetic Algorithms and their applications. Hillsdale, pp 101–111

Back T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 1: basic algorithms and operators, vol 1. CRC Press, Boca Raton

Blickle T, Thiele L (1995) A comparison of selection schemes used in genetic algorithms. TIK-report

Whitley L.D (1989) The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In: ICGA, vol 89. Fairfax, pp 116–123

Back T (1996) Evolutionary algorithms in theory and practice. Oxford Press, Oxford

Julstrom B.A (1999) It’s all the same to me: Revisiting rank-based probabilities and tournaments. In: Proceedings of the congress on evolutionary computation, vol 2. IEEE, pp 1501–1505

Eiben A.E, Schut M.C, de-Wilde A.R (2006) Is self-adaptation of selection pressure and population size possible? A case study. In: Parallel problem solving from nature-PPSN IX, pp 900–909

Schell T, Wegenkittl S (2001) Looking beyond selection probabilities: adaptation of the $$\chi ^2$$ χ 2 measure for the performance analysis selection methods in GAs. Evol Comput 9(2):243–256

Larranaga P, Kuijpers CM, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the traveling salesman problem: a review of representations and operators. Artif Intell Rev 13:129–170

Ha MH, Bostel N, Langevin A, Rousseau LM (2014) An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Comput Oper Res 43:9–19

Ho W, Ji P (2009) An integrated scheduling problem of PCB components on sequential pick-and-place machines: mathematical models and heuristic solutions. Expert Syst Appl 36(3):7002–7010

Ezziane Z (2006) Applications of artificial intelligence in bioinformatics: a review. Expert Syst Appl 30(1):2–10

Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton

Helsgaun K (2000) An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106–130

Huang HX, Li JC, Xiao CL (2015) A proposed iteration optimization approach integrating backpropagation neural network with genetic algorithm. Expert Syst Appl 42(1):146–155

Ruiz E, Albareda-Sambola M, Fernandez E, Resende MG (2015) A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput Oper Res 57:95–108

Zhang X, Zhang Y, Hu Y, Deng Y, Mahadevan S (2013) An adaptive amoeba algorithm for constrained shortest paths. Expert Syst Appl 40(18):7607–7616

Zhang X, Mahadevan S, Deng Y (2015) Physarum-inspired applications in graph-optimization problems. Parallel Process Lett 25(01):1540005

Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biometr Bioinform (IJBB) 3(6):96–105

Bhattacharyya M, Bandyopadhyay AK (2008) Comparative study of some solution methods for traveling salesman problem using genetic algorithms. Cybern Syst 40(1):1–24

Hussain A, Muhammad YS, Sajid MN, Hussain I, Shoukry MA, Gani S (2017) Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput Intell Neurosci 2017:1–7

Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140(3):606–617

Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl 39(10):8947–8953

Philip A, Taofiki AA, Kehinde O (2011) A genetic algorithm for solving traveling salesman problem. Int J Adv Comput Sci Appl 2(1):26–29

Potvin JY (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63(3):337–370

Reinelt G (1995) TSPLIB. TSPLIB95 http://www.iwr.uni-heidelberg.de/groups/comopt/software . Accessed 15 July 2018

Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple traveling salesmen problem using genetic algorithms. Eur J Oper Res 228(1):72–82