Distribution　network　reconfiguration　(DNR)　is　a　hard　non-deterministic　polynomial　problem　of　combinatorial　optimization　with　numerous　dimensions,　numerous　non-linear　constraints.　In　order　to　further　improve　efficiency　of　distribution　network　reconfiguration,　this　paper　builds　mathematical　model　with　minimum　network　power　loss　as　objective　function　to　determine　basic　loop　set　based　on　minimum　spanning　tree,　and　proposes　coding　strategy　combining　loop　group　search　and　individual　loop　replacement　to　improve　binary　particle　swarm　optimization.　Finally,　with　IEEE-33　case　study,　horizontal　and　vertical　comparisons　for　different　algorithms　are　conducted.　Simulation　results　show　that　method　proposed　in　this　paper　has　significant　advantages　in　reducing　search　space,　increasing　optimization　success　rate　and　enhancing　computing　efficiency.　Search　methods　and　update　policies　of　the　algorithm　provides　a　new　idea　for　distribution　network　reconfiguration.　©　2016,　Power　System　Technology　Press.　All　right　reserved.