vOptLib

Library of numerical instances (MOMIP, MOLP, MOIP, MOCO)

View the Project on GitHub vOptSolver/vOptLib

SPP: series SPP2002

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.

Format

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

Instances:

Legend:

ID : instance’s name

instance file : instance’s file

Y_N file : set of non dominated points


Instances referenced in [1]

ID Characteristics Available
2mis100_300.tar.gz n=100 / m=300 / density=2.00 / max1=2 instance file Y_N file
2mis100_500.tar.gz n=100 / m=500 / density=2.00 / max1=2 instance file Y_N file
2mis101_300.tar.gz n=100 / m=300 / density=2.00 / max1=2 instance file Y_N file
2mis101_500.tar.gz n=100 / m=500 / density=2.00 / max1=2 instance file Y_N file
2mis200_1000.tar.gz n=200 / m=1000 / density=1.00 / max1=2 instance file Y_N file
2mis200_600.tar.gz n=200 / m=600 / density=1.00 / max1=2 instance file Y_N file
2mis201_1000.tar.gz n=200 / m=1000 / density=1.00 / max1=2 instance file Y_N file
2mis201_600.tar.gz n=200 / m=600 / density=1.00 / max1=2 instance file Y_N file
2spp100_300.tar.gz n=100 / m=300 / density=3.08 / max1=4 instance file Y_N file
2spp100_500.tar.gz n=100 / m=500 / density=2.96 / max1=4 instance file Y_N file
2spp101_300.tar.gz n=100 / m=300 / density=2.97 / max1=4 instance file Y_N file
2spp101_500.tar.gz n=100 / m=500 / density=3.03 / max1=4 instance file Y_N file
2spp200_1000.tar.gz n=200 / m=1000 / density=1.49 / max1=4 instance file Y_N file
2spp200_600.tar.gz n=200 / m=600 / density=1.50 / max1=4 instance file Y_N file
2spp201_1000.tar.gz n=200 / m=1000 / density=1.49 / max1=4 instance file Y_N file
2spp201_600.tar.gz n=200 / m=600 / density=1.49 / max1=4 instance file Y_N file
2spp202_1000.tar.gz n=200 / m=1000 / density=2.48 / max1=8 instance file Y_N file
2spp202_600.tar.gz n=200 / m=600 / density=2.48 / max1=8 instance file Y_N file
2spp203_1000.tar.gz n=200 / m=1000 / density=2.49 / max1=8 instance file Y_N file
2spp203_600.tar.gz n=200 / m=600 / density=2.56 / max1=8 instance file Y_N file

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.