{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:57:49Z","timestamp":1764997069613,"version":"3.46.0"},"reference-count":38,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2016,2,10]],"date-time":"2016-02-10T00:00:00Z","timestamp":1455062400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The operational efficacy of the grid computing system depends mainly on the proper management of grid resources to carry out the various jobs that users send to the grid. The paper explores an alternative way of efficiently searching, matching, and allocating distributed grid resources to jobs in such a way that the resource demand of each grid user job is met. A proposal of resource selection method that is based on the concept of genetic algorithm (GA) using populations based on multisets is made. Furthermore, the paper presents a hybrid GA-based scheduling framework that efficiently searches for the best available resources for user jobs in a typical grid computing environment. For the proposed resource allocation method, additional mechanisms (populations based on multiset and adaptive matching) are introduced into the GA components to enhance their search capability in a large problem space. Empirical study is presented in order to demonstrate the importance of operator improvement on traditional GA. The preliminary performance results show that the proposed introduction of an additional operator fine-tuning is efficient in both speed and accuracy and can keep up with high job arrival rates.<\/jats:p>","DOI":"10.1515\/jisys-2015-0089","type":"journal-article","created":{"date-parts":[[2016,2,10]],"date-time":"2016-02-10T14:44:12Z","timestamp":1455115452000},"page":"169-184","source":"Crossref","is-referenced-by-count":4,"title":["Grid Resource Allocation with Genetic Algorithm Using Population Based on Multisets"],"prefix":"10.1515","volume":"26","author":[{"given":"Absalom E.","family":"Ezugwu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Federal University Lafia, Nasarawa State, Nigeria"}]},{"given":"Nneoma A.","family":"Okoroafor","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Federal University Lafia, Nasarawa State, Nigeria"}]},{"given":"Seyed M.","family":"Buhari","sequence":"additional","affiliation":[{"name":"Department of Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia"}]},{"given":"Marc E.","family":"Frincu","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, West University of Timisoara, Timisoara, Romania"}]},{"given":"Sahalu B.","family":"Junaidu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Ahmadu Bello University, Zaria, Nigeria"}]}],"member":"374","published-online":{"date-parts":[[2016,2,10]]},"reference":[{"key":"2025120523280707576_j_jisys-2015-0089_ref_001_w2aab3b7d274b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"W. Abdulal and S. Ramachandram, Reliability-aware genetic scheduling algorithm in grid environment, in: IEEE International Conference on Communication Systems and Network Technologies, June 2011, pp. 673\u2013677, IEEE, ISBN 978-0-7695-4437-3\/11, Katra, Jammu, India.","DOI":"10.1109\/CSNT.2011.145"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_002_w2aab3b7d274b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"W. Abdulal, O. A. Jadaan, A. Jabas and S. Ramachandram, Mutation based simulated annealing algorithm for minimizing makespan in grid computing systems, in: IEEE International Conference on Network and Computer Science (ICNCS 2011). April 2011, Vol. 6. pp. 90\u201394, IEEE, ISBN 978-1-4244-8679-3, Kanyakumari, India.","DOI":"10.1109\/ICECTECH.2011.5942057"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_003_w2aab3b7d274b1b6b1ab2ab3Aa","unstructured":"A. Abraham, R. Buyya and B. Nath, Nature\u2019s heuristics for scheduling jobs on computational grids, in: The 8th IEEE International Conference on Advanced Computing and Communications (ADCOM 2000) (pp. 45\u201352)."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_004_w2aab3b7d274b1b6b1ab2ab4Aa","unstructured":"J. N. Apar\u00edcio, L. Correia and F. Moura-Pires, Expressing population based optimization heuristics using PLATO, pp. 367\u2013383, EPIA 1999 (1999)."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_005_w2aab3b7d274b1b6b1ab2ab5Aa","unstructured":"J. N. Apar\u00edcio, L. Correia and F. Moura-Pires, Populations are multisets-PLATO, pp. 1845\u20131850. GECCO 1999 (1999)."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_006_w2aab3b7d274b1b6b1ab2ab6Aa","unstructured":"S. Binitha and S. S. Sathya, A survey of bio inspired optimization algorithms, Int. J. Soft Comput. Eng.2 (2012), 137\u2013151."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_007_w2aab3b7d274b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"W. Blizard, Multiset theory, Notre Dame J. Formal Logic30 (1989), 36\u201366.","DOI":"10.1305\/ndjfl\/1093634995"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_008_w2aab3b7d274b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"P. Campegiani, A genetic algorithm to solve the virtual machines resources allocation problem in multi-tier distributed systems, in: Second International Workshop on Virtualization Performance: Analysis, Characterization, and Tools (VPACT 2009), Boston, Massachusetts, 2009.","DOI":"10.1109\/ICAS.2009.49"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_009_w2aab3b7d274b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"J. Carretero and F. Xhafa, Using genetic algorithms for scheduling jobs in large scale grid applications, J. Technol. Econ. Dev.12 (2006), 11\u201317.","DOI":"10.3846\/13928619.2006.9637716"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_010_w2aab3b7d274b1b6b1ab2ac10Aa","unstructured":"J. Carretero, F. Xhafa and A. Abraham, Genetic algorithm based schedulers for grid computing systems, Int. J. Innovative Comput., Inf. Control3 (2007), 1\u201319."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_011_w2aab3b7d274b1b6b1ab2ac11Aa","unstructured":"H. M. Cartwright, Getting the timing right \u2013 the use of genetic algorithms in scheduling, in: Proc. of Adaptive Computing and Information Processing Conference, pp. 393\u2013411 (UNISYS 1994), Brunel, London."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_012_w2aab3b7d274b1b6b1ab2ac12Aa","unstructured":"L. Davis, Job shop scheduling with genetic algorithms, in: Proceedings of an International Conference on Genetic Algorithms and their Applications, (Vol. 140). Carnegie-Mellon University Pittsburgh, PA, 1985."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_013_w2aab3b7d274b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"E. W. Davis and G. E. Heidorn, An algorithm for optimal project scheduling under multiple resource constraints, Manag. Sci.17 (1971), 803\u2013817.","DOI":"10.1287\/mnsc.17.12.B803"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_014_w2aab3b7d274b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"E. W. Davis and J. H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Manag. Sci.21 (1975), 944\u2013955.","DOI":"10.1287\/mnsc.21.8.944"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_015_w2aab3b7d274b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"V. Di Martino and M. Mililotti, Sub optimal scheduling in a grid using genetic algorithms, Parallel Comput.30 (2004), 553\u2013565.","DOI":"10.1016\/j.parco.2003.12.004"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_016_w2aab3b7d274b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"E. A. Ezugwu, D. I. Yakmut, A. P. Ochang, M. S. Buhari, E. M. Frincu and B. S. Junaidu. Multiset genetic algorithm approach to grid resource allocation, in: Innovations in Bio-Inspired Computing and Applications, pp. 1\u201313, Springer International Publishing, 2016.","DOI":"10.1007\/978-3-319-28031-8_1"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_017_w2aab3b7d274b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"M. Gandomkar, M. Vakilian and M. Ehsan, A combination of genetic algorithm and simulated annealing for optimal DG allocation in distribution networks, CCECE\/CCGEI, Saskatoon (2005), 645\u2013648.","DOI":"10.1109\/CCECE.2005.1557013"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_018_w2aab3b7d274b1b6b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"Y. Gao, H. Rong and J. Z. Huang, Adaptive grid job scheduling with genetic algorithms, Future Gener. Comput. Syst.21 (2005), 151\u2013161.","DOI":"10.1016\/j.future.2004.09.033"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_019_w2aab3b7d274b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"F. Glover, P. K. James and L. Manuel, Genetic algorithms and tabu search: hybrids for optimization, Comput. Oper. Res.22 (1995), 111\u2013134.","DOI":"10.1016\/0305-0548(93)E0023-M"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_020_w2aab3b7d274b1b6b1ab2ac20Aa","unstructured":"D. E. Golberg, Genetic algorithms in search, optimization, and machine learning, Addion Wesley, 1989."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_021_w2aab3b7d274b1b6b1ab2ac21Aa","doi-asserted-by":"crossref","unstructured":"A. M. Ibrahim, A. E. S. Ezugwu and A. Abdulsalami, Computational model for cardinality bounded multiset space, Int. J. Appl. Math. Res.1 (2012), 330\u2013341.","DOI":"10.14419\/ijamr.v1i3.146"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_022_w2aab3b7d274b1b6b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"W. Jakob, A. S. W. Quinte, K.-U. Stucky, Optimised scheduling of grid resources using hybrid evolutionary algorithms, in: Conf. Proc. PPAM 2005, R. Wyrzykowski, ed., LNCS 3911, pp. 406\u2013413, Springer, Berlin, 2006.","DOI":"10.1007\/11752578_49"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_023_w2aab3b7d274b1b6b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"S. Kardani-Moghaddam, F. Khodadadi, R. Entezari-Maleki and A. Movaghar, A hybrid genetic algorithm and variable neighborhood search for task scheduling problem in grid environment, Procedia Eng.29 (2012), 3808\u20133814.","DOI":"10.1016\/j.proeng.2012.01.575"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_024_w2aab3b7d274b1b6b1ab2ac24Aa","unstructured":"P. Latchoumy and P. S. A. Khader, Fault tolerant job scheduler with efficient job execution in grid computing, UACEE International Journal of Computer Science and its Applications2, 233\u2013237."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_025_w2aab3b7d274b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"S. W. Mahfoud and D. E. Goldberg, Parallel recombinative simulated annealing: a genetic algorithm, Parallel Comput.21 (1995), 1\u201328.","DOI":"10.1016\/0167-8191(94)00071-H"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_026_w2aab3b7d274b1b6b1ab2ac26Aa","unstructured":"A. Manso and L. Correia, Genetic algorithms using populations based on multisets, New Trends in Artificial Intelligence, EPIA (2009), 53\u201364."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_027_w2aab3b7d274b1b6b1ab2ac27Aa","unstructured":"Z. Michalewicz, Genetic algorithms+ data structures=evolution programs, Springer Science & Business Media, 2013."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_028_w2aab3b7d274b1b6b1ab2ac28Aa","doi-asserted-by":"crossref","unstructured":"V. K. Naik, C. Liu, L. Yang and J. Wagner, Online resource matching for heterogeneous grid environments, in: Cluster Computing and the Grid, CCGrid 2005. IEEE International Symposium, 2, pp. 607\u2013614, 2005.","DOI":"10.1109\/CCGRID.2005.1558620"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_029_w2aab3b7d274b1b6b1ab2ac29Aa","unstructured":"K. Nammuni, J. Levine and J. Kingston, Skill-based resource allocation using genetic algorithms and ontologies, 2002."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_030_w2aab3b7d274b1b6b1ab2ac30Aa","unstructured":"N. K. Naseri and J. Amin, A hybrid genetic algorithm-gravitational attraction search algorithm (HYGAGA) to solve grid task scheduling problem, International Conference on Soft Computing and Its Applications (ICSCA\u20192012), 2012."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_031_w2aab3b7d274b1b6b1ab2ac31Aa","unstructured":"N. K. Naseri, A. Jula and A. Safaei, Static Grid Task Scheduling problem using a hybrid Genetic Algorithm-Gravitational Attraction Search algorithm (GAGAS). Science Series Data Report, 4, 2012."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_032_w2aab3b7d274b1b6b1ab2ac32Aa","unstructured":"D. Pham and D. Karaboga, Intelligent optimisation techniques: genetic algorithms, tabu search, simulated annealing and neural networks, Springer Science & Business Media, 2012."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_033_w2aab3b7d274b1b6b1ab2ac33Aa","doi-asserted-by":"crossref","unstructured":"S. B. Priya, M. Prakash and K. K. Dhawan, Fault tolerance-genetic algorithm for grid task scheduling using check point, in: Grid and Cooperative Computing. GCC 2007. Sixth International Conference. IEEE, pp. 676\u2013680, 2007.","DOI":"10.1109\/GCC.2007.67"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_034_w2aab3b7d274b1b6b1ab2ac34Aa","unstructured":"J. M. Renders and H. Bersini, Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways, Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence, Proceedings of the First IEEE Conference on. IEEE, 1994."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_035_w2aab3b7d274b1b6b1ab2ac35Aa","unstructured":"D. Singh, A. Ibrahim, T. Yohanna and J. Singh, An overview of the applications of multisets, Novi Sad J. Math. 37 (2007), 73\u201392."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_036_w2aab3b7d274b1b6b1ab2ac36Aa","doi-asserted-by":"crossref","unstructured":"S. Wagner and M. Affenzeller, The allele meta-model \u2013 developing a common language for genetic algorithms. Artificial intelligence and knowledge engineering applications: a bioinspired approach, Lecture Notes in Computer Science3562 (2005), 202\u2013211.","DOI":"10.1007\/11499305_21"},{"key":"2025120523280707576_j_jisys-2015-0089_ref_037_w2aab3b7d274b1b6b1ab2ac37Aa","unstructured":"T. Wieder, Generation of all possible multiselections from a multiset, Prog. Appl. Math.2 (2011), 61\u201366."},{"key":"2025120523280707576_j_jisys-2015-0089_ref_038_w2aab3b7d274b1b6b1ab2ac38Aa","doi-asserted-by":"crossref","unstructured":"L. Zhang, Y. Chen, R. Sun, S. Jing and B. Yang, A task scheduling algorithm based on PSO for grid computing, Int. J. Comput. Intell. Res.4 (2008), 37\u201343.","DOI":"10.5019\/j.ijcir.2008.123"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/26\/1\/article-p169.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0089\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0089\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:28:37Z","timestamp":1764977317000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0089\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,10]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,11,20]]},"published-print":{"date-parts":[[2017,1,1]]}},"alternative-id":["10.1515\/jisys-2015-0089"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2015-0089","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2016,2,10]]}}}