MastersWork.LessRandomNotes History
Hide minor edits - Show changes to markup
Changed line 16 from:
Tree Representations
to:
TSP/Permutation Representations
Changed lines 1-21 from:
Describe LessRandomNotes here.
to:
This page is for the results of things that I've looked into or intend to look into, to keep track of good/bad directions.
Numerical Representations
Need to come up with a set of potentially beneficial features/representations to test out.
Plain numerical representation:
- mutation operator can increment/decrement by an amount.
- crossover can't split values.
Straight binary representation:
- mutation causes bit flips
- crossover can/can't split binary string arbitrarily
Gray code
- very similar to straight binary in terms of operators.
Neighbourhood check
(check the neighbouring values, count the mutations required to get from the current one to each of them. Gray code comes out among the best in this test, binary not so good)
Tree Representations
Grouping Representations
< Random Notes | HomePage | Resources >
Page last modified on January 12, 2005, at 02:50 AM