A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains

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).

[1]  Nadia Nedjah,et al.  Efficient Parallel Modular Exponentiation Algorithm , 2002, ADVIS.

[2]  José Torres-Jiménez,et al.  Strength Two Covering Arrays Construction Using a SAT Representation , 2008, MICAI.

[3]  Francisco Rodríguez-Henríquez,et al.  Finding Optimal Addition Chains Using a Genetic Algorithm Approach , 2005, CIS.

[4]  C. Laisant Sur la numération factorielle, application aux permutations , .

[5]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6]  Nadia Nedjah,et al.  Efficient Pre-processing for Large Window-Based Modular Exponentiation Using Genetic Algorithms , 2003, IEA/AIE.

[7]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Edward G. Thurber Efficient Generation of Minimal Length Addition Chains , 1999, SIAM J. Comput..

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Paul W. H. Chung,et al.  Developments in Applied Artificial Intelligence , 2003, Lecture Notes in Computer Science.

[12]  Fatih Gelgi,et al.  Heuristics for Minimum Brauer Chain Problem , 2006, ISCIS.

[13]  A. Brauer On addition chains , 1939 .