<html><head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
<title> GAP instances </title></head><body alink="olive" bgcolor="white" text="black" vlink="olive" link="brown"><header>

</header>


<h1>GAP (generalized assignment problem) instances</h1>
<hr>
<pre>The instances of types A, B, C and D with n &lt;= 200 are exactly the same with
those in <a href="http://people.brunel.ac.uk/%7Emastjjb/jeb/orlib/gapinfo.html">OR-Library</a>.
Other instances (i.e., type E instances and instances with n &gt;= 400) are
generated by us.
<font color="red">
NOTE: Types D and E instances should be solved as minimization problems;
      otherwise they are trivial.
</font>
Some of these instances are used in:

  P.C. Chu and J.E. Beasley,
  A genetic algorithm for the generalized assignment problem,
  Computers &amp; Operations Research, 24 (1997) 17-23.

  M. Yagiura, T. Yamaguchi and T. Ibaraki,
  A Variable Depth Search Algorithm for the Generalized Assignment Problem,
  in: Meta-Heuristics: Advances and Trends in Local Search Paradigms for
  Optimization, eds. S. Voss, S. Martello, I.H. Osman and C. Roucairol,
  (Kluwer Academic Publishers, Boston, 1999) pp. 459-471.

  M. Yagiura, T. Yamaguchi and T. Ibaraki,
  A Variable Depth Search Algorithm with Branching Search for the Generalized
  Assignment Problem, Optimization Methods and Software, 10 (1998) 419-441.

  M. Yagiura, T. Ibaraki and F. Glover,
  An Ejection Chain Approach for the Generalized Assignment Problem,
  INFORMS Journal on Computing, 16 (2004) 133-151.

  M. Yagiura, T. Ibaraki and F. Glover,
  A Path Relinking Approach for the Generalized Assignment Problem,
  Proc. International Symposium on Scheduling, Japan,
  June 4-6, 2002, pp. 105-108.

  M. Yagiura, T. Ibaraki and F. Glover,
  A Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem,
  European Journal of Operational Research, 169 (2006) 548-569.
  <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/papers/prgap_abst.html">abstract </a>

<!--
The format is the same with those in <A HREF="http://mscmga.ms.ic.ac.uk/jeb/orlib/gapinfo.html">OR-Library</A>:
-->
The format is the same with those in <a href="http://people.brunel.ac.uk/%7Emastjjb/jeb/orlib/gapinfo.html">OR-Library</a>:

number of agents (m), number of jobs (n)
 for each agent i (i=1,...,m) in turn:
     cost of allocating job j to agent i (j=1,...,n)
 for each agent i (i=1,...,m) in turn:
     resource consumed in allocating job j to agent i (j=1,...,n)
 resource capacity of agent i (i=1,...,m)

<a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_a.tar.gz">Type A instances (tar + gzip)</a>   <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_a.zip">Type A instances (zip)</a>
<a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_b.tar.gz">Type B instances (tar + gzip)</a>   <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_b.zip">Type B instances (zip)</a>
<a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_c.tar.gz">Type C instances (tar + gzip)</a>   <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_c.zip">Type C instances (zip)</a>
<a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_d.tar.gz">Type D instances (tar + gzip)</a>   <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_d.zip">Type D instances (zip)</a>
<a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_e.tar.gz">Type E instances (tar + gzip)</a>   <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/gap/gap_e.zip">Type E instances (zip)</a>
</pre>
<hr>
<address>
<b> <a href="http://www.al.cm.is.nagoya-u.ac.jp/%7Eyagiura/index.html">
Mutsunori YAGIURA</a></b>
</address>
</body></html>