The Journal of the Operational Research Society, 1997-08, Vol.48 (8), p.804-809
1997
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- 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
- 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.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0160-5682eISSN: 1476-9360, 0160-5682DOI: 10.1038/sj.jors.2600431Titel-ID: cdi_proquest_journals_231242641
- Format
- –
- Schlagworte
- Algorithms, Applied sciences, Assignment problem, Children, Crossovers, Ecological competition, Exact sciences and technology, Flows in networks. Combinatorial problems, Genetic algorithms, Genetic mutation, Heuristic, Heuristics, Integer programming, Integers, Objective functions, Operational research and scientific management, Operational research. Management science, Operations research, Studies, Theoretical Papers