Sciweavers

SAC
2004
ACM

An improved hybrid genetic algorithm for the generalized assignment problem

13 years 9 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. The presented new approach is based on a previously published, successful hybrid genetic algorithm and includes as new features two alternative initialization heuristics, a modified selection and replacement scheme for handling infeasible solutions more appropriately, and a heuristic mutation operator. Tests are performed on standard test instances from the literature and on newly created, larger and more difficult instances. The presented genetic algorithm with its two initialization variants is compared to the previous genetic algorithm and to the commercial general purpose branchand-cut system CPLEX. Results indicate that CPLEX is able to solve relatively large instances of the general assignment problem to provable optimality. For the largest and most difficult instances, however, the proposed genetic algo...
Harald Feltl, Günther R. Raidl
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where SAC
Authors Harald Feltl, Günther R. Raidl
Comments (0)