Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
497216 | Applied Soft Computing | 2010 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Mehmet Gulek, Ismail H. Toroslu,