A genetic algorithm for maximum-weighted tree matching problem

Date

2010-09-01

Author

Gulek, Mehmet
Toroslu, İsmail Hakkı

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

2
views

0
downloads

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.

Subject Keywords

Software

URI

https://hdl.handle.net/11511/49093

Journal

APPLIED SOFT COMPUTING

DOI

https://doi.org/10.1016/j.asoc.2009.09.013

Collections

Department of Computer Engineering, Article