Aiming at the problems of poor data transmission reliability， fast node energy consumption， short network life cycle and routing holes in intelligent distribution network WSNs， this paper studies a membrane computing-ant colony routing (MCACR) algorithm. By introducing a dynamic compensation factor in the state transition function， the MCACR algorithm avoids premature stagnation due to the high pheromone by using the parallel computing ability of intra-membrane operation and inter-membrane operation of the membrane， combined with the introduction of the optimal path measurement formula. The multipath parallel search obtains the optimal path， which improves the local and global convergence ability of the MCACR algorithm. By defining a route repair mechanism， the MCACR algorithm avoids routing holes. Simulation results show that the MCACR algorithm has been significantly enhanced in terms of reliable routing of data， achieving energy-saving requirements and extending network life.