A Mutation Ant Colony Algorithm for the Generalized Assignment Problem under the Special Constraints

A generalized assignment problem under the special constraints is proposed, which can be solved by the ant colony algorithm (ACA). But the ACA for the problem is easy to fall in local optima because the constraints are relatively complicated. In this paper, the diversity in the results is maintained...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied Mechanics and Materials 2012-11, Vol.229-231, p.1862-1865
Hauptverfasser:	Shi, De Qian, Guo, Yun Hua
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!