01 January 1970 4 253 Report

Dear all,

Like travelling salesman problem, it is a permutation problem. I know that Lehmer code is a good method for permutation encoding in evolutionary algorithms. Does anyone know the more methods that can be used for permutation encoding in evolutionary algorithms? What is the best method for Permutation Encoding in evolutionary algorithm? Please indicates their advantage and disadvantage in evolutionary algorithm if possible.

Thank you very much.

More Yu-Da Lin's questions See All
Similar questions and discussions