A heuristic for the time constrained asymmetric linear sum assignment problem

Peter Brown, Yuedong Yang, Yaoqi Zhou and Wayne Pullan ()
Additional contact information
Peter Brown: Griffith University
Yuedong Yang: Griffith University
Yaoqi Zhou: Griffith University
Wayne Pullan: Griffith University

Journal of Combinatorial Optimization, 2017, vol. 33, issue 2, No 11, 566 pages

Abstract: Abstract The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an $$n \times m, m \ge n$$ n × m , m ≥ n benefit matrix $$B = (b_{ij})$$ B = ( b i j ) , matching each row to a different column so that the sum of entries at the row-column intersections is maximised. This paper describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version ( $$n \ne m$$ n ≠ m ) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment between two proteins, normally of different numbers of amino acids, needs to be maximised.

Keywords: Heuristic search; Optimization; Linear sum assignment; Protein structure alignment (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9979-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9979-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9979-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().