[gecode-users] Analysing search performance

[Lars Otten]

Hello everyone,

I've modeled the basic parts of the Tail Assignment Problem [1] in Gecode,
specifically by implementing two custom constraints inverse(x,y) and
tunneling(x,y,z) -- x,y,z being variable arrays of the same length.

I also have access to some of the example instances the author of [1] used
and have tried them on my self-extended Gecode. Unfortunately the running
times for finding a single solution is orders of magnitude worse than what
was accomplished in [1]. The original system is admittedly hand-tailored to
the problem, but then again I've only implemented the basic model, which
lacks some of the more complicated custom constraints the solution in [1]
takes into account.

Hence I'd like to make some kind of analysis of where the depth first search
in Gecode spends it time, to find potential bottlenecks. For a start it
would e.g. be nice to see how much time is spent propagating my custom
constraints (or all constraints in general).

Is there any way to do this in Gecode? I realize this might also be a more
general C++ question, in this case I'd appreciate any pointers on where to
look for more info...

Thanks in advance,
/Lars


[1] http://publications.lib.chalmers.se/records/full_record/6207.html