The goal of property testing is to quickly distinguish between objects which satisfy a property and objects that are epsilon-far from satisfying the property. There are now several general results in this area which show that natural properties of combinatorial objects can be tested with ``constant'' query complexity, depending only on epsilon and the property, and not on the size of the object being tested. The upper bound on the query complexity coming from the proof techniques are often enormous and impractical. It remains a major open problem if better bounds hold. Hoppen, Kohayakawa, Moreira, and Sampaio conjectured and Klimosova and Kral proved that hereditary permutation properties are strongly testable, i.e., can be tested with respect to Kendall's tau distance. The query complexity bound coming from this proof is huge, even for testing a single forbidden subpermutation. We give a new proof which gives a polynomial bound in 1/epsilon in this case. Maybe surprisingly, for testing with respect to the cut metric, we prove there is a universal (not depending on the property), polynomial in 1/epsilon query complexity bound for two-sided testing hereditary properties of sufficiently large permutations. We further give a nearly linear bound with respect to a closely related metric which also depends on the smallest forbidden subpermutation for the property. Finally, we show that several different permutation metrics of interest are related to the cut metric, yielding similar results for testing with respect to these metrics. This is joint work with Jacob Fox.