Library of numerical instances (MOMIP, MOLP, MOIP, MOCO)
There are currently 120 data files. They correspond to 20 families of bi-objective set packing problems.
For each problem, 6 variants are given: class A, B, C, D, E and F.
The format is originally from the OR library extended for handling multiple objectives.
All instances from one family have the same number of constraints and variables as well as the same matrix t, but they have different vectors of coefficients c1 and c2.
The format of all of these data files is:
number of rows (m), number of columns (n)
the cost of each column for objective 1 c1(j),j=1,…,n
the cost of each column for objective 2 c2(j),j=1,…,n
for each row i (i=1,...,m): the number of columns which cover row i followed by a list of the columns which cover row i
Legend:
ID : instance’s name
Instances referenced in [1]
Files contain data from [1]:
Xavier Gandibleux, Fabien Degoutin and Xavier Delorme A first feedback on set packing problems with two objectives Workshop “Multiple Objective Metaheuristics” November 04-05, 2002, Carré des Sciences, Paris, France.