50
votes
Accepted
Optimization Problem Libraries
Quadratic assignment problem
Vehicle routing problem also at HEC
Traveling salesman
Graph partitioning
Quantified Boolean formulas
Constraint solvers
Shortest paths
Mixed integer programming
Train ...
- 2,755
27
votes
Optimization Problem Libraries
Here is a start. Please add to this.
BOBILib: Bilevel Optimization (Benchmark) Instance Library https://optimization-online.org/wp-content/uploads/2024/07/BOBILib-report-1.pdf
BOLIB: Bilevel ...
- 13.9k
14
votes
Optimization Problem Libraries
Some more libraries:
Biq Mac Library: a Binary quadratic and max cut Library: http://biqmac.uni-klu.ac.at/biqmaclib.html
OR Library: a collection of test data sets for a variety of Operations ...
- 1,132
13
votes
Accepted
Small Traveling Salesman Problem instance
There is a paper of Ahammed and Moscato on finding hard instances for Concorde using Lindenmeyer systems. They were able to find small instances with about 1500 cities that took (in 2011) more than 4 ...
- 2,755
13
votes
Optimization Problem Libraries
Some other libraries (mainly for MINLP) are:
MINLP-Lib.
PrincetonLib.
- 1,095
11
votes
Optimization Problem Libraries
Some more:
Atamturk datasets on fixed-charge flow, lot sizing, mixed-integer knapsack, and more
Combinatorial Auction Test Suite (CATS)
National Traveling Salesman Problems
VLSI data sets: Another ...
- 5,904
11
votes
Where can I find test instances for convex quadratic programming?
There are at least three more problem libraries that you can access.
OR-Lib has instances of Quadratic Assignment/Knapsack/Minimum spanning tree that you can use.
MINLP-Lib has several QP, BQP, IQP ...
- 1,095
10
votes
Optimization Problem Libraries
Some libraries for stochastic programming test problems may be found in
Jeff Linderoth, Alex Shapiro, and Stephen Wright (2002)
POSTS: A (PO)rtable (S)tochastic programming (T)est (S)et (Derek ...
- 261
8
votes
Small Traveling Salesman Problem instance
There is a paper by Papadimitriou and Steiglitz here to construct instances, which are very hard for local searches to find optimal solution.
- 366
8
votes
Where can I find test instances for convex quadratic programming?
You can reformulate Quadratic Programs as Second Order Conic Programs (SOCPs). Therefore, you can use many conic benchmark libraries and filter SOCPs.
For example, Conic Benchmark Library can be a ...
- 4,030
8
votes
Optimization Problem Libraries
Would these be helpful?
1) OptaPlanner examples problem definitions and data sets
Original problems: cloud balancing, dinner party, tennis club scheduling, meeting scheduling, task assigning, ...
- 5,041
7
votes
GAMS CPLEX solver solves big problem instances suspiciously fast
For a test problem, check manually (outside GAMS) that the solution satisfies all constraints. If not, your GAMS model may be wrong. If all constraints are satisfied, try using a different solver and ...
- 40.9k
7
votes
Benchmark problems for scenario-based stochastic optimization
You can check the Test Sets section of the Stochastic Programming Resources website. It contains different types of problems — two-stage or multi-stage, mixed or ...
- 161
5
votes
GAMS: Is there a way to retrieve the gap from the final solve statement
Collecting things in a parameter is actually very simple.
...
- 2,959
5
votes
Benchmark problems for scenario-based stochastic optimization
Pantelis,
It is a great detriment that no such collection of examples exists. One problem is that there is no established format for multistage problems like MPS. (There is SMPS [paper], but this ...
- 51
5
votes
Benchmark problems for scenario-based stochastic optimization
"Ruszczynski, Andrzej, and Robert J. Vanderbei. "Frontiers of stochastically nondominated portfolios." Econometrica 71.4 (2003): 1287-1297". This paper provides a large number of test problems which ...
- 8,687
3
votes
How can one iterate over all instances and solve them in GAMS?
You cannot loop over include files ($include is compile-time, while loop is execution- time, this is similar to say C where you cannot loop over #include). One could loop over complete GAMS models (...
- 2,959
3
votes
Accepted
Is there a library of infeasible MINLP problems?
You can check the following weblink:
https://www.minlp.com/nlp-and-minlp-test-problems
- 194
3
votes
Accepted
Difference between Solomon's problem instances
There is a good description of different problem instances here. From the link:
...benchmark problems (Solomon, 1987) composed of six different problem types (C1,C2,R1,R2,RC1,RC2). Each data set ...
- 5,904
3
votes
How to create good model instances
If you are working with an organization that would actually put your model into practice, it would make sense to ask them for some real-world examples. Beyond that, you could look for related research ...
- 40.9k
2
votes
How to create good model instances
In addition to @prubin's answer I would also suggest to go on the hunt for difficult instances. By that I mean, instead of creating instances according to a single pattern, try to generate multiple ...
- 6,757
2
votes
Accepted
Kim et al.'s (2006) waste collection VRP-IF
Here I found the correct link: http://logistics.postech.ac.kr/benchmark.html
- 8,687
1
vote
How to generate random connected planar graph?
Here are two approaches, both for an undirected graph (but easily modified to handle a digraph).
Method 1: Start with a complete graph (in the sense that all legal edges exist). Compile a list of all ...
- 40.9k
1
vote
Accepted
How to generate hard instances for number partitioning?
In "Optimal Multi-Way Number Partitioning" (Schreiber, Korf and Moffitt, JACM 2018) the authors present experiments with random integers with 16, 32 and 48 bits. 16 bit integers are ...
1
vote
Small Traveling Salesman Problem instance
Hard to Solve Instances of the Euclidean Traveling Salesman Problem provides awhole class of hard to solve small instances for the planar Euclidean TSP; the are also downloadable instances.
- 111
1
vote
Optimization Problem Libraries
There is also:
GasLib, with gas network instances based on perturbed real-world data.
- 2,326
Only top scored, non community-wiki answers of a minimum length are eligible