Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1180.90125
Jarboui, B.; Damak, N.; Siarry, P.; Rebai, A.
A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. (English)
[J] Appl. Math. Comput. 195, No. 1, 299-308 (2008). ISSN 0096-3003

Summary: The particle swarm optimization (PSO) has been widely used to solve continuous problems. The discrete problems have just begun to be also solved by the discrete PSO. However, the combinatorial problems remain a prohibitive area to the PSO mainly in case of integer values.\par In this paper, we propose a combinatorial PSO (CPSO) algorithm that we take up challenge to use in order to solve a multi-mode resource-constrained project scheduling problem (MRCPSP). The results that have been obtained using a standard set of instances, after extensive experiments, prove to be very competitive in terms of number of problems solved to optimality. By comparing average deviations and percentages of optima found, our CPSO algorithm outperforms the simulated annealing algorithm and it is close to the PSO algorithm.

MSC 2000:: *90B35 Scheduling theory
90C59 Approximation methods and heuristics
90C27 Combinatorial programming

Keywords: local search

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]