Welcome to OR-Library

J E Beasley

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 links below are divided into two.

The first set of links are primarily to problem instances (test data sets) maintained by myself.
The second set of links are to problem instances (test data sets) maintained by others.

Check both sets of links if necessary in looking for problem instances.

J.E.Beasley, June 1990; Last update: February 2018

Airport capacity
Assignment problem

Portfolio optimisation:

Scheduling:

Set covering
Set partitioning

Shortest path:

Resource constrained

Steiner:

Three-dimensional cutting/packing:

Time series forecasting
Timetabling

Travelling salesman problem:

period salesman

Two-dimensional cutting/packing:

Unconstrained binary quadratic programming
Unit commitment

Vehicle routing:

(r|p)-centroid problem
Absolute return portfolios
Antibandwidth
Assembly line balancing
Assignment
Bandwidth Colouring
Bin-packing and scheduling instances with special constraints
Biquadratic assignment
Bus Driver Scheduling
Capacitated Clustering
Capacitated Facility Location
Capacitated Hub Location with Modular Links
Capacitated vertex p-centre
Capacitated warehouse location, single source
Competitive Facility Location
Competitive Facility Location and Design
Complementarity
Complementarity
Cutwidth
Cyclic Antibandwidth
Data envelopment analysis
Dial-a-ride vehicle routing
Equitable Dispersion
Facility Location and Pricing
Fixed charge transportation
Frequency assignment
Frequency assignment
Graph planarization
Hamiltonian cycle
Integer (and mixed-integer) programming
Integer (and mixed-integer) programming
Integer (and mixed-integer) programming
Integer (and mixed-integer) programming
Inventory routing
Inventory Routing over a finite periodic planning horizon
Joint order batching and picker routing in inventories
Knapsack sharing
Linear ordering
Linear Ordering
Map labelling
Map labelling
Market neutral portfolios
Matching
Matching
Matrix decomposition
MaxCut
Maximally Diverse Grouping
Maximum clique
Maximum clique
Maximum cover
Maximum Diversity
MaxMin Diversity
Min-cut clustering (graph partitioning)
Minimum Differential Dispersion
Min-Max Order Batching
Moving products between location pairs: Cross-Docking versus Direct-Shipping
Multi Compartment Commodity Heterogeneous Fixed Fleet VRP with Time Windows
Multi�-Stage Uncapacitated� Facility Location
Multi-choice, multidimensional knapsack
Multiobjective optimisation
Multiple objective shortest path
Multiple objective travelling salesman
Multiprocessor task scheduling in multistage hybrid flowshops
Multi-source Weber
Network flow
Network flow - multicommodity
Network flow - multicommodity
Network flow - single commodity
Network flow - single commodity
Nonlinear programming
Nonlinear programming
Nonlinear programming
Nonlinear programming
Order acceptance and scheduling
Order Batching
Order Batching and Sequencing
P-median
P-median with Users Preferences
P-median�
Prize collecting Steiner tree
Quadratic assignment
Quadratic assignment
Quadratic assignment
Quadratic assignment
Quadratic knapsack
Quadratic Minimum Spanning Tree
Quadratic Multiple Knapsack
Quadratic programming
Quadratic programming
Resource constrained project scheduling
Revenue Management
Satisfiability
Satisfiability
Semidefinite programming
Semidefinite programming
Sequential ordering
Simple Plant Location
Single Row Facility Layout
Site-dependent vehicle routing
Site-dependent vehicle routing with time windows
Stochastic integer programming
Stochastic linear programming
Stochastic programming
Stochastic programming
Stochastic Programming
Supply Management
Survivable fixed telecommunication Network Design
Timetabling
Transfer Line Balancing
Traveling Tournament
Travelling salesman
Travelling salesman
Travelling salesman
Travelling salesman
Travelling salesman with time windows
Two-constraint bin packing
Two-constraint bin packing
Two-dimensional cutting/packing: non-rectangular items
Uncapacitated r-Allocation p-Hub Median
Vehicle routing
Vehicle routing
Vehicle routing
Vehicle Routing with Intermediate Replenishment Facilities (VRPIRF)
Vehicle Routing with Three-Dimensional Loading Constraints
Vehicle routing: multi-depot
Vehicle routing: multi-depot
Vehicle routing: multi-depot
Vehicle routing: multi-depot
Vehicle routing: multi-depot with time windows
Vehicle routing: multi-depot with time windows
Vehicle routing: period routing with time windows
Vehicle routing: period routing with time windows
Vehicle routing: single period with pick-ups and deliveries
Vehicle routing: single period with time windows
Vehicle routing: single period with time windows
Vehicle routing: single period with time windows
Vehicle routing: single period with time windows and pick-ups and deliveries
Vertex Separation
Weber (continuous) location
Weighted tardiness with sequence-dependent setup
Workforce scheduling
Workforce scheduling