A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems

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. In this paper, we propose a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics and computation 2008, Vol.195 (1), p.299-308
Hauptverfasser:	Jarboui, B., Damak, N., Siarry, P., Rebai, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Calculus of variations and optimal control Combinatorial optimization Combinatorial particle swarm optimization Computer Science Exact sciences and technology Local search Mathematical analysis Mathematics Multi-mode resource-constrained project scheduling problem Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Operations Research Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!