@InProceedings{10.1007/978-81-322-1038-2_12,
author="Deb, Kalyanmoy
and Dhebar, Yashesh D.
and Pavan, N. V. R.",
editor="Bansal, Jagdish Chand
and Singh, Pramod Kumar
and Deep, Kusum
and Pant, Millie
and Nagar, Atulya K.",
title="Non-Uniform Mapping in Binary-Coded Genetic Algorithms",
booktitle="Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012)",
year="2013",
publisher="Springer India",
address="India",
pages="133--144",
abstract="Binary-coded genetic algorithms (BGAs) traditionally use a uniform mapping to decode strings to corresponding real-parameter variable values. In this paper, we suggest a non-uniform mapping scheme for creating solutions towards better regions in the search space, dictated by BGA's population statistics. Both variable-wise and vector-wise non-uniform mapping schemes are suggested. Results on five standard test problems reveal that the proposed non-uniform mapping BGA (or NBGA) is much faster in converging close to the true optimum than the usual uniformly mapped BGA. With the base-line results, an adaptive NBGA approach is then suggested to make the algorithm parameter-free. Results are promising and should encourage further attention to non-uniform mapping strategies with binary coded GAs.",
isbn="978-81-322-1038-2"
}