This paper considers the archeological seriation problem defined over incidence matrices. Two procedures adapted from interchange algorithms for the travelling salesman problem are described and tested on 31 problems extracted from the literature. The better of these two procedures consistently yields excellent solutions and appears to outperform previous algorithms.