Research Article

A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems

Table 8

Comparing VNS-CSP with tabu and ACO metaheuristics.

Instances ACO-SSP (vertex) ACO-SSP (clique) Tabu VNS-CSP

frb30-15 5 (0.4) 5 (1.3) 5 (0.5) 5 (0.18)
frb35-17 5 (3.0) 5 (5.0) 5 (0.9) 5 (0.26)
frb40-19 5 (7.0) 5 (103.5) 5 (9.1) 5 (0.39)
frb45-21 5 (467.7) 5 (354.1) 5 (43.4) 5 (0.56)
frb50-23 3 (430.4) 3 (680.5) 4 (9.9) 5 (0.80)
frb53-24 3 (105.7) 3 (530.8) 4 (291.6) 5 (0.99)
frb56-25 2 (535.8) 2 (170.2) 4 (329.3) 5 (1.01)
frb59-26 1 (63.6) 0 (—) 4 (523.7) 5 (1.28)