IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Intelligent modeling method based on genetic algorithm for partner selection in virtual organizations

Listed author(s):
  • Dinu Simona


    (Faculty of Naval Electromechanics, Constanta Maritime University, Romania)

  • Pacuraru Raluca

    (Faculty of Accounting and Financial Management, Constanta “Spiru Haret” University, Romania)

Registered author(s):

    The goal of a Virtual Organization is to find the most appropriate partners in terms of expertise, cost wise, quick response, and environment. In this study we propose a model and a solution approach to a partner selection problem considering three main evaluation criteria: cost, time and risk. This multiobjective problem is solved by an improved GA that includes meiosis specific characteristics and step-size adaptation for the mutation operator. The algorithm performs strong exploration initially and exploitation in later generations. It has high global search ability and a fast convergence rate and also avoids premature convergence. On the basis of the numerical investigations, the incorporation of the proposed enhancements has been successfully proved.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    File URL:
    Download Restriction: no

    Article provided by Prague Development Center in its journal Business and Economic Horizons (BEH).

    Volume (Year): 5 (2011)
    Issue (Month): 2 (April)
    Pages: 23-34

    in new window

    Handle: RePEc:pdc:jrnbeh:v:5:y:2011:i:2:p:23-34
    Contact details of provider: Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:pdc:jrnbeh:v:5:y:2011:i:2:p:23-34. 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: (Jaroslav Holecek)

    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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.