How to make the algorithm always choose first the nearest services

Hi! I have the following problem:

I want to make the algorithm choose always the nearest services and then all the neighbor ones.
Example: starting from point 46 the order I need is 46 43 45 44 instead of the order shown in the image.
The route in the image is optimized with RegretConcurrentInsertion and RadialRuin.

Should I set up a soft constraint or make changes to the algorithm to always achieve the order I need?

This could be done by soft constraint which will penalize solution based on distance between new and previous job. The lower the distance the better. Look at SoftActivityConstraint, but be beware of computation cost. SoftActivityConstraint is expensive. You can try achive this by SoftRouteConstraint, but maybe there wont be enough information for decision.