Sage Journals: Discover world-class research

Abstract

Genetic algorithm (GA) is one of the most widely used meta-heuristic optimization tools to solve a variety of problems. It is a powerful tool for global optimization. However, like other heuristic optimization techniques, it has a probabilistic guarantee to reach the globally optimum solution in a finite number of generations. In addition, a GA suffers from the poor local search capability and hence, it is slow in convergence. To overcome these disadvantages of a GA, there had been a lot of attempts made by several researchers using different techniques. One of such techniques is the restart strategy for a GA. This strategy is nothing but to start with a new population of solutions of the GA, whenever it is unable to find any better quality of solution or it satisfies some conditions pre-specified by the user. There are a few restart strategies available in the literature with their own merits and demerits. In this paper, a novel restart strategy with elitism has been proposed. It consists of mainly three different conditions, and if any of these conditions is fulfilled, the algorithm gets restarted. The proposed restart strategy has been designed in such a way that a proper balance between the exploration and exploitation can be maintained during the search. In addition, the proposed restart scheme is able to detect the premature convergence situation of a GA and it triggers out a restart of the algorithm to avoid such situation. To measure the performance of a real-coded genetic algorithm (RCGA) with the proposed restart strategy, two sets of experiments have been done on different test functions, and the results are compared with that of the RCGAs with other restart strategies available in the literature. From the experiments, it is clear that the RCGA with the proposed restart strategy is able to yield the better results compared to others.

Keywords

Genetic algorithms restart strategy elitism principle premature convergence

Get full access to this article

View all access options for this article.

References

Ezzeddine

A.B.

Lóderer

Laurinec

Vrablecová

Rozinajová

Lucká

Lacko

and Grmanová

, Using biologically inspired computing to effectively improve prediction models, International Journal of Hybrid Intelligent Systems 13(2) (2016), 99–112.

Ali

A.F.

and Tawhid

M.A.

, Hybrid bat algorithm and direct search methods for solving minimax problems, International Journal of Hybrid Intelligent Systems (2018), 1–15.

Das

A.K.

and Pratihar

D.K.

, A novel restart strategy for solving complex multi-modal optimization problems using real-coded genetic algorithm, in: ISDA 2017, A. A et al., eds, Delhi, India (2017), pp. 32–41.

Fahimnia

Luong

and Marian

, Optimization/simula-tion modeling of the integrated production-distribution plan: An innovative survey, WSEAS Transactions on Business and Economics 5(3) (2008), 52–65.

Boender

C.G.E.

and Romeijn

H.E.

, Stochastic methods, in: Handbook of Global Optimization, Nonconvex Optimization and Its Applications Horst

and Pardalos

P.M.

, (eds), Boston, MA, 2 (1995), pp. 829–869.

C.-K.

and Li

, Test problem generator for unconstrained global optimization, Computers & Operations Research 51 (2014), 338–349.

Goldberg

D.E.

and Deb

, A comparative analysis of selection schemes used in genetic algorithms, in: Foundations of Genetic Algorithms 1 (1991), 69–93.

Pratihar

D.K.

, Realizing the need for intelligent optimization tool, in: Handbook of Research on Natural Computing for Optimization Problems, IGI Global, (2016), 1–9.

Pratihar

D.K.

and Pratihar

, A review on applications of soft computing in design and development of intelligent autonomous robots, International Journal of Hybrid Intelligent Systems 14(1-2) (2017), 49–65.

10.

Ghannadian

Alford

and Shonkwiler

, Application of random restart to genetic algorithms, Information Sciences 95(1-2) (1996), 81–102.

11.

Beligiannis

G.N.

Tsirogiannis

G.A.

and Pintelas

P.E.

, Restartings: A technique to improve classic genetic algorithms’ performance, in: International Conference on Computational Intelligence (2004), 404–407.

12.

Eid

H.F.

and Abraham

, Plant species identification using leaf biometrics and swarm optimization: A hybrid PSO, GWO, SVM model, International Journal of Hybrid Intelligent Systems 14(3) (2017), 155–165.

13.

Rechenberg

, Evolutionsstrategie – Optimierung technisher Systeme nach Prinzipien der biologischen Evolution, (1973).

14.

Hughes

J.A.

Houghten

and Ashlock

, Recentering and restarting a genetic algorithm using a generative representation for an ordered gene problem 1, International Journal of Hybrid Intelligent Systems 11(4) (2014), 257–271.

15.

Holland

J.H.

, Adaptation in natural and artificial systems, an introductory analysis with application to biology, control, and artificial intelligence, MIT Press, Cambridge, MA, USA, 1992.

16.

De Jong

K.A.

, Analysis of the behavior of a class of genetic adaptive systems, Ph.D. Dissertation, University of Michigan, 1975.

17.

Dantu

Berman

Kate

and Nagpal

, A comparison of deterministic and stochastic approaches for allocating spatially dependent tasks in micro-aerial vehicle collectives, in: Intelligent Robots and Systems (IROS 2012), Portugal (2012), 793–800.

18.

Deb

, An efficient constraint handling method for genetic algorithms, Computer Methods in Applied Mechanics and Engineering 186 (2000), 311–338.

19.

Deb

and Goyal

, A combined genetic adaptive search (GeneAS) for engineering design, Computer Science and Informatics 26 (1996), 30–45.

20.

Deb

and Agrawal

R.B.

, Simulated binary crossover for continuous search space, Complex Systems 9(3) (1994), 1–15.

21.

Suksut

Kerdprasop

and Kerdprasop

, Support vector machine with restarting genetic algorithm for classifying imbalanced data, International Journal of Future Computer and Communication 6(3) (2017), 92–96.

22.

dos Santos Coelho

Ayala

H.V.H.

and Mariani

V.C.

, A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization, Applied Mathematics and Computation 234(C) (2014), 452–459.

23.

Fogel

L.J.

Owens

A.J.

and Walsh

M.J.

, Artificial intelligence through simulated evolution, Wiley, New York, 1966.

24.

Liberti

and Kucherenko

, Comparison of deterministic and stochastic approaches to global optimization, International Transactions in Operational Research 12(3) (2005), 263–285.

25.

Dorigo

, Optimization, learning and natural algorithms, PhD Thesis, Politecnico di Milano, Italie, 1992.

26.

Mahmoodabadi

M.J.

Safaie

A.A.

Bagheri

and Nariman-Zadeh

, A novel combination of particle swarm optimization and genetic algorithm for pareto optimal design of a five-degree of freedom vehicle vibration model, Applied Soft Computing 13(5) (2013), 2577–2591.

27.

Shahlaei

Madadkar-Sobhani

Saghaie

and Fassihi

, Application of an expert system based on genetic algorithm – adaptive neuro-fuzzy inference system (GA-ANFIS) in QSAR of cathepsin K inhibitors, Expert Systems with Applications 39(6) (2012), 6182–6191.

28.

Metropolis

Rosenbluth

A.W.

Rosenbluth

M.N.

Teller

A.H.

and Teller

, Equation of state calculations by fast computing machines, The Journal of Chemical Physics 21(6) (1953), 1087–1092.

29.

Gupta

Sharma

T.K.

and Mehrotra

, Implementation of genetic algorithm for developing knowledge centric environment in higher education, International Journal of Hybrid Intelligent Systems 14(1-2) (2017), 13–19.

30.

Suganthan

P.N.

Hansen

Liang

J.J.

Deb

Chen

Y.-P.

Auger

and Tiwari

, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, Technical Report, Nanyang Technological University, Singapore and KanGAL Report Number 2005005 (Kanpur Genetic Algorithms Laboratory, IIT Kanpur), 2005.

31.

Eberhart

and Kennedy

, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS’95 (1995), 39–43.

32.

Reynolds

R.G.

, An introduction to cultural algorithms, in: Proceedings of The Third Annual Conference on Evolutionary Programming, Singapore, (1994), 131–139.

33.

Storn

and Price

, Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization 11(4) (1997), 341–359.

34.

AkpıNar

Bayhan

G.M.

and Baykasoglu

, Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks, Applied Soft Computing 13(1) (2013), 574–589.

35.

Dao

S.D.

Abhary

and Marian

, An improved structure of genetic algorithms for global optimisation, Progress in Artificial Intelligence 5(3) (2016), 155–163.

36.

Wang

Huang

Dong

W.S.

Yan

J.C.

Tian

C.H.

and Mo

W.T.

, Two-stage based ensemble optimization framework for large-scale global optimization, European Journal of Operational Research 228(2) (2013), 308–320.

37.

Yun

Chung

and Moon

, Hybrid genetic algorithm approach for precedence-constrained sequencing problem, Computers & Industrial Engineering 65(1) (2013), 137–147.

Performance improvement of a genetic algorithm using a novel restart strategy with elitism principle

Abstract

Keywords

Get full access to this article

References