Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
A Genetic Algorithm for the Generalised Assignment Problem
Ist Teil von
The Journal of the Operational Research Society, 1997-08, Vol.48 (8), p.804-809
Ort / Verlag
Basingstoke: Macmillan Press
Erscheinungsjahr
1997
Link zum Volltext
Quelle
Taylor & Francis Journals Auto-Holdings Collection
Beschreibungen/Notizen
A new algorithm for the generalised assignment problem is described in this paper. The algorithm is adapted from a genetic algorithm which has been successfully used on set covering problems, but instead of genetically improving a set of feasible solutions it tries to genetically restore feasibility to a set of near-optimal ones. Thus it may be regarded as operating in a dual sense to the more familiar genetic approach. The algorithm has been tested on generalised assignment problems of substantial size and compared to an exact integer programming approach and a well-established heuristic approach.