  Given a positive real value $\delta$, a set $P$ of points along a line and a
distance function $d$, in the movement to independence problem, we wish to move
the points to new positions on the line such that for every two points
$p_{i},p_{j} \in P$, we have $d(p_{i},p_{j}) \geq \delta$ while minimizing the
sum of movements of all points. This measure of the cost for moving the points
was previously unsolved in this setting. However for different cost measures
there are algorithms of $O(n \log(n))$ or of $O(n)$. We present an $O(n
\log(n))$ algorithm for the points on a line and thus conclude the setting in
one dimension.
