Though I have no practical experience with this sorting algorithm, I
found these lines useful in wikipedia:
..It is a variation of the sorting problem in which the only allowed
operation is to reverse the elements of some prefix of the sequence.
Unlike a traditional sorting algorithm, which attempts to sort with
the fewest comparisons possible, the goal is to sort the sequence in
as few reversals as possible.
It also states that, it has applications in parallel processor networks,
in which it can provide an effective routing algorithm between processors.
I, personally also faced several online judge programming contest problems
that require minimum number of reversals to sort a sequence.
Although programming contest problem are not real world problem