Most　of　the　existing　track　allocation　works　neglect　the　local　nets　problem,　and　are　prone　to　fall　into　the　local　extremums.　Based　on　discrete　particle　swarm　optimization,　genetic　operation　and　negotiation-based　refining　strategy,　a　track　assignment　algorithm　is　proposed　by　considering　local　nets,　overlapping　conflict,　wirelength　and　blockages.　The　algorithm　abstracts　local　nets　and　constructs　the　corresponding　model　of　segments.　To　expand　population　diversity,　hybrid　genetic　operation　is　incorporated　to　improve　the　efficiency　of　global　search.　At　the　same　time,　a　simple　and　efficient　fitness　function　is　designed.　Finally,　the　negotiation-based　refining　strategy　is　exploited　to　further　reduce　the　overlap　of　segments.　The　experimental　results　indicate　the　effectiveness　of　the　proposed　algorithm.　The　algorithm　can　obtain　better　overlapping　cost　index　optimization　value　and　reduce　the　congestion　in　the　key　routing　area.　©　2019,　Science　Press.　All　right　reserved.