Multiobjective Traveling Salesman Problem (MOTSP)
2 objectives, 100 cities, symmetric instances
Krolak/Felts/Nelson instances and DIMACS instances
(16 datasets) (16 Pareto Fronts)
(6 Pareto Sets) (4 Pareto Sets) (6 Pareto Sets)
NEW! (conference presentation)
Larger Problems
2 objectives, 150 cities
3 objectives, 15 cities
2 objectives, 100,300,500,750,1000 cities
(7 datasets) (2 Pareto Fronts and 5 Nondominated Fronts)
GAMS code (MOTSP)
Source code implementing AUGMECON2 method in Fortran and modified BCHTSP method
in GAMS for the exact solution of the randAB100 benchmark (1 file) (instructions)
Matlab movie* (MOTSP)
Illustrative video clip for the MOTSP showing the evolution of the Pareto optimal tours
concurrently for the two objective functions along the Pareto front for the kroAB100 benchmark (movie)
*viewed on Windows Media Player
Multiobjective Set Covering Problem (MOSCP)
2 objectives, 10-200 constraints, 100-1000 variables (44 datasets) (44 Pareto Fronts)
MOCOlib instances