This paper proposes an improved CNP algorithm for distributed task allocation. Considering the dynamic task tenderer migration, we integrate multi-round iterative optimization to allocate tasks. By iteratively expanding the search area, the tenderer agent is reassigned, and the task tenderer migration strategy gradually improves the optimality of task allocation for failed cases. Simulation experiments can prove the effectiveness of the proposed approach.