MastersWork.RandomNotes History
Hide minor edits - Show changes to output
Changed line 20 from:
* assembly line balancing - getting a job done in the least amount of time, where some tasks are serial and others are parallel.
to:
* job scheduling - getting a job done in the least amount of time, where some tasks are serial and others are parallel.
Added lines 17-23:
----
Need to split the GAs encountered into a range of classes. Classes encountered so far:
* assembly line balancing - getting a job done in the least amount of time, where some tasks are serial and others are parallel.
* travelling salesman - a sequence of points, where a point can't be repeated, and where each point may have some relation to the others, and the combined property of the sequence is what's important.
* raw number search - a set of numbers, explicitly searching an @@n@@ dimensional space. Numbers probably orthoganal.
Added lines 14-16:
!!!Redundant encoding
Where there is more than one genotype that maps to one phenotype, i.e. the encoding space is larger than the solution space: does this make any difference?
Changed line 9 from:
: :''A method that has this capability encodes a partition as a permutation of @@N@@ objects and @@K-1@@ separators, where @@K@@ is the maximum number of partitions. Jones and Beltramo (RefJonesBeltramo1991) use [[PermutationEncodings permutation encodings]] with a GA for the "equal piles problem", where the goal was to divide @@N@@ numbers @@x_i@@ (@@i=1, ...,N@@) into @@K@@ groups (piles) so to minimize differences among the group sums.
to:
: :''A method that has this capability encodes a partition as a permutation of @@N@@ objects and @@K-1@@ separators, where @@K@@ is the maximum number of partitions. Jones and Beltramo (RefJonesBeltramo1991) use [[PermutationEncodings permutation encodings]] with a GA for the "equal piles problem", where the goal was to divide @@N@@ numbers @@x_i@@ (@@i=1, ...,N@@) into @@K@@ groups (piles) so to minimize differences among the group sums.''
Changed line 3 from:
!On why representation schemes are important:
to:
!!!On why representation schemes are important:
Changed line 8 from:
!Interesting test problem:
to:
!!!Interesting test problem:
Changed line 1 from:
This is a collection of random notes, quotes, whatever that could be useful.
to:
!!This is a collection of random notes, quotes, whatever that could be useful.
Added line 3:
!On why representation schemes are important:
Changed line 8 from:
Interesting test problem:
to:
!Interesting test problem:
Added lines 7-11:
Interesting test problem:
: :''A method that has this capability encodes a partition as a permutation of @@N@@ objects and @@K-1@@ separators, where @@K@@ is the maximum number of partitions. Jones and Beltramo (RefJonesBeltramo1991) use [[PermutationEncodings permutation encodings]] with a GA for the "equal piles problem", where the goal was to divide @@N@@ numbers @@x_i@@ (@@i=1, ...,N@@) into @@K@@ groups (piles) so to minimize differences among the group sums.
--From RefSavikEtAl1995
: :''A method that has this capability encodes a partition as a permutation of @@N@@ objects and @@K-1@@ separators, where @@K@@ is the maximum number of partitions. Jones and Beltramo (RefJonesBeltramo1991) use [[PermutationEncodings permutation encodings]] with a GA for the "equal piles problem", where the goal was to divide @@N@@ numbers @@x_i@@ (@@i=1, ...,N@@) into @@K@@ groups (piles) so to minimize differences among the group sums.
--From RefSavikEtAl1995
Changed lines 1-8 from:
to:
This is a collection of random notes, quotes, whatever that could be useful.
: :''Representation scheme decides not only the resolution of the obtained solutions and the size of the search space, but also the principle of translating and understanding the primitive problem.''
--From RefLeung2002
-----
<|HomePage|>
: :''Representation scheme decides not only the resolution of the obtained solutions and the size of the search space, but also the principle of translating and understanding the primitive problem.''
--From RefLeung2002
-----
<|HomePage|>
Page last modified on January 12, 2005, at 02:50 AM