Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.
By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In orde...
| Publicado en: | Scientific World Journal pp. 652061 - 652062 |
|---|---|
| Autores principales: | , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2013
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency. |
|---|