MOLAP

Multiobjective Linear Assignment Problems




Description

There are currently 00 data files.
They correspond to 00 bi-objective linear assignment problems.
For each problem, 20 variants are given:
- the costs are in range [1,20], [1,40], [1,60], [1,80] and [1,100]:
- class A, B, C and D:
    A: the costs are uniformly generated
    B: created from A by replacing the second vector of costs by the first one in reverse order
    C: vector of costs generated with plateaus of values
    D: created from C by replacing the second vector of costs by the first one in reverse order

These data files are the test problem sets from
- set A (instance size 05 to 50):
    D. Tuyttens, J. Teghem, Ph. Fortemps and K. Van Nieuwenhuyse.
    Performance of the MOSA method for the bicriteria assignment problem.
    Journal of Heuristics, 6 pp. 295-310, (2000).

- set A (instance size 60 to 100), B, C and D:
    Fabien Degoutin and Xavier Gandibleux
    Un retour d'expérience sur la résolution de problèmes combinatoires bi-objectifs.
    5e journée du groupe de travail Programmation Mathématique MultiObjectif (PM20),
    Angers, France, 17 mai 2002. (slides in french here)
Format

The format of all of these data files is:
   ...
Files

Click here to access to the data files



Jump to... The Computer Science Department web site The LINA web site


The University of Nantes web site The International MSc in Computer Science "ORO"