vOptLib

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

View the Project on GitHub vOptSolver/vOptLib

SCP: series SCP1998

There are currently 44 data files. They correspond to 11 bi-objective set covering problems.

For each problem, 4 variants are given: class A, B, C and D:

Format

The format is originally from the OR library extended for handling multiple objectives.

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


Instances referenced in [1]

Series 10

ID Characteristics Available
2scp11A.dat m=10 / n=100 / density=19,2 / max1=23 instance file
2scp11B.dat m=10 / n=100 / density=19,4 / max1=29 instance file
2scp11C.dat m=10 / n=100 / density=29,9 / max1=39 instance file
2scp11D.dat m=10 / n=100 / density=34,1 / max1=42 instance file

Series 40

ID Characteristics Available
2scp41A.dat m=40 / n=200 / density=4,53 / max1=19 instance file
2scp41B.dat m=40 / n=200 / density=4,57 / max1=15 instance file
2scp41C.dat m=40 / n=200 / density=5,36 / max1=18 instance file
2scp41D.dat m=40 / n=200 / density=5,43 / max1=17 instance file
2scp42A.dat m=40 / n=400 / density=4,91 / max1=30 instance file
2scp42B.dat m=40 / n=400 / density=4,94 / max1=29 instance file
2scp42C.dat m=40 / n=400 / density=5,67 / max1=33 instance file
2scp42D.dat m=40 / n=400 / density=5,96 / max1=35 instance file
2scp43A.dat m=40 / n=200 / density=10,47 / max1=30 instance file
2scp43B.dat m=40 / n=200 / density=10,60 / max1=30 instance file
2scp43C.dat m=40 / n=200 / density=10,81 / max1=29 instance file
2scp43D.dat m=40 / n=200 / density=10,91 / max1=29 instance file

Series 60

ID Characteristics Available
2scp61A.dat m=60 / n=600 / density=3,51 / max1=35 instance file
2scp61B.dat m=60 / n=600 / density=3,44 / max1=33 instance file
2scp61C.dat m=60 / n=600 / density=3,99 / max1=37 instance file
2scp61D.dat m=60 / n=600 / density=4,06 / max1=38 instance file
2scp62A.dat m=60 / n=600 / density=10,12 / max1=81 instance file
2scp62B.dat m=60 / n=600 / density=10,11 / max1=82 instance file
2scp62C.dat m=60 / n=600 / density=10,21 / max1=85 instance file
2scp62D.dat m=60 / n=600 / density=10,22 / max1=85 instance file

Series 80

ID Characteristics Available
2scp81A.dat m=80 / n=800 / density=2,86 / max1=40 instance file
2scp81B.dat m=80 / n=800 / density=2,86 / max1=44 instance file
2scp81C.dat m=80 / n=800 / density=3,16 / max1=48 instance file
2scp81D.dat m=80 / n=800 / density=3,21 / max1=36 instance file
2scp82A.dat m=80 / n=800 / density=10,02 / max1=106 instance file
2scp82B.dat m=80 / n=800 / density=10,03 / max1=106 instance file
2scp82C.dat m=80 / n=800 / density=10,05 / max1=107 instance file
2scp82D.dat m=80 / n=800 / density=10,05 / max1=106 instance file

Series 100

ID Characteristics Available
2scp101A.dat m=100 / n=1000 / density=10,06 / max1=123 instance file
2scp101B.dat m=100 / n=1000 / density=10,06 / max1=123 instance file
2scp101C.dat m=100 / n=1000 / density=10,07 / max1=123 instance file
2scp101D.dat m=100 / n=1000 / density=10,07 / max1=123 instance file
2scp102A.dat m=100 / n=1000 / density=20 / max1=227 instance file
2scp102B.dat m=100 / n=1000 / density=20 / max1=227 instance file
2scp102C.dat m=100 / n=1000 / density=20 / max1=227 instance file
2scp102D.dat m=100 / n=1000 / density=20 / max1=227 instance file

Series 200

ID Characteristics Available
2scp201A.dat m=200 / n=1000 / density=5 / max1=66 instance file
2scp201B.dat m=200 / n=1000 / density=5 / max1=66 instance file
2scp201C.dat m=200 / n=1000 / density=5 / max1=66 instance file
2scp201D.dat m=200 / n=1000 / density=5 / max1=66 instance file

Files contain data from [1]:

[1] Xavier Gandibleux, David Vancoppenolle and Daniel Tuyttens. A first making use of GRASP for solving MOCO problems 14th International Conference in Multiple Criteria Decision-Making June 8–12, 1998, Charlottesville, USA.