Back to Search
Start Over
A genetic algorithm for maximum-weighted tree matching problem.
- Source :
- Applied Soft Computing; Sep2010, Vol. 10 Issue 4, p1127-1131, 5p
- Publication Year :
- 2010
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15684946
- Volume :
- 10
- Issue :
- 4
- Database :
- Supplemental Index
- Journal :
- Applied Soft Computing
- Publication Type :
- Academic Journal
- Accession number :
- 52936450
- Full Text :
- https://doi.org/10.1016/j.asoc.2009.09.013