Using an enhanced integer NSGA-II for solving the multiobjective Generalized Assignment Problem

@article{Subtil2010UsingAE,
  title={Using an enhanced integer NSGA-II for solving the multiobjective Generalized Assignment Problem},
  author={Robert F. Subtil and Eduardo G. Carrano and Marcone J. F. Souza and Ricardo H. C. Takahashi},
  journal={IEEE Congress on Evolutionary Computation},
  year={2010},
  pages={1-7}
}
The traditional Generalized Assignment Problem (GAP) problem consists of assigning n different tasks to m different agents, while minimizing a cost function. Additionally, it is necessary to ensure that each task is assigned to a single agent (indivisible task) and that the maximum resource capacity of the agents is honored. In this paper, the problem is extended to a bi-objective formulation, in which an equilibrium function is included in the problem statement. This formulation is motivated… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

A fast and elitist multiobjective genetic algorithm: Nsga ii

  • K. Deb, A. Pratap, S. Agarwal, T. Meyarivan
  • IEEE Transactions on Evolutionary Computation…
  • 2002
Highly Influential
11 Excerpts

OR-Library. http://www.brunel.ac.uk/depts/ma/research/ jeb/orlib/gapinfo.html. Last accessed in 2010-Feb-01

  • J. E. Beasley
  • 2010
Highly Influential
3 Excerpts

An algorithm for the generalized assignment problem with special ordered sets

  • J. M. Wilson
  • Journal of Heuristics, vol. 11, pp. 337–350, .
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…