The MOCO Numerical Instances Library

A collection of test instances for Multiobjective Combinatorial Optimization problems

MCDMlib is a collection of test data sets for a variety of Multiobjective optimization problems. Originaly the MCDMlib was dedicated to MultiObjective Combinatorial Optimization (MOCO) problems. Since 2010, the MOCOlib is the MCDMlib section devoted to MOCO problems.

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

This collection of test instances has been created in 1998. Unfortunately, the MCDMlib has been closed in 2007 and deleted by the host without archiving the website. Do not refer any longer the old URL ( which is definitively dead.

Due to the important number of requests, the MCDMlib is coming back (July 28, 2010). The right URL to save in your bookmark and to refer is Step by step, the data files from the former MCDMlib will be reloaded here. I will rewrite later a short text describing the problem considered, the format of instances and more (e.g. the set of non dominated points when it is available).

I would specially thanks my former doctoral students who helped me to restore the website: Dr. Xavier Delorme (assistant professor, Ecole des mines de Saint Etienne), Dr. Anthony Przybylski (assistant professor, University of Nantes) and Dr. Julien Jorge (software engineer, Nantes).

MOCOlib is a collection of test data for a variety of MultiObjective Combinatorial Optimization (MOCO) problems of the MCDMlib. This collection is inspirated from the OR-Library 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.
The description of the library and the test data are available using the following link:
NB: Currently we are involved on the workpackage "Analysis of instances of MOCO problems, library of instances" of the ANR research project "Guepard". A new version of the library is expected for the coming months, again much more interesting and rich!
Test instances available online

MOLAP: Multiobjective Linear Assigment Problems (working on it)
MOKP: Multiobjective Knapsack Problems
MOSCP: Multiobjective Set Covering Problems
MOSPP: Multiobjective Set Packing Problems
Some papers mentioning the MCDMlib

Xavier Gandibleux, Arnaud Freville. Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: the two objectives case. Journal of Heuristics, 6 (3) 361-383, 2000.

Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh. The Supported Solutions Used as a Genetic Information in a Population Heuristic. In Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science 1993. Pages 429-442. Springer Berlin / Heidelberg. 2001.

Fabien Degoutin and Xavier Gandibleux. Un retour d'expérience sur la résolution de problèmes combinatoires bi-objectifs. 5e journée du groupe de travail Programmation Mathématique MultiObjectif (PM20), Angers, France, 17 mai 2002.

Andrzej Jaszkiewicz. A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm. Annals of Operations Research. Volume 131. Issue 1. Pages 135-158. 2004.

Hadrien Hugot, Daniel Vanderpooten, Jean Michel Vanpeperstraete. A bi-criteria approach for the data association problem Annals of Operations Research. Volume 147. Issue 1. Pages 217-234. 2006.

Ted K. Ralphs, Matthew J. Saltzman and Margaret M. Wiecek. An improved algorithm for solving biobjective integer programs. Annals of Operations Research. Volume 147, Issue 1, Pages 43 - 70. 2006

Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shibata, Keiichi Yasumoto and Minoru Ito. A Hardware Implementation Method of Multi-Objective Genetic Algorithms 2006 IEEE Congress on Evolutionary Computation. Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 2006. Pages 3153-3160.

Carlos Gomes da Silva, Jose Figueira, Joao Climaco. Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems. European Journal of Operational Research, Volume 177, Issue 3, Pages 1656-1677, 2007.

Pedersen, Christian Roed, Nielsen, Lars Relund, Andersen and Kim Allan. The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results. INFORMS JOURNAL ON COMPUTING 20: 400-411, 2008.

Xavier Delorme, Xavier Gandibleux, Fabien Degoutin. Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem. European Journal of Operational Research, Volume 204, Issue 2, Pages 206-217, 2010.

If you are author of a paper where the MCDMlib is mentioned, please send me an email with the corresponding reference. It will be added here.
Some PhD thesis mentioning the MCDMlib

Xavier DELORME. Modélisation et résolution de problèmes liés à l'exploitation d'infrastructures ferroviaires (in french). PhD thesis, University of Valenciennes, France. 2003.

Anthony PRZYBYLSKI. Méthode en deux phases pour la résolution exacte de problèmes d'optimisation combinatoire comportant plusieurs objectifs : nouveaux développements et application au problème d'affectation linéaire (in french). PhD thesis, University of Nantes, France. 2006.

Julien JORGE. Nouvelles propositions pour la résolution exacte du problème de sac-à-dos multiobjectif unidimensionnel en variables binaires (in french). PhD thesis, University of Nantes, France. 2010.

If you have used the MCDMlib for your PhD thesis, please send me an email with the corresponding reference. It will be added here.

Jump to... The Computer Science Department IRCCyN UMR CNRS 6597

The University of Nantes MSc in Computer Science, track "Optimization in OR"