Abstract
Formation of hamming cliff hampers the progress of genetic algorithm in seemingly deceptive problems. We demonstrate through an analysis of neighbourhood search capabilities of the mutation operator in genetic algorithm that the problem can somtimes be overcome through proper genetic coding. Experiments have been conducted on a 4-bit deceptive function and the pure-integer programming problem. The integer-coded genetic algorithm performs better and requires less time than the binary-coded genetic algorithm in these problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Basu, S.K., Bhatia, A.K.: A naive genetic approach for non-stationary constrained problems. Soft Computing 10(2), 152–162 (2006)
Berkelaar, M.R., Dirks, J.: Lp_solve - a solver for linear programming problems with a callable subroutine library (1999), ftp://ftp.es.ele.tue.nl/pub/lp_solve
Bhatia, A.K., Basu, S.K.: Tackling 0/1 knapsack problem with gene induction. Soft Computing 8(1), 1–9 (2003)
Bhatia, A.K., Basu, S.K.: Packing bins using multi-chromosomal genetic representation and better-fit heuristic. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 181–186. Springer, Heidelberg (2004)
Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley, Chichester (1998)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Hancock, P.J.B.: An empirical comparison of selection methods in evolutionary algorithms. In: Fogarty, T.C. (ed.) Lecture Notes in Computer Science No. 865, pp. 80–94 (1994)
Harik, G., Cantú-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation 7(3), 231–253 (1999)
Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review 12(4), 265–319 (1998)
Lin, B.W.Y., Rardin, R.L.: Development of a parametric generating procedure for integer programming test problems. Journal of the ACM 24(3), 465–472 (1977)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)
Reeves, C.R.: Genetic algorithms and neighbourhood search. In: Fogarty, T.C. (ed.) Lecture Notes in Computer Science No. 865, pp. 115–130 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Basu, S.K., Bhatia, A.K. (2006). Mitigating Deception in Genetic Search Through Suitable Coding. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893295_104
Download citation
DOI: https://doi.org/10.1007/11893295_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46484-6
Online ISBN: 978-3-540-46485-3
eBook Packages: Computer ScienceComputer Science (R0)