A discrete particle swarm optimization algorithm for scheduling parallel machines
As a novel evolutionary technique, particle swarm optimization ( PSO) has received increasing attention and wide applications in a variety of fields. To our knowledge this paper investigates the first application of PSO algorithm to tackle the parallel machines scheduling problem. Proposing equation...
Uloženo v:
| Vydáno v: | Computers & industrial engineering Ročník 56; číslo 1; s. 216 - 223 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Elsevier Ltd
01.02.2009
Pergamon Press Inc |
| Témata: | |
| ISSN: | 0360-8352, 1879-0550 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | As a novel evolutionary technique, particle swarm optimization (
PSO) has received increasing attention and wide applications in a variety of fields. To our knowledge this paper investigates the first application of
PSO algorithm to tackle the parallel machines scheduling problem. Proposing equations analogous to those of the classical
PSO equations, we present a discrete
PSO algorithm (
DPSO) to minimize makespan (
C
max) criterion. We also investigate the effectiveness of
DPSO algorithm through hybridizing it with an efficient local search heuristic. To verify the performance of
DPSO algorithm and its hybridized version (
HDPSO), comparisons are made through using a recently proposed simulated annealing algorithm for the problem, addressed in the literature, as a comparator algorithm. Computational results signify that the proposed
DPSO algorithm is very competitive and can be rapidly guided when hybridizing with a local search heuristic. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0360-8352 1879-0550 |
| DOI: | 10.1016/j.cie.2008.05.007 |