Is SIMD worth the hassle?

I've read a little on SIMD packages and how they work, and this article states that loading data into the vectors is slow, and there's a cache, and ideally you should keep the data there, and do minimum loads and maximum operations. I wonder if this will be an issue on Dijkstra graph traversal problem. Every vertex has a two vectors: one with target vertices, another with costs to reach there. The graph has ~2000 vertices in total. Every vertex has ~20-50 edges from it, and each element is u16,...