{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:44Z","timestamp":1761611324318,"version":"build-2065373602"},"reference-count":69,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T00:00:00Z","timestamp":1366588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper is motivated by, but not limited to, the task of scheduling jobs organized in workflows to a computational grid. Due to the dynamic nature of grid computing, more or less permanent replanning is required so that only very limited time is available to come up with a revised plan. To meet the requirements of both users and resource owners, a multi-objective optimization comprising execution time and costs is needed. This paper summarizes our work over the last six years in this field, and reports new results obtained by the combination of heuristics and evolutionary search in an adaptive Memetic Algorithm. We will show how different heuristics contribute to solving varying replanning scenarios and investigate the question of the maximum manageable work load for a grid of growing size starting with a load of 200 jobs and 20 resources up to 7000 jobs and 700 resources. Furthermore, the effect of four different local searchers incorporated into the evolutionary search is studied. We will also report briefly on approaches that failed within the short time frame given for planning.<\/jats:p>","DOI":"10.3390\/a6020245","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T14:02:19Z","timestamp":1366639339000},"page":"245-277","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria  Memetic Computing"],"prefix":"10.3390","volume":"6","author":[{"given":"Wilfried","family":"Jakob","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI),  P.O. Box 3640, Karlsruhe 76021, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvia","family":"Strack","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI),  P.O. Box 3640, Karlsruhe 76021, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Quinte","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI),  P.O. Box 3640, Karlsruhe 76021, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther","family":"Bengel","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Applied Sciences Mannheim, Paul-Wittsack-Str. 10, Mannheim 68163, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl-Uwe","family":"Stucky","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI),  P.O. Box 3640, Karlsruhe 76021, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2785-7736","authenticated-orcid":false,"given":"Wolfgang","family":"S\u00fc\u00df","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI),  P.O. Box 3640, Karlsruhe 76021, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2013,4,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1177\/109434200101500302","article-title":"The anatomy of the grid: Enabling scalable virtual organisations","volume":"15","author":"Foster","year":"2001","journal-title":"Int. J. High Perform. C"},{"key":"ref_2","unstructured":"Wyrzykowski, R., Dongarra, J., Meyer, N., and Wa\u015bniewski, J. (2005, January 11\u201314). Optimised Scheduling of Grid Resources Using Hybrid Evolutionary Algorithms. Proceeding of Parallel Processing and Applied Mathematics (PPAM 2005), LNCS 3911, Pozna\u0144, Poland."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Meersman, R., and Tari, Z. (November, January 29). Solving Scheduling Problems in Grid Resource Management Using an Evolutionary Algorithm. Proceeding of on the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE, Part II, LNCS 4276, Montpellier, France.","DOI":"10.1007\/11914952"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","article-title":"Algorithms for solving production scheduling problems","volume":"8","author":"Giffler","year":"1960","journal-title":"Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Glover, F., and Laguna, M. (1997). Tabu Search, Kluwer Academic Publisher.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Brucker, P. (2004). Scheduling Algorithms, Springer.","DOI":"10.1007\/978-3-540-24804-0"},{"key":"ref_7","unstructured":"Brucker, P., and Knust, S. (2006). Complex Scheduling, Springer."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1016\/j.cor.2005.02.006","article-title":"Best compromise solution for a new multiobjective scheduling problem","volume":"33","author":"Miettinen","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Talia, D., Yahyapour, R., and Ziegler, W. (2008). Grid Middleware and Services\u2014Challenges and Solutions, Springer.","DOI":"10.1007\/978-0-387-78446-5"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Dutot, P.F., Eyraud, L., Mouni\u00e9, G., and Trystram, D. (2004, January 27\u201330). Bi-Criteria Algorithm for Scheduling Jobs on Cluster Platforms. Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA\u201904), Barcelona, Spain.","DOI":"10.1145\/1007912.1007932"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Gorlatch, S., and Danelutto, M. (2007). Integrated Research in GRID Computing (CoreGRID Integration Workshop 2005, Selected Papers), CoreGRID Series, Springer.","DOI":"10.1007\/978-0-387-47658-2"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Yu, J., and Buyya, R. (2006, January 19\u201323). A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms. Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC 2006), Workshop on Workflows in Support of Large-Scale Science, Paris, France.","DOI":"10.1109\/WORKS.2006.5282330"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.12921\/cmst.2006.12.02.123-138","article-title":"Scheduling jobs on the grid\u2014Multicriteria approach","volume":"12","author":"Kurowski","year":"2006","journal-title":"Comput. Methods Sci. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10951-008-0058-8","article-title":"A multicriteria approach to tow-level hierarchy scheduling in grids","volume":"11","author":"Kurowski","year":"2008","journal-title":"J. Sched."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10951-010-0169-x","article-title":"On-Line hierarchical job scheduling on grids with admissible allocation","volume":"13","author":"Tchernykh","year":"2010","journal-title":"J. Sched."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10951-009-0142-8","article-title":"Multicriteria, multi-user scheduling in grids with advanced reservation","volume":"13","author":"Kurowski","year":"2010","journal-title":"J. Sched."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10951-009-0158-0","article-title":"Modelling and solving grid allocation problem with network resources for workflow applications","volume":"14","author":"Mika","year":"2011","journal-title":"J. Sched."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Xhafa, F., and Abraham, A. (2008). Metaheuristics for Scheduling in Distributed Computing Environments, Springer.","DOI":"10.1007\/978-3-540-69277-5"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Rudolph, G., Jansen, T., Lucas, S., Poloni, C., and Beume, N. (2008, January 13\u201317). Fast Multi-Objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm. Proceeding of Parallel Problem Solving from Nature (PPSN X), LNCS 5199, Dortmund, Germany.","DOI":"10.1007\/978-3-540-87700-4"},{"key":"ref_21","first-page":"257","article-title":"Cellular memetic algorithms","volume":"5","author":"Alba","year":"2005","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_22","unstructured":"Gorges-Schleuter, M. (1990). Genetic Algorithms and Population Structures\u2014A Massively Parallel Algorithm. [Ph.D. Thesis, Department of Computer Science, University of Dortmund]."},{"key":"ref_23","unstructured":"M\u00e4nner, R., and Manderick, B. (1992, January 28\u201330). Application of Genetic Algorithms to Task Planning and Learning. Proceeding of Parallel Problem Solving from Nature (PPSN II), Brussels, Belgium."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12293-010-0040-9","article-title":"A general cost-benefit-based adaptation framework for multimeme algorithms","volume":"3","author":"Jakob","year":"2010","journal-title":"Memet. Comput."},{"key":"ref_25","unstructured":"Callaos, N., Esquivel, S., and Burge, J. (2001, January 22\u201325). HyGLEAM: Hybrid GeneraL-Purpose Evolutionary Algorithm and Method. Proceedings of World Multiconf on Systematics, Cybernetics and Informatics (SCI\u2019 2001), Volume III, Orlando, FL, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P. (1996, January 22\u201326). An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms. Proceeding of Parallel Problem Solving from Nature (PPSN IV), LNCS 1141, Berlin, Germany.","DOI":"10.1007\/3-540-61723-X"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/evco.2009.17.2.231","article-title":"Adaptive cellular memetic algorithms","volume":"17","author":"Nguyen","year":"2009","journal-title":"Evol. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Xhafa, F., and Abraham, A. (2008). Metaheuristics for Scheduling in Distributed Computing Environments, Springer.","DOI":"10.1007\/978-3-540-69277-5"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2003). Introduction to Evolutionary Computation, Natural Computing Series; Springer.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"De Jong, K.A. (2006). Evolutionary Computation\u2014A Unified Approach, MIT Press.","DOI":"10.1145\/1274000.1274109"},{"key":"ref_31","unstructured":"Blume, C., and Jakob, W. (2009). GLEAM\u2014General Learning Evolutionary Algorithm and Method: Ein Evolution\u00e4rer Algorithmus und Seine Anwendungen, KIT Scientific Publishing."},{"key":"ref_32","unstructured":"Jain, L.C. (1997, January 21\u201323). Automatic Generation of Collision Free Moves for the ABB Industrial Robot Control. Proceedings of Knowledge-Based Intelligent Electronic Systems (KES\u201997), Part II, Adelaide, Australia."},{"key":"ref_33","unstructured":"Blume, C. (2000, January 10\u201312). Optimization in Concrete Precasting Plants by Evolutionary Computation. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), Volume LBP, Las Vegas, NV, USA."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., B\u00e4ck, T., Schoenauer, M., and Schwefel, H.-P. (1998, January 27\u201330). A Comparative Study of Global and Local Selection in Evolution Strategies. Proceeding of Parallel Problem Solving from Nature (PPSN V), LNCS 1498, Amsterdam, The Netherlands.","DOI":"10.1007\/BFb0056843"},{"key":"ref_35","unstructured":"Schwefel, H.-P., and M\u00e4nner, R. (1990, January 1\u20133). Explicit Parallelism of Genetic Algorithms through Population Structures. Proceeding of Parallel Problem Solving from Nature (PPSN I), LNCS 496, Dortmund, Germany."},{"key":"ref_36","unstructured":"Wyrzykowski, R., Dongarra, J., Karczewski, K., and Wa\u015bniewski, J. (2007, January 9\u201312). Tackling the Grid Job Planning and Resource Allocation Problem Using a Hybrid Evolutionary Algorithm. Proceeding of Parallel Processing and Applied Mathematics (PPAM 2007), LNCS 4967, Gdansk, Poland."},{"key":"ref_37","unstructured":"Davis, L. (1991). Handbook of Genetic Algorithms, V. Nostrand Reinhold."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P. (1996, January 22\u201326). On Permutation Representations for Scheduling Problems. Proceeding of Parallel Problem Solving from Nature (PPSN IV), LNCS 1141, Berlin, Germany.","DOI":"10.1007\/3-540-61723-X"},{"key":"ref_39","unstructured":"Moscato, P. (1989). On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts\u2014Towards Memetic Algorithms, California Institute of Technology."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Deb, K. (2004, January 26\u201330). Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), LNCS 3102, Part 1 and Volume LBP, Seattle, WA, USA.","DOI":"10.1007\/b98645"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","article-title":"Meta-Lamarckian learning in memetic algorithms","volume":"8","author":"Ong","year":"2004","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Hart, W.E., Krasnogor, N., and Smith, J.E. (2005). Recent Advances in Memetic Algorithms, Springer.","DOI":"10.1007\/3-540-32363-5"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","article-title":"A Multi-Facet Survey on Memetic Computation","volume":"5","author":"Chen","year":"2011","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","article-title":"A tutorial for competent Memetic Algorithms: Model, taxonomy, and design issues","volume":"5","author":"Krasnogor","year":"2005","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Nguyen, Q.H., Ong, Y.-S., and Krasnogor, N. (2007, January 25\u201328). A Study on Design Issues of Memetic Algorithm. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), Singapore.","DOI":"10.1109\/CEC.2007.4424770"},{"key":"ref_46","unstructured":"Forrest, S. (1993, January 17\u201321). Shall We Repair? Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA), Urbana-Champaign, IL, USA."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Davidor, Y., Schwefel, H.-P., and M\u00e4nner, R. (1994, January 9\u201314). Lamarckian Evolution, the Baldwin Effect and Function Optimization. Proceedings of Parallel Problem Solving from Nature (PPSN III), LNCS 866, Jerusalem, Israel.","DOI":"10.1007\/3-540-58484-6"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Merelo Guerv\u00f3s, J.J., Adamidis, P., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., and Schwefel, H.-P. (2002, January 7\u201322). HyGLEAM\u2014An Approach to Generally Applicable Hybridization of Evolutionary Algorithms. Proceedings of Parallel Problem Solving from Nature (PPSN VII), LNCS 2439, Granada, Spain.","DOI":"10.1007\/3-540-45712-7"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","article-title":"Memetic algorithms for solving job-shop scheduling problems","volume":"1","author":"Hasan","year":"2009","journal-title":"Memet. Comput."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Zhang, G. (2010, January 23\u201324). Investigating Memetic Algorithm for Solving the Job Shop Scheduling Problems. Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence (AICI \u201910), Sanya, China.","DOI":"10.1109\/AICI.2010.210"},{"key":"ref_51","unstructured":"Hart, W.E. (1994). Adaptive Global Optimization with Local Search. [Ph.D. Thesis, University of California]."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Merelo Guerv\u00f3s, J.J., Adamidis, P., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., and Schwefel, H.-P. (2002, January 7\u201322). Multimeme Algorithms for Protein Structure Prediction. Proceedings of Parallel Problem Solving from Nature (PPSN VII), LNCS 2439, Granada, Spain.","DOI":"10.1007\/3-540-45712-7"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/TSMCC.2012.2188832","article-title":"A conceptual modeling of meme complexes in stochastic search","volume":"5","author":"Chen","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"ref_54","unstructured":"Wyrzykowski, R., Dongarra, J., Meyer, N., and Wa\u015bniewski, J. (2005, January 11\u201314). Comparison of Workflow Scheduling Strategies on the Grid. Proceeding of Parallel Processing and Applied Mathematics (PPAM 2005), LNCS 3911, Pozna\u0144, Poland."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/jos.116","article-title":"A standard task graph set for fair evaluation of multiprocessor scheduling algorithms","volume":"5","author":"Tobita","year":"2002","journal-title":"J. Sched."},{"key":"ref_56","unstructured":"Gonzales, T. (2004, January 9\u201311). A comprehensive Test Bench for the Evaluation of Scheduling Heuristics. Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS\u201904), MIT Cambridge, MIT Cambridge, MA, USA."},{"key":"ref_57","unstructured":"S\u00fc\u00df, W., Quinte, A., Jakob, W., and Stucky, K.-U. (2007, January 22\u201325). Construction of Benchmarks for Comparison of Grid Resource Planning Algorithms. Proceedings of the Second International Conference on Software and Data Technologies (ICSOFT 2007), Volume PL, Barcelona, Spain."},{"key":"ref_58","unstructured":"Arabnia, H.R., Hashemi, T.R., and Solo, A.M.G. (2012, January 16\u201319). New Parameters for the Evaluation of Benchmarks for Fast Evolutionary Scheduling of Workflows with Tight Time and Cost Restrictions. Proceedings of the International Conference on Genetic and Evolutionary Methods (GEM\u201912), Las Vegas, NV, USA."},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Wyrzykowski, R., Dongarra, J., Karczewski, K., and Wa\u015bniewski, J. (2009, January 13\u201316). Fast Multi-Objective Rescheduling of Grid Jobs by Heuristics and Evolution. Proceedings of Parallel Processing and Applied Mathematics (PPAM 2009), LNCS 6068, Wroclaw, Poland.","DOI":"10.1007\/978-3-642-14403-5"},{"key":"ref_60","first-page":"173","article-title":"Fast multi-objective rescheduling of workflows using heuristics and memetic evolution","volume":"2","author":"Jakob","year":"2010","journal-title":"Scalable Comput. Pract. Exp."},{"key":"ref_61","unstructured":"Neumann, K., and Morlock, M. (2002). Operations Research, Carl Hanser."},{"key":"ref_62","unstructured":"Schuster, C. (2003). No-Wait Job-Shop Scheduling: Komplexit\u00e4t und Local Search. [Ph.D. Thesis, University Duisburg-Essen]."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Manage Sci."},{"key":"ref_64","first-page":"244","article-title":"The shifting bottleneck procedure for job-shops with parallel machines","volume":"1","author":"Chen","year":"2006","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"ref_65","unstructured":"Pardalos, P.M., and Resende, M.G.C. (2001). Handbook of Applied Optimization, Oxford University Press."},{"key":"ref_66","unstructured":"Maykaso\u011flu, A., \u00d6zbakir, L., and Dereli, T. (2002, January 9\u201311). Multiple Dispatching Rule Based Heuristic for Multi-Objective Scheduling of Job Shops using Tabu Search. Proceedings of the 5th International Conference on Managing Innovations in Manufacturing (MIM 2002), Milwaukee, WI, USA."},{"key":"ref_67","unstructured":"Cordeiro, J., Virvou, M., and Shishkov, B. (2010, January 22\u201324). An Assessment of Heuristics for Fast Scheduling of Grid Jobs. Proceedings of the Fifth International Conference on Software and Data Technologies (ICSOFT 2010), Volume 1, Athens, Greece."},{"key":"ref_68","unstructured":"Hahnenkamp, B. (2007). Integration Anwendungsneutraler Lokaler Suchverfahren in den Adaptiven Memetischen Algorithmus HyGLEAM f\u00fcr Komplexe Reihenfolgeoptimierung. [Ph.D. Thesis, AIFB, University of Karlsruhe]."},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Feng, L., Ong, Y.-S., Tsang, I.W.-H., and Tan, A.-H. (2012, January 10\u201315). An Evolutionary Search Paradigm that Learns with Past Experiences. Proceeding of the 2012 IEEE Congress on Evolutionary Computation (CEC), Brisbane, Australia.","DOI":"10.1109\/CEC.2012.6252893"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/6\/2\/245\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:46:18Z","timestamp":1760219178000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/6\/2\/245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,22]]},"references-count":69,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,6]]}},"alternative-id":["a6020245"],"URL":"https:\/\/doi.org\/10.3390\/a6020245","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2013,4,22]]}}}