A discrete particle swarm optimization algorithm for scheduling parallel machines
文件大小:
212k
资源说明: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 (Cmax) 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.
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。