A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems

  • Authors:

  • Dilip Datta;Carlos M. Fonseca;Kalyanmoy Deb

  • Affiliations:

  • Department of Mechanical Engineering, National Institute of Technology Silchar, Silchar, India 788 010;DEEI, Faculdade de Ciências e Tecnologia, Universidade do Algarve, Faro, Portugal 8005-139;Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Kanpur, India 208 016

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The complexity of a resource allocation problem (RAP) is usually NP-complete, which makes an exact method inadequate to handle RAPs, and encourages heuristic techniques to this class of problems for obtaining approximate solutions in polynomial time. Different heuristic techniques have already been investigated for handling various RAPs. However, since the properties of an RAP can help in characterizing other RAPs, instead of individual solution techniques, the similarities of different RAPs might be exploited for developing a common solution technique for them. Two RAPs of quite different nature, namely university class timetabling and land-use management, are considered here for such a study. The similarities between the problems are first explored, and then a common multi-objective evolutionary algorithm (a kind of heuristic techniques) for them is developed by exploiting those similarities. The algorithm is problem-dependent to some extent and can easily be extended to other similar RAPs. In the present work, the algorithm is applied to two real instances of the considered problems, and its properties are derived from the obtained results.