×

Metaheuristics “In the large”. (English) Zbl 1487.90651

Summary: Following decades of sustained improvement, metaheuristics are one of the great success stories of optimization research. However, in order for research in metaheuristics to avoid fragmentation and a lack of reproducibility, there is a pressing need for stronger scientific and computational infrastructure to support the development, analysis and comparison of new approaches. To this end, we present the vision and progress of the Metaheuristics “In the Large” project. The conceptual underpinnings of the project are: truly extensible algorithm templates that support reuse without modification, white box problem descriptions that provide generic support for the injection of domain specific knowledge, and remotely accessible frameworks, components and problems that will enhance reproducibility and accelerate the field’s progress. We argue that, via such principled choice of infrastructure support, the field can pursue a higher level of scientific enquiry. We describe our vision and report on progress, showing how the adoption of common protocols for all metaheuristics can help liberate the potential of the field, easing the exploration of the design space of metaheuristics.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming

References:

[1] Addis, B.; Carello, G.; Ceselli, A., Combining very large scale and ILP based neighborhoods for a two-level location problem, European Journal of Operational Research, 231, 3, 535-546 (2013) · Zbl 1317.90161
[2] Adriaensen, S.; Brys, T.; Nowé, A., Fair-share ILS: A Simple State-of-the-art Iterated Local Search Hyperheuristic, Proceedings of the 2014 annual conference on genetic and evolutionary computation. Proceedings of the 2014 annual conference on genetic and evolutionary computation, GECCO ’14, 1303-1310 (2014), ACM: ACM New York, NY, USA
[3] Agarwal, A.; Colak, S.; Eryarsoy, E., Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach, European Journal of Operational Research, 169, 3, 801-815 (2006) · Zbl 1079.90044
[4] Ahmed, L.; Mumford, C.; Kheiri, A., Solving urban transit route design problem using selection hyper-heuristics, European Journal of Operational Research, 274, 2, 545-559 (2019) · Zbl 1404.90025
[5] Altunay, M.; Avery, P.; Blackburn, K.; Bockelman, B.; Ernst, M.; Fraser, D.; Open Sci Grid Executive Board, A Science Driven Production Cyberinfrastructure-the Open Science Grid, Journal of GRID Computing, 9, 2, Sp. Iss. SI, 201-218 (2011)
[6] Applegate, D. L.; Bixby, R. E.; Chvatal, V.; Cook, W. J., The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) (2007), Princeton University Press: Princeton University Press USA
[7] Asta, S.; Özcan, E., A tensor-based selection hyper-heuristic for cross-domain heuristic search, Information Sciences, 299, 412-432 (2015)
[8] Asta, S.; Özcan, E.; Curtois, T., A tensor based hyper-heuristic for nurse rostering, Knowledge-Based Systems, 98, 185-199 (2016)
[9] Bartz-Beielstein, T.; Doerr, C.; Bossek, J.; Chandrasekaran, S.; Eftimov, T.; Fischbach, A.; Weise, T., Benchmarking in optimization: Best practice and open issues, arXiv preprint arXiv:2007.03488 (2020)
[10] Battiti, R.; Tecchiolli, G., The reactive tabu search, Journal on Computing, 6, 2, 126-140 (1994) · Zbl 0807.90094
[11] Bengio, Y.; Lodi, A.; Prouvost, A., Machine learning for combinatorial optimization: A methodological tour d’horizon, European Journal of Operational Research (2020) · Zbl 1487.90541
[12] Birattari, M.; Stützle, T.; Paquete, L.; Varrentrapp, K., A racing algorithm for configuring metaheuristics, Proceedings of the genetic and evolutionary computation conference. Proceedings of the genetic and evolutionary computation conference, GECCO ’02, 11-18 (2002), Morgan Kaufmann Publishers Inc.: Morgan Kaufmann Publishers Inc. San Francisco, CA, USA
[13] Bleuler, S.; Laumanns, M.; Thiele, L.; Zitzler, E., PISA—A Platform and Programming Language Independent Interface for Search Algorithms, (Fonseca, C. M.; etal., Conference on evolutionary multi-criterion optimization (EMO 2003). Conference on evolutionary multi-criterion optimization (EMO 2003), LNCS, 2632 (2003), Springer: Springer Berlin), 494-508 · Zbl 1037.68743
[14] Boussemart, F.; Lecoutre, C.; Piette, C., XCSP3: an integrated format for benchmarking combinatorial constrained problems, CoRR, abs/1611.03398 (2016)
[15] Burke, E. K.; Gendreau, M.; Hyde, M.; Kendall, G.; Ochoa, G.; Özcan, E.; Qu, R., Hyper-heuristics: a survey of the state of the art, Journal of the Operational Research Society, 64, 12, 1695-1724 (2013)
[16] Burke, E. K.; McCollum, B.; Meisels, A.; Petrovic, S.; Qu, R., A graph-based hyper-heuristic for educational timetabling problems, European Journal of Operational Research, 176, 1, 177-192 (2007) · Zbl 1137.90602
[17] Cahon, S.; Melab, N.; Talbi, E.-G., ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics, Journal of Heuristics, 10, 3, 357-380 (2004)
[18] Camacho-Villalón, C. L.; Dorigo, M.; Stützle, T., The intelligent water drops algorithm: why it cannot be considered a novel algorithm - A brief discussion on the use of metaphors in optimization, Swarm Intelligence, 13, 3-4, 173-192 (2019)
[19] Chakhlevitch, K.; Cowling, P., Hyperheuristics: Recent developments, (Cotta, C.; Sevaux, M.; Sörensen, K. (2008), Springer: Springer Berlin Heidelberg), 3-29)
[20] Cloete, T.; Engelbrecht, A. P.; Pamparà, G., Cilib: A collaborative framework for computational intelligence algorithms - part II, Proceedings of the international joint conference on neural networks, IJCNN 2008, part of the IEEE world congress on computational intelligence, WCCI 2008, Hong Kong, China, june 1-6, 2008, 1764-1773 (2008), IEEE
[21] Collberg, C.; Proebsting, T.; Warren, A. M., Repeatability and benefaction in computer systems research, Technical Report (2015), University of Arizona
[22] Consoli, P.; Minku, L. L.; Yao, X., Dynamic selection of evolutionary algorithm operators based on online learning and fitness landscape metrics, 10th international conference on simulated evolution and learning, volume 8886 of LNCS (2014), Springer
[23] Cowling, P.; Kendall, G.; Soubeiga, E., A hyperheuristic approach to scheduling a sales summit, (Burke, E.; Erben, W., Practice and theory of automated timetabling iii. Practice and theory of automated timetabling iii, Lecture Notes in Computer Science, 2079 (2001), Springer: Springer Berlin Heidelberg), 176-190 · Zbl 0982.68516
[24] Cox, S. J.; Fairman, M. J.; Xue, G.; Wason, J. L.; Keane, A. J., The grid: Computational and data resource sharing in engineering optimisation and design search, 30th international workshops on parallel processing (icpp 2001 workshops), 3-7 september 2001, valencia, spain, 207-212 (2001), IEEE Computer Society
[25] Dantzig, G. B., A history of scientific computing, 141-151 (1990), ACM: ACM New York, NY, USA
[26] Spe.2459
[27] de Armas, J.; Lalla-Ruiz, E.; Tilahun, S. L.; Voß, S., Similarity in metaheuristics: a gentle step towards a comparison methodology, Natural Computing (2021)
[28] Di Gaspero, L.; Schaerf, A., Easylocal++: an object-oriented framework for the flexible design of local-search algorithms, Software: Practice and Experience, 33, 8, 733-765 (2003)
[29] Drake, J. H.; Kheiri, A.; Özcan, E.; Burke, E. K., Recent advances in selection hyper-heuristics, European Journal of Operational Research, 285, 2, 405-428 (2020) · Zbl 1441.90183
[30] Durillo, J. J.; Nebro, A. J., jMetal: A Java framework for multi-objective optimization, Advances in Engineering Software, 42, 10 (2011)
[31] Foster, I., Globus Toolkit version 4: Software for service-oriented systems, (Jin, H. and Reed, D. and Jiang, W., Network and Parallel Computing Proceedings. Network and Parallel Computing Proceedings, Lecture Notes in Computer Science, 3779 (2005)), 2-13
[32] Foster, I., Service-oriented science, Science, 308, 5723, 814-817 (2005)
[33] Fuellerer, G.; Doerner, K. F.; Hartl, R. F.; Iori, M., Metaheuristics for vehicle routing problems with three-dimensional loading constraints, European Journal of Operational Research, 201, 3, 751-759 (2010) · Zbl 1173.90511
[34] 1510-1510
[35] García-Sánchez, P.; González, J.; Castillo, P. A.; Arenas, M. G.; Guervós, J. J.M., Service oriented evolutionary algorithms, Soft Comput., 17, 6, 1059-1075 (2013)
[36] Glover, F.; Laguna, M., Tabu Search (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell, MA, USA · Zbl 0930.90083
[37] Goh, S. L.; Kendall, G.; Sabar, N. R., Improved local search approaches to solve the post enrolment course timetabling problem, European Journal of Operational Research, 261, 1, 17-29 (2017) · Zbl 1403.90329
[38] Guervós, J. J.M.; Valdez, M. G.; Galeano, S. R., Implementation matters, also in concurrent evolutionary algorithms, (Coello, C. A.C., GECCO ’20: Genetic and evolutionary computation conference, companion volume, cancún, mexico, july 8-12, 2020 (2020), ACM), 1591-1598
[39] Hackney, R.; Xu, H.; Ranchhod, A., Evaluating web services: Towards a framework for emergent contexts, European Journal of Operational Research, 173, 3, 1161-1174 (2006) · Zbl 1120.90309
[40] Hammond, K.; Michaelson, G., Research Directions in Parallel Functional Programming (1999), Springer · Zbl 0940.68022
[41] Hansen, P.; Mladenović, N., Variable neighborhood search: Principles and applications, European Journal of Operational Research, 130, 3, 449-467 (2001) · Zbl 0981.90063
[42] Hooker, J., Testing heuristics: We have it all wrong, Journal of Heuristics, 1, 1, 33-42 (1995) · Zbl 0853.68155
[43] Hoos, H.; Stützle, T., Stochastic Local Search: Foundations & Applications (2005), Morgan Kaufmann · Zbl 1126.68032
[44] Hughes, J., Why functional programming matters, The Computer Journal, 32, 2, 98-107 (1989)
[45] Hunt, A.; Thomas, D., The art in computer programming, The Pragmatic Programmers, LLC (2001)
[46] Imade, H.; Morishita, R.; Ono, I.; Ono, N.; Okamoto, M., A grid-oriented genetic algorithm framework for bioinformatics, New Gen. Comput., 22, 2, 177-186 (2004) · Zbl 1084.68505
[47] Johnson, D. S., A theoretician’s guide to the experimental analysis of algorithms, Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges, 59, 215-250 (2002) · Zbl 1103.68997
[48] Kendall, G.; Bai, R.; Błazewicz, J.; De Causmaecker, P.; Gendreau, M.; John, R.; Qu, R., Good laboratory practice for optimization research, Journal of the Operational Research Society, 67, 4, 676-689 (2016)
[49] Khalloof, H.; Jakob, W.; Liu, J.; Braun, E.; Shahoud, S.; Duepmeier, C.; Hagenmeyer, V., A generic distributed microservices and container based framework for metaheuristic optimization, Proceedings of the genetic and evolutionary computation conference companion, 1363-1370 (2018), ACM
[50] Kheiri, A., Heuristic sequence selection for inventory routing problem, Transportation Science, 54, 2, 302-312 (2020)
[51] Kheiri, A.; Özcan, E., An iterated multi-stage selection hyper-heuristic, European Journal of Operational Research, 250, 1, 77-90 (2016) · Zbl 1346.90705
[52] Khichane, M.; Albert, P.; Solnon, C., Integration of ACO in a constraint programming language, Ant Colony Optimization and Swarm Intelligence, 84-95 (2008)
[53] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 4598, 671-680 (1983) · Zbl 1225.90162
[54] Kocsis, Z. A.; Brownlee, A. E.I.; Swan, J.; Senington, R., Haiku - a Scala combinator toolkit for semi-automated composition of metaheuristics, (Barros, M.; Labiche, Y., Search-based software engineering. Search-based software engineering, Lecture Notes in Computer Science, 9275 (2015), Springer International Publishing), 125-140
[55] Kocsis, Z. A.; Swan, J., Dependency injection for programming by optimization, CoRR, abs/1707.04016 (2017)
[56] König, M., Executable simulation model of the liver, bioRxiv (2020)
[57] Koza, J. R., Genetic programming: on the programming of computers by means of natural selection, 1 (1992), MIT press · Zbl 0850.68161
[58] Lim, D.; Ong, Y.-S.; Jin, Y.; Sendhoff, B.; Lee, B.-S., Efficient hierarchical parallel genetic algorithms using grid computing, Future Generation Computer Systems, 23, 4, 658-670 (2007)
[59] New York, USA
[60] López-Ibáñez, M.; Dubois-Lacoste, J.; Pérez Cáceres, L.; Birattari, M.; Stützle, T., The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, 3, 43-58 (2016)
[61] Dublin, Ireland
[62] Luke, S. (2010). The ECJ owner’s manual. http://www.cs.gmu.edu/ eclab/projects/ecj.
[63] Luke, S., ECJ then and now, Proceedings of the genetic and evolutionary computation conference companion. Proceedings of the genetic and evolutionary computation conference companion, GECCO ’17, 1223-1230 (2017), ACM: ACM New York, NY, USA
[64] Malan, K. M.; Engelbrecht, A. P., Fitness landscape analysis for metaheuristic performance prediction, (Richter, H.; Engelbrecht, A. (2014), Springer: Springer Berlin, Heidelberg), 103-132)
[65] Manna, Z.; Waldinger, R., A deductive approach to program synthesis, ACM Transactions on Programming Languages and Systems (TOPLAS), 2, 1, 90-121 (1980) · Zbl 0468.68009
[66] Marmion, M.-E.; Mascia, F.; López-Ibánez, M.; Stützle, T., Automatic design of hybrid stochastic local search algorithms, International workshop on hybrid metaheuristics, 144-158 (2013), Springer
[67] Martin, S.; Ouelhadj, D.; Beullens, P.; Ozcan, E.; Juan, A. A.; Burke, E. K., A multi-agent based cooperative approach to scheduling and routing, European Journal of Operational Research, 254, 1, 169-178 (2016) · Zbl 1346.90371
[68] Merelo-Guervós, J. J.; Castillo-Valdivieso, P.Á.; Romero-López, G.; García-Arenas, M., Specifying evolutionary algorithms in XML, International work-conference on artificial neural networks, 502-509 (2003), Springer
[69] Merelo Guervós, J. J.; Valdez, J. M.G., Mapping evolutionary algorithms to a reactive, stateless architecture: using a modern concurrent language, (Aguirre, H. E.; Takadama, K., Proceedings of the genetic and evolutionary computation conference companion, GECCO 2018, Kyoto, Japan, july 15-19, 2018 (2018), ACM), 1870-1877
[70] Miranda, P. B.; Prudłncio, R. B.; Pappa, G. L., H3ad: A hybrid hyper-heuristic for algorithm design, Information Sciences, 414, Supplement C, 340-354 (2017)
[71] (Milano, M.; Van Hentenryck, P., Hybrid Optimization: The Ten Years of CPAIOR. Hybrid Optimization: The Ten Years of CPAIOR, Springer Optimization and Its Applications, 45 (2011), Springer: Springer Berlin, Germany), 1-9 · Zbl 1201.90004
[72] Munawar, A.; Wahib, M.; Munetomo, M.; Akama, K., The design, usage, and performance of GridUFO: A grid based unified framework for optimization, Future Generation Computer Systems, 26, 4, 633-644 (2010)
[73] Nagata, Y.; Kobayashi, S., Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem, Proceedings of the 7th international conference on genetic algorithms, MI, USA (1997)
[74] Nallaperuma, S.; Wagner, M.; Neumann, F., Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem, (Bartz-Beielstein, T.; Branke, J.; Filipič, B.; Smith, J. (2014), Springer International Publishing: Springer International Publishing Cham), 100-109)
[75] Nallaperuma, S.; Wagner, M.; Neumann, F., Analyzing the effects of instance features and algorithm parameters for maxmin ant system and the traveling salesperson problem, Frontiers in Robotics and AI, 2, 18 (2015)
[76] Neumann, G.; Swan, J.; Harman, M.; Clark, J. A., The executable experimental template pattern for the systematic comparison of metaheuristics: Extended abstract, Proceedings of the companion publication of the 2014 annual conference on genetic and evolutionary computation. Proceedings of the companion publication of the 2014 annual conference on genetic and evolutionary computation, GECCO Comp ’14, 1427-1430 (2014), ACM: ACM New York, NY, USA
[77] Nikzad, E.; Bashiri, M.; Abbasi, B., A matheuristic algorithm for stochastic home health care planning, European Journal of Operational Research, 288, 3, 753-774 (2021) · Zbl 1487.90154
[78] Cape Town, South Africa.
[79] Pamparà, G.; Engelbrecht, A. P., Evolutionary and swarm-intelligence algorithms through monadic composition, Proceedings of the genetic and evolutionary computation conference companion. Proceedings of the genetic and evolutionary computation conference companion, GECCO ’19, 1382-1390 (2019), Association for Computing Machinery: Association for Computing Machinery New York, NY, USA
[80] Pamparà, G.; Engelbrecht, A. P.; Cloete, T., Cilib: A collaborative framework for computational intelligence algorithms - part I, Proceedings of the international joint conference on neural networks, IJCNN 2008, part of the IEEE world congress on computational intelligence, WCCI 2008, Hong Kong, China, june 1-6, 2008, 1750-1757 (2008), IEEE
[81] Pappa, G. L.; Ochoa, G.; Hyde, M. R.; Freitas, A. A.; Woodward, J.; Swan, J., Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms, Genetic Programming and Evolvable Machines, 15, 1, 3-35 (2014)
[82] Parejo, J. A., MOSES: A metaheuristic optimization software ecosystem, AI Commun., 29, 1, 223-225 (2016)
[83] Parejo, J. A.; Racero, J.; Guerrero, F.; Kwok, T.; Smith, K. A., Fom: A framework for metaheuristic optimization, (Sloot, P. M.A.; Abramson, D.; Bogdanov, A. V.; Gorbachev, Y. E.; Dongarra, J. J.; Zomaya, A. Y. (2003), Springer: Springer Berlin, Heidelberg), 886-895)
[84] Parejo, J. A.; Ruiz-Cortés, A.; Lozano, S.; Fernandez, P., Metaheuristic optimization frameworks: a survey and benchmarking, Soft Computing, 16, 3, 527-561 (2012)
[85] Parkes, A. J.; Özcan, E.; Karapetyan, D., A software interface for supporting the application of data science to optimisation, International conference on learning and intelligent optimization, 306-311 (2015), Springer
[86] Peer, E. S.; Engelbrecht, A. P.; Pamparà, G.; Masiye, B. S., Ciclops: computational intelligence collaborative laboratory of pantological software, Proceedings 2005 IEEE swarm intelligence symposium. SIS 2005, 130-137 (2005)
[87] Pellerin, R.; Perrier, N.; Berthaut, F., A survey of hybrid metaheuristics for the resource-constrained project scheduling problem, European Journal of Operational Research, 280, 2, 395-416 (2020) · Zbl 1430.90286
[88] Popper, K., Conjectures and Refutations: The Growth of Scientific Knowledge, Routledge classics (1963), Routledge
[89] Prud’homme, C., Fages, J.-G., & Lorca, X. (2016). Choco solver documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S.
[90] Puchinger, J.; Raidl, G., Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification, Artificial intelligence and knowledge engineering applications: a bioinspired approach, 113-124 (2005), Springer
[91] Qu, R.; Burke, E. K.; McCollum, B., Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, European Journal of Operational Research, 198, 2, 392-404 (2009) · Zbl 1163.90775
[92] Raidl, G. R., Decomposition based hybrid metaheuristics, European Journal of Operational Research, 244, 1, 66-76 (2015) · Zbl 1346.90827
[93] Rice, J. R., The algorithm selection problem, (Rubinoff, M.; Yovits, M. C., Advances in computers, 15 (1976), Elsevier), 65-118
[94] Rosenberg, F.; Müller, M. B.; Leitner, P.; Michlmayr, A.; Bouguettaya, A.; Dustdar, S., Metaheuristic optimization of large-scale qos-aware service compositions, 2010 IEEE international conference on services computing, SCC 2010, Miami, FL, USA, july 5-10, 2010, 97-104 (2010), IEEE Computer Society
[95] Ross, P., Search methodologies: Introductory tutorials in optimization and decision support techniques, 611-638) (2014), Springer US
[96] Rotem-Gal-Oz, A.; Bruno, E.; Dahan, U., SOA patterns (2012), Manning
[97] Scheibenpflug, A.; Wagner, S.; Pitzer, E.; Affenzeller, M., Optimization Knowledge Base: An open database for algorithm and problem characteristics and optimization results, Gecco ’12 (2012), ACM: ACM NY, USA
[98] Senington, R.; Duke, D., Decomposing metaheuristic operations, (Hinze, R., Implementation and application of functional languages. Implementation and application of functional languages, LNCS 8241 (2013), Springer: Springer Berlin Heidelberg), 224-239
[99] Smith-Miles, K.; Baatar, D.; Wreford, B.; Lewis, R., Towards objective measures of algorithm performance across instance space, Computers & Operations Research, 45, 12-24 (2014) · Zbl 1348.90646
[100] Song, W.; Keane, A.; Cox, S., Cfd-based shape optimisation with grid-enabled design search toolkits, Uk e-science all hands meeting 2003, 619-627 (2003), EPSRC
[101] Song, W.; Ong, Y. S.; Ng, H. K.; Keane, A.; Cox, S.; Lee, B. S., A service-oriented approach for aerodynamic shape optimisation across institutional boundaries, Control, automation, robotics and vision conference, 2004. icarcv 2004 8th, 3, 2274-2279 (2004)
[102] Sörensen, K., Metaheuristics—the metaphor exposed, International Transactions in Operational Research, 22, 1, 3-18 (2013) · Zbl 1309.90127
[103] Sörensen, K.; Glover, F. W., Metaheuristics, (Gass, S. I.; Fu, M. C. (2013), Springer US: Springer US Boston, MA), 960-970)
[104] Sörensen, K.; Arnold, F.; Palhazi Cuervo, P., A critical analysis of the “improved Clarke and Wright savings algorithm”, International Transactions in Operational Research, 26, 1, 54-63 (2019) · Zbl 07765929
[105] Soria-Alcaraz, J. A.; Ochoa, G.; Sotelo-Figeroa, M. A.; Burke, E. K., A methodology for determining an effective subset of heuristics in selection hyper-heuristics, European Journal of Operational Research, 260, 3, 972-983 (2017) · Zbl 1403.90658
[106] Stützle, T.; López-Ibáñez, M., Automated design of metaheuristic algorithms, Handbook of metaheuristics, 541-579 (2019), Springer
[107] Sutter, H., The free lunch is over: A fundamental turn toward concurrency in software, Dr. Dobbs Journal, 30, 3 (2005)
[108] Swan, J.; Adriaensen, S.; Barwell, A. D.; Hammond, K.; White, D. R., Extending the ‘open-closed principle’ to automated algorithm configuration, Evolutionary Computation, 27, 1, 173-193 (2019)
[109] Swan, J.; Adriaensen, S.; Bishr, M.; Burke, E. K.; Clark, J. A.; Causmaecker, P. D.; Yao, X., A research agenda for metaheuristic standardization, Proceedings of the eleventh Metaheuristics International Conference (mic), Agadir, Morocco (2015)
[110] Swan, J.; De Causmaecker, P.; Martin, S.; Özcan, E., A re-characterization of hyper-heuristics, (Amodeo, L.; Talbi, E.-G.; Yalaoui, F. (2018), Springer International Publishing: Springer International Publishing Cham), 75-89)
[111] Taillard, E. D., Tutorial: Few guidelines for analyzing methods, Metaheuristic interantional conference (mic’05) proceedings (2005)
[112] Taylor, S. J., Distributed simulation: state-of-the-art and potential for operational research, European Journal of Operational Research, 273, 1, 1-19 (2019) · Zbl 1403.90681
[113] Thabtah, F.; Cowling, P., Mining the data from a hyperheuristic approach using associative classification, Expert Systems with Applications, 34, 2, 1093-1101 (2008)
[114] Valipour, M. H.; Amirzafari, B.; Maleki, K. N.; Daneshpour, N., A brief survey of software architecture concepts and service oriented architecture, 2nd IEEE international conference on computer science and information technology. ICCSIT 2009, 34-38 (2009)
[115] (Voß, S.; Martello, S.; Osman, I. H.; Roucairol, C., Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston (1999)) · Zbl 0930.00082
[116] (Voß, S.; Woodruff, D. L., Optimization Software Class Libraries. Kluwer, Boston (2002)) · Zbl 1055.68044
[117] Wagner, S.; Affenzeller, M., Adaptive and natural computing algorithms: Proceedings of the international conference in Coimbra, Portugal, 2005, 538-541 (2005), Springer: Springer Vienna
[118] Wagner, S.; Kronberger, G.; Beham, A.; Kommenda, M.; Scheibenpflug, A.; Pitzer, E.; Affenzeller, M., Advanced methods and applications in computational intelligence, vol.6, 197-261 (2014), Springer
[119] Weyland, D., A rigorous analysis of the harmony search algorithm: How the research community can be misled by a “novel” methodology, Int. J. Appl. Metaheuristic Comput., 1, 2, 50-60 (2010)
[120] Wolpert, D. H.; Macready, W. G., No free lunch theorems for optimization, Trans. Evol. Comp, 1, 1, 67-82 (1997)
[121] New York, USA
[122] Xu, L.; Hutter, F.; Hoos, H. H.; Leyton-Brown, K., SATzilla: portfolio-based algorithm selection for SAT, Journal of Artificial Intelligence Research, 32, 565-606 (2008) · Zbl 1182.68272
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.