A genetic algorithm for maximum-weighted tree matching problem

Gulek M., TOROSLU İ. H.

APPLIED SOFT COMPUTING, cilt.10, sa.4, ss.1127-1131, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 10 Sayı: 4
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.asoc.2009.09.013
  • Dergi Adı: APPLIED SOFT COMPUTING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1127-1131
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In hierarchal organizations, for assigning tasks to the divisions of the organization some constraints must be satisfied. This article investigates one such problem in which there are k different tasks to be accomplished and each division's performance on each task may be different and represented by a scalar value. In this article we formally introduce this real life decision problem, named as Maximum-Weighted Tree Matching Problem, and propose a genetic algorithm solution to it, and give some experimental results. (C) 2009 Elsevier B. V. All rights reserved.