An Invasive Weed Optimization Algorithm for the Resource Availability Cost Problem
In this paper, an Invasive Weed Optimization (IWO) algorithm for the Resource Availability Cost Problem (RACP) is presented, in which the total cost of the (unlim- ited) renewable resources required to complete the project by a pre-specified project deadline should be minimized. The IWO algorithm is a new search strategy, which makes use of mechanisms inspired by the natural behavior of weeds in colonizing and finding a suitable place for growth and reproduction. In this paper, the algorithm is used for the first time to solve a project scheduling problem. All algorithmic compo- nents are explained in detail and computational results for the RACP are presented.
|Date of creation:||Jan 2011|
|Contact details of provider:|| Postal: Hoveniersberg 4, B-9000 Gent|
Phone: ++ 32 (0) 9 264 34 61
Fax: ++ 32 (0) 9 264 35 92
Web page: http://www.ugent.be/eb
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:11/697. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.