Standard problem sets for metaheuristics I'm wanting to dabble with metaheuristics and am interested to know what the "hello world" problem sets are.

In other words, what are the common problems (e.g Traveling Salesman, Vehicle Routing Problem, Maze Solving) to test various algorithms against in order to compare algorithm design?
are these any good to you?

Binary Welded Tree (BWT). To ﬁnd a labeled node in a 
graph

BooleanFormula(BF). To evaluate a NAND formula 

ClassNumber (CL). To approximate the class group of a real 
quadratic numberﬁeld

GroundStateEstimation(GSE). To compute the ground state 
energy level of a particular molecule

QuantumLinear Systems(QLS). To solve a linear system of 
equations 

UniqueShortest Vector (USV). To choose the shortest vector 
among a given set

Triangle Finding(TF). To exhibit a triangle inside a dense 
graph