IDEAS home Printed from https://ideas.repec.org/a/ags/pdcbeh/204193.html
   My bibliography  Save this article

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

Author

Listed:
  • Simona, Dinu
  • Raluca, Pacuraru

Abstract

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.

Suggested Citation

  • Simona, Dinu & Raluca, Pacuraru, 2011. "Intelligent modeling method based on genetic algorithm for partner selection in virtual organizations," Business and Economic Horizons (BEH), Prague Development Center (PRADEC), vol. 5(2), pages 1-12, April.
    • Handle: RePEc:ags:pdcbeh:204193
    DOI: 10.22004/ag.econ.204193
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/204193/files/201107081549_03_BEH_5_RO_DinuSimona_et_al_Intelligent_Modeling.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.204193?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Famuyiwa, Oluwafemi & Monplaisir, Leslie & Nepal, Bimal, 2008. "An integrated fuzzy-goal-programming-based framework for selecting suppliers in strategic alliance formation," International Journal of Production Economics, Elsevier, vol. 113(2), pages 862-875, June.
    2. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    3. Ip, W. H. & Yung, K. L. & Wang, Dingwei, 2004. "A branch and bound algorithm for sub-contractor selection in agile manufacturing environment," International Journal of Production Economics, Elsevier, vol. 87(2), pages 195-205, January.
    4. Manju K. Ahuja & Kathleen M. Carley, 1999. "Network Structure in Virtual Organizations," Organization Science, INFORMS, vol. 10(6), pages 741-757, December.
    5. Talluri, Srinivas & Baker, R. C. & Sarkis, Joseph, 1999. "A framework for designing efficient value chain networks," International Journal of Production Economics, Elsevier, vol. 62(1-2), pages 133-144, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dinu Simona & Pacuraru Raluca, 2011. "Intelligent modeling method based on genetic algorithm for partner selection in virtual organizations," Business and Economic Horizons (BEH), Prague Development Center, vol. 5(2), pages 23-34, April.
    2. Ip, W. H. & Yung, K. L. & Wang, Dingwei, 2004. "A branch and bound algorithm for sub-contractor selection in agile manufacturing environment," International Journal of Production Economics, Elsevier, vol. 87(2), pages 195-205, January.
    3. Wu, Chong & Barnes, David, 2010. "Formulating partner selection criteria for agile supply chains: A Dempster-Shafer belief acceptability optimisation approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 284-293, June.
    4. Wang, William Y.C. & Chan, Hing Kai, 2010. "Virtual organization for supply chain integration: Two cases in the textile and fashion retailing industry," International Journal of Production Economics, Elsevier, vol. 127(2), pages 333-342, October.
    5. Volpentesta, Antonio P., 2008. "Hypernetworks in a directed hypergraph," European Journal of Operational Research, Elsevier, vol. 188(2), pages 390-405, July.
    6. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    7. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    8. Beomjin Choi & T. S. Raghu & Ajay Vinzé & Kevin J. Dooley, 2019. "Effectiveness of standards consortia: Social network perspectives," Information Systems Frontiers, Springer, vol. 21(2), pages 405-416, April.
    9. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    10. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    11. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    12. Cakravastia, Andi & Toha, Isa S. & Nakamura, Nobuto, 2002. "A two-stage model for the design of supply chain networks," International Journal of Production Economics, Elsevier, vol. 80(3), pages 231-248, December.
    13. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    14. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    15. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    16. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    17. M. Vanhoucke, 2006. "A scatter search procedure for maximizing the net present value of a project under renewable resource constraints," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/417, Ghent University, Faculty of Economics and Business Administration.
    18. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    19. Yamashita, Denise Sato & Armentano, Vinicius Amaral & Laguna, Manuel, 2006. "Scatter search for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 169(2), pages 623-637, March.
    20. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.

    More about this item

    Keywords

    Productivity Analysis;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ags:pdcbeh:204193. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: AgEcon Search (email available below). General contact details of provider: https://edirc.repec.org/data/pradecz.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.