We show the problem of transport network design system in lattice with long-rangernconnections which is limited by the cost constraint.rnOur transport network is constructed from two dimensional (d=2) square lattice thatrncan be improved by introducing long-range connections to each other with probability,rnpij _ rÀ€€_rnij , where rij is the Manhattan distance between two sites i and j, and _ isrna variable exponent. Furthermore, we applied a cost constraint on the total lengthrnof the additional links and search optimal transport in the system for _ = 2:4 whichrncan be applicable for two dimension. This situation remains optimal for lattice sizernranging from 60 up to 150.