HIP-HOP

HIP-HOP is the recursive acronym of "HIP-HOP is an Instance Perturbation based Hyper-heuristic Optimization Procedure".

Benchmark Instances

HIP-HOP is tested over two minimization problems, i.e., the Ising Spin Glass (ISG) problem and the p-Median Problem. The benchmark instances could be download here:

• ISG instances, which are generated using rudy, with the parameter -spinglass2g. The global optimal solutions could be obtained using the Spin Glass Ground State Server.
• p-Median instances, which consist of 40 ORLIB instances and 20 TSPLIB instances (fl1400 and fl1577 with various values of p). More specifically, the best known results for the TSPLIB instances are achieved by popstar and ALCMA.

The complete numerical results over all the instances are reported in a technical report, which could be downloaded here.

Right now this page is under construction.

If you have any question, please contact Zhilei Ren, School of Software, Dalian University of Technology. E-mail: ren at mail dot dlut dot edu dot cn