You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jul 16, 2024. It is now read-only.
Originally created by darioizzo on 2012-09-04 19:42:02.
The algorithm performances are not equal to those of the original algorithm. Suspect is that crowding distance and crossover operator have slightly different implementations
The text was updated successfully, but these errors were encountered:
Originally posted by mmarcusx on 2012-10-23 15:24:36.
Description has changed:
Diff:
--- old
+++ new
@@ -1 +1 @@
-The algorithm performances are not equal to those of the original algorithm. Suspect is that crowding distance and crossover operator have slightly different imlementations
+The algorithm performances are not equal to those of the original algorithm. Suspect is that crowding distance and crossover operator have slightly different implementations
Originally posted by mmarcusx on 2012-10-23 15:24:36.
bug fixed (In the crossover/mutation methods was a minus instead of a plus at some point). Convergence speed is now similar to the original implementation by Deb. However, the crowding distance is twice as much as the value by Deb. This should not effect the algorithm however, as it just uses the crowding distance to compute an ordering and never looks at the actual values.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Originally created by darioizzo on 2012-09-04 19:42:02.
The algorithm performances are not equal to those of the original algorithm. Suspect is that crowding distance and crossover operator have slightly different implementations
The text was updated successfully, but these errors were encountered: