Permutation polytopes arise in a class of problems in which the objective is to find an optimal complete ordering of some given alternatives, subject to a linear objective criterion. In this paper  an easy characterization is given of neighbors on permutation polytopes. Using this characterization it is shown that the graph of  any such polytope is Hamiltonian, and that the diameter is two. 

The methods used are combinatorial in nature.