Random Rearrangement Rocks!

Hi experts!
Random Rearrangement Rocks!

Goal:
Imagine you have a line of rocks.  Each rock has been given a specific title.  In this case, the rocks are labeled after each letter in the English alphabet and then numbers 1-18.  The goal is to get the rocks from the current order to the final order (from A-Z, 1-18) in the FEWEST NUMBER OF STEPS POSSIBLE.


Current Order:
A_D_Y_Z_1_3_C_4_B_F_5_W_X_P_17_18_6_7_8_9_10_11_L_G_M_J_K_I_O_N_H_12_13_Q_14_R_15_16_S_V_E_T_U_2

Final Order:
A_B_C_D_E_F_G_H_I_J_K_L_M_N_O_P_Q_R_S_T_U_V_W_X_Y_Z_1_2_3_4_5_6_7_8_9_10_11_12_13_14_15_16_17_18


Rules:
1.  When you pick up a rock and place it into a new location, the rest of the line of rocks shifts down.  Imagine a line of people waiting to pay for candy.  If one person cuts another person, the entire line moves back one position.
 
2.  You can pick up a rock (or adjacent rocks) and move it at the same time.  You cannot move rocks that are separated in one step.

3.  If you pick up multiple rocks, you cannot place them down in a different order than what you picked them up as.


Suggestion:
It might be easier to use Microsoft Excel to complete this puzzle as movement of columns follows the rules laid out.  For example, using cut and insert.  To this end, I've attached an Excel 2003 file that has things prearranged for you.


Award:
500 points, but only if your steps are clearly laid out.  (Example: Cut Cols D-F, Insert Before Col G).  I will keep the question open until an accurate solution is posted and activity is minimized.

If you have any questions, please ask.  Happy solving!