Abstract
This paper aims to face the problem of getting Brauer Chains (BC) of minimum length by using a Mutation-Selection (MS) algorithm and a representation based on the Factorial Number System (FNS). We explain our MS strategy and report the experimental results for a benchmark considered difficult to show that this approach is a viable alternative to solve this problem by getting the shortest BCs reported in the literature and in a reasonable time. Also, it was used a fine-tuning process for the MS algorithm, which was done with the help of Covering Arrays (CA) and the solutions of a Diophantine Equation (DE).
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
Bleichenbacher, D., Flammenkamp, A.: Algorithm for computing shortest additions chains. Tech. rep., Bell Labs (1997), wwwhomes.uni-bielefeld.de/achim/ac.ps.gz
Brauer, A.: On addition chains. Jahresbericht der deutschen Mathematiker-Vereinigung 47, 41 (1937)
Cruz-Cortés, N., Rodríguez-Henríquez, F., Juárez-Morales, R., Coello Coello, C.A.: Finding optimal addition chains using a genetic algorithm approach. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol. 3801, pp. 208–215. Springer, Heidelberg (2005)
Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)
Lopez-Escogido, D., Torres-Jimenez, J., Rodriguez-Tello, E., Rangel-Valdez, N.: Strength two covering arrays construction using a SAT representation. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 44–53. Springer, Heidelberg (2008)
Gelgi, F., Onus, M.: Heuristics for minimum brauer chain problem, vol. 47, pp. 47–54. Springer, Heidelberg (2006)
Guy, R.K.: Unsolved problems in mathematics in the field of number theory, 3rd edn. Springer, Heidelberg (2004)
Holland, J.: Adaptation in natural and artificial systems. MIT Press (1992)
Laisant, C.: Sur la numération factorielle, application aux permutations (in French). Bulletin de la Société Mathématique de France 16 (1888)
Michalewicz, Z.: Genetic algorithms + data structures = evolution program, 3rd edn. Springer, Heidelberg (1996)
Nedjah, N., Mourelle, L.M.: Efficient parallel modular exponentiation algorithm, pp. 405–414. Springer, Heidelberg (2002)
Nedjah, N., Mourelle, L.M.: Efficient pre-processing for large window-based modular exponentiation using genetic algorithms. In: Chung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA/AIE 2003. LNCS, vol. 2718, pp. 165–194. Springer, Heidelberg (2003)
Thurber, E.: Efficient generation of minimal length addition chains. Journal on Computing 28(4) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodriguez-Cristerna, A., Torres-Jiménez, J., Rivera-Islas, I., Hernandez-Morales, C.G., Romero-Monsivais, H., Jose-Garcia, A. (2011). A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-25330-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25329-4
Online ISBN: 978-3-642-25330-0
eBook Packages: Computer ScienceComputer Science (R0)