OR-Library is a collection of test data sets for a variety of Operations Research (OR) problems.

These test data sets can be accessed via the WWW using the links below.

OR-Library was originally described in J.E.Beasley, "OR-Library: distributing test problems by electronic mail", Journal of the Operational Research Society 41(11) (1990) pp1069-1072.

Those concerned as to any legal issues associated with using the test data sets in OR-Library should see here

The following list gives the available problem areas:

Airport
capacity

Assembly
line balancing

Assignment
problem

Biquadratic
assignment

Capacitated
minimal spanning tree

Crew
scheduling

Complementarity

Corporate
structuring

Data
envelopment analysis

Edge-weighted
k-cardinality tree

Equitable
partitioning problem

Fixed
charge transportation problem

Frequency
assignment problem

Generalised
assignment problem

Graph
colouring

Graph
planarisation

Ground
holding

Hamiltonian
cycle

Index
tracking

Integer
(and mixed-integer) programming

Linear
ordering

Linear
programming

- capacitated vertex p-centre
- capacitated warehouse location
- capacitated warehouse location, single source
- p-hub
- p-median - uncapacitated
- p-median - capacitated
- uncapacitated warehouse location
- Weber (continous) location

Lot
sizing

Map
labelling

Matching

Matrix
decomposition

Maximum
clique

Maximum
cover

Min-cut
clustering

Minimum labelling spanning tree

Multiobjective optimisation

Nonlinear
programming

Ore
selection

Quadratic programming

Resource constrained project scheduling

Satisfiability

- aircraft landing
- common due date
- flow shop
- hybrid reentrant shop
- job shop
- lot streaming
- multiprocessor task scheduling in multistage hybrid flowshops
- order acceptance and scheduling
- open shop
- shift minimization personnel task
- weighted tardiness
- weighted tardiness with sequence-dependent setup
- workforce

Semidefinite
programming

Sequential
ordering

Set
covering

Set
partitioning

- Euclidean Steiner problem
- Minimum labelling Steiner problem
- Prize collecting Steiner problem
- Rectilinear Steiner problem
- Steiner problem in graphs

Time
series forecasting

Timetabling

- assortment problem
- constrained guillotine
- constrained non-guillotine
- non-rectangular items
- strip packing
- unconstrained guillotine

Unconstrained
binary quadratic programming

Unit
commitment

- dial-a-ride
- fixed areas
- fixed routes
- inventory routing
- multi-depot
- multi-depot with time windows
- period routing
- period routing with time windows
- single period
- single period with pick-ups and deliveries
- single period with time windows
- single period with time windows and pick-ups and deliveries
- site-dependent routing
- site-dependent multi-trip period routing
- site-dependent with time windows
- sparse feasibility graph
- two-echelon

J.E.Beasley, June 1990 Last update: June 2012