Maximum-weighted tree matching problem: a novel discrete invasive weed optimisation algorithm
by M. Zandieh; E. Shokrollahpour; M. Bagher
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 16, No. 2, 2017

Abstract: This paper attempts to solve maximum-weighted tree matching problem (MWTMP). In this type of assignment problem, there are k different tasks to be accomplished and a number of workers/groups. Any worker/group can do any job, with some given profit. The problem is to assign the jobs to workers/groups with the aim of maximising the profit of assignments. This paper presents a novel discrete population-based algorithm, discrete invasive weed optimisation (DIWO) to solve MWTMP. This algorithm is a stochastic numerical algorithm and inspired by weed colonisation trying to find suitable place for growth and reproduction. The performance of the proposed method is examined over benchmarks from the literature and compared to the best algorithm introduced before. Computational results demonstrate the efficiency and robustness of DIWO.

Online publication date: Sat, 13-May-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com