We link to the collection of instances for the MOSP problem by J. M. Paixão and J. L. Santos [2].
1080 instances with 3 to 6 objectives and different sizes. For each class there are 20 instances available. The objective function coefficients were chosen uniformly as integers from [1, 20].
The instance generation mechanism was also used in [1, 3].
| Objectives | Resources (Stepsize) |
|---|---|
| 3 | 40 – 200 (10) |
| 4 | 10 – 100 (5) |
| 5 | 8 – 22 (2) |
| 6 | 4 – 22 (2) |
[1] Özpeynirci, Ö., and Köksalan, M. An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science 56, 12 (2010), 2302–2315.
[2] Paixao, J., and Santos, J. Labelling methods for the general case of the multiobjective shortest path problem: a computational study. In Computational Intelligence and Decision Making, Intelligent Systems, Control and Automation: Science and Engineering. Springer Netherlands, 2009, pp. 489–502.
[3] Przybylski, A., Gandibleux, X., and Ehrgott, M. A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS Journal on Computing 22, 3 (2010), 371–386.