LOLIB
Real input/output matrices and Stanford GraphBase instances from the established Linear Ordering Problem Library.
StatusReady
Algorithm × seed0 / 0
Evaluations / run10,000
Best score ↑—
Order nodes so the total weight of every forward-directed preference is as large as possible. This laboratory compares permutation GA, histogram models, ROSE and COIN variants under one evaluator and the same number of objective evaluations.
Real input/output matrices and Stanford GraphBase instances from the established Linear Ordering Problem Library.
Population × generations fixes the exact evaluation budget per algorithm and seed. Runtime remains a separate engineering measurement.