A genetic algorithm for maximum-weighted tree matching problem
APPLIED SOFT COMPUTING, vol.10, no.4, pp.1127-1131, 2010 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 10 Issue: 4
- Publication Date: 2010
- Doi Number: 10.1016/j.asoc.2009.09.013
- Journal Name: APPLIED SOFT COMPUTING
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.1127-1131
- Middle East Technical University Affiliated: Yes
Abstract
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.