I have always felt strongly that operations research needs more libraries of instances for various problem classes, along with listings of current best solutions. By tracking how well we solve problems over time, we can show how we advance as a field. It also makes it easier to evaluate new work, making both authors and referees work easier.

I began this direction almost two decades ago when I spent a year at DIMACS (a fantastic research institute on discrete mathematics and computer science based at Rutgers) when I (together with David Johnson) ran their Computational Challenge, with an emphasis on solving graph coloring, clique, and satisfiability instances. From that, I put together a page on graph coloring (which has to be one of the oldest pages on the internets!) David, Anuj Mehrotra and I followed that up in 2003 with an updated challenge just on graph coloring. It was great to see people re-use the same instances, so we could understand the advances in the field. It is hard to tell exactly how many papers have used the various benchmark repositories, but it is clearly the basis for hundreds of papers, based on google scholar hits on the DIMACS paper referencing the instances.

I had this experience in mind ten years ago when Kelly Easton, George Nemhauser and I wanted to publish about work we had done with Major League Baseball in their scheduling. It made no sense to use MLB as a benchmark, since there is only one instance per year and much of the information about the needs of a schedule is confidential. So we created the Traveling Tournament Problem that abstracts two key issues in MLB scheduling: travel distance, and “flow” (the need to mix home and away games). We created a set of instances, solving a few smaller ones, and let it loose on the world. The result was fantastic: dozens of groups started working on the problem, and we could clearly see which techniques worked and which didn’t.

I had made a terrible mistake when creating benchmarks for graph coloring. I didn’t keep track of best results. This led to a fair amount of chaos in the field, with contradictory results appearing (claimed coloring values better than claimed lower bounds), and no clear picture of where things are going. I had thought at one time that I would try to clean things up with a “Repository of Optimization Instances and Solutions”, but too many other things have intruded for me to spend the time necessary on that. Fortunately, Stefano Gualandi and Marco Chiarandini have put together a site for graph coloring solutions, and I hope they will be successful in their efforts to put a little structure in the field.

I learned from that mistake and was much more diligent about keeping track of solutions for the Traveling Tournament Problem. The TTP site is always up to date (OK, almost always), so people can reasonably trust the results there. I have recently extended the site to include instances for non-round-robin scheduling and for the Relaxed TTP (where there is an opportunity for off-days).

One relatively new problem I am excited about is scheduling umpires in sports. Former doctoral students Hakan Yildiz (now at Michigan State) and Tallys Yunes (Miami) and I developed a problem called the Traveling Umpire Problem which again tried to abstract out key issues in Major League Baseball scheduling. In this case, the umpires want to travel relatively short distances (unlike the players, the umpires have no “home city”, so they are always traveling) but should not see the same teams too often. This problem feels easier than the Traveling Tournament Problem, but we still cannot solve instances with 14 or more umpires to optimality. This work received a fair amount of interest when the university PR people caught hold of our *Interfaces* paper. Since that paper, Hakan and I have put together a couple of other papers, exploring optimization-based genetic algorithms and benders-based local search approaches for this problem (to appear in Naval Research Logistics). Both papers illustrate nice ways of using optimization together with heuristic approaches. The website for the problem gives more information on the problem, along with instances and our best solutions.

I don’t think my repositories of benchmarks will be as influential as, say MIPLIB, which focuses on mixed integer programs. But I do like to think that they make the operations research world run a bit smoother.

I would be interested in both benchmarks and a repository of useful “pattern” models, along the lines of H. P. Williams excellent book. The examples file in GLPK and the netlib APML repositories are great for this, but, well, more is better.