A genetic algorithm for maximum-weighted tree matching problem

Authors:
Mehmet Gulek;Ismail H. Toroslu
Affiliations:
Department of Computer Engineering, METU, 06531 Ankara, Turkey;Department of Computer Engineering, METU, 06531 Ankara, Turkey
Venue:
Applied Soft Computing
Year:
2010

Citing 7
Cited 0

Personnel assignment problem with hierarchical ordering constraints

Computers and Industrial Engineering
Genetic algorithm for the personnel assignment problem with multiple objectives

Information Sciences: an International Journal
Automatic extraction and identification of chart patterns towards financial forecast

Applied Soft Computing
Selecting critical clinical features for heart diseases diagnosis with a real-coded genetic algorithm

Applied Soft Computing
Multi-criteria human resource allocation for solving multistage combinatorial optimization problems using multiobjective hybrid genetic algorithm

Expert Systems with Applications: An International Journal
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering

Computers and Operations Research
An integrated multi-objective optimisation and fuzzy multi-attributive group decision-making technique for subdivision arrangement of Ro-Ro vessels

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

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.