Plan Marco A. Montes de Oca - Revision history

Mmontes: /* Things to do */

2005-12-06T16:36:48Z

Things to do

2005-12-06T16:35:52Z

Things to do

2005-12-06T16:35:18Z

Things to do

2005-11-30T15:52:50Z

Plan (future work)

2005-11-30T15:52:10Z

Plan (future work)

2005-11-30T15:29:41Z

Plan (future work)

2005-11-30T15:28:45Z

Plan (future work)

2005-11-30T15:25:50Z

Plan (future work)

2005-11-30T15:25:16Z

Plan (future work)

2005-11-30T15:22:22Z

Plan (future work)

@@ Line 22: / Line 22: @@
 | Particle Swarm Optimization Self-study|| Nov 1, 2005 ||  Continuous process || - || In progress
 |-
-| Implementation of some variants of the PSO algorithm || Nov 20, 2005 ||  Continuous process || - ||
+| Modular design and implementation of some variants of the PSO algorithm || Nov 20, 2005 ||  Continuous process || - || In progress
 |-
 | Preparing material for the Optimization Group meeting|| Nov 29, 2005 ||  Dec 1, 2005 || ~1 day || Finished

@@ Line 24: / Line 24: @@
 | Implementation of some variants of the PSO algorithm || Nov 20, 2005 ||  Continuous process || - ||
 |-
-| Preparing material for the Optimization Group meeting|| Nov 29, 2005 ||  Dec 1, 2005 || Finished ||
+| Preparing material for the Optimization Group meeting|| Nov 29, 2005 ||  Dec 1, 2005 || ~1 day || Finished
 |}

@@ Line 24: / Line 24: @@
 | Implementation of some variants of the PSO algorithm || Nov 20, 2005 ||  Continuous process || - ||
 |-
-| Preparing material for the Optimization Group meeting|| Nov 29, 2005 ||  Dec 1, 2005 || ~1 day or less ||
+| Preparing material for the Optimization Group meeting|| Nov 29, 2005 ||  Dec 1, 2005 || Finished ||
 |}

@@ Line 5: / Line 5: @@
 ! Description !! Start date !! Deadline !! Time required !! Status
 |-
-| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design) Jan 10,
+| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design);          Jan 10, 2006 (Implementation) || ~40 days || In progress
 |-
 | Propose a PSO variant based on the F-Race technique. If the implementation is modular, it should be possible to consider various aspects such as neighborhood topologies as variables to be tuned and therefore, we could get ad-hoc PSO algorithms for specific applications.|| Nov 30, 2005 ||  Jan 2, 2006 || ~30 days || In progress

@@ Line 5: / Line 5: @@
 ! Description !! Start date !! Deadline !! Time required !! Status
 |-
-| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design) Jan 10, 2006 (Implementation) || ~40 days || In progress
+| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design) Jan 10,
 |-
 | Propose a PSO variant based on the F-Race technique. If the implementation is modular, it should be possible to consider various aspects such as neighborhood topologies as variables to be tuned and therefore, we could get ad-hoc PSO algorithms for specific applications.|| Nov 30, 2005 ||  Jan 2, 2006 || ~30 days || In progress

@@ Line 3: / Line 3: @@
 {| border=1 cellspacing=0 cellpadding=2
-! Description !! Start date !! Deadline !! Time required !! status
+! Description !! Start date !! Deadline !! Time required !! Status
 |-
-| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc(according to problems characteristics) PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design)
+| Implementation of some (at least the most influential) variants of PSO. This implementation should be modular and flexible enough to generate ad-hoc(according to problems characteristics) PSO versions and incorporate hybrid approaches easily. The language of choice will be C in order to reuse code developed by others. || Nov 30, 2005 ||  Dec 15, 2005 (Design) Jan 10, 2006 (Implementation) || ~40 days || In progress
 |-
-| Propose a PSO variant based on the F-Race technique. If the implementation
+| Propose a PSO variant based on the F-Race technique. If the implementation is modular, it should be possible to consider various aspects such as neighborhood topologies as variables to be tuned and therefore, we could get ad-hoc PSO algorithms for specific applications.|| Nov 30, 2005 ||  Jan 2, 2006 || ~30 days || In progress
 |-
 |}

@@ Line 5: / Line 5: @@
 ! Description !! Start date !! Deadline !! Time required !! status
 |-
 |-
 | Comparison of all the different PSO variants and other EC techniques
@@ Line 16: / Line 17: @@
 will contrast with previous and current practices in which only a small
 number of benchmark problems are used. || Nov 20, 2005 ||  Continuous process || - ||
 |}