A generalized insertion algorithm for the seriation problem

  • Authors:

  • M. Gendreau;A. Hertz;G. Laporte

  • Affiliations:

  • Département d'Informatique et de Recherche opérationnelle Université de Montréal, Case postale 6128, succursale A, Montréal, Canada H3C 3J7;Département de Mathématiques, École Polytechnique Fédérale de Lausanne CH-1015 Ecublens Switzerland;GERAD, École des Hautes Études Commerciales de Montréal 5255 avenue Decelles, Montréal, Canada H3T 1V6

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1994

Quantified Score

Hi-index 0.98

Visualization

Abstract

Given a binary matrix E, the Seriation Problem consists of determining a permutation of the rows of E minimizing the sum over all columns of the differences between the last and first nonzero element. This problem is derived from an archaeological context, but has applications in several other fields. We present a new generalized insertion heuristic for this problem. The proposed heuristic outperforms other methods on a series of benchmark problems.