The mobile sink is introduced into the cluster sensor network to assist its upper network in aggregating data. In order to solve the contradiction between the delay constraint and the demand of energy saving, an optimal path selection algorithm for the mobile sink based on nodes’ utility priority and anti utility priority is proposed. According to the principle of minimum energy consumption, a path searching scheme for non-visit nodes moving data is designed. On this basis, a visitpoint set greedy construction algorithm based on nodes’ utility priority is proposed, and two kinds of optimization scheme for it are designed based on nodes’ anti utility priority. Simulation experiments verify the effectiveness of the proposed algorithm, and the delay requirement can be guaranteed while minimizing the energy consumption of the network.