265 related articles for article (PubMed ID: 31120773)
21. An Innovative Excited-ACS-IDGWO Algorithm for Optimal Biomedical Data Feature Selection.
Segera D; Mbuthia M; Nyete A
Biomed Res Int; 2020; 2020():8506365. PubMed ID: 32908920
[TBL] [Abstract][Full Text] [Related]
22. Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic.
Abdi A; Hajsaeedi M; Hooshmand M
Comput Biol Chem; 2023 Aug; 105():107882. PubMed ID: 37244077
[TBL] [Abstract][Full Text] [Related]
23. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
Ceberio J; Calvo B; Mendiburu A; Lozano JA
Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
[TBL] [Abstract][Full Text] [Related]
24. Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.
Doerr B
Evol Comput; 2021 Jun; 29(2):305-329. PubMed ID: 33197211
[TBL] [Abstract][Full Text] [Related]
25. Feature-Based Diversity Optimization for Problem Instance Classification.
Gao W; Nallaperuma S; Neumann F
Evol Comput; 2021; 29(1):107-128. PubMed ID: 32551995
[TBL] [Abstract][Full Text] [Related]
26. Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.
Le HT; Geser P; Middendorf M
Evol Comput; 2021 Sep; 29(3):415-439. PubMed ID: 34467994
[TBL] [Abstract][Full Text] [Related]
27. Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.
Zheng W; Doerr B
Evol Comput; 2023 Dec; 31(4):337-373. PubMed ID: 37023353
[TBL] [Abstract][Full Text] [Related]
28. HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem.
Liu Y; Guo P; Zeng Y
Comput Intell Neurosci; 2022; 2022():6400318. PubMed ID: 35096045
[TBL] [Abstract][Full Text] [Related]
29. New insights into diversification of hyper-heuristics.
Ren Z; Jiang H; Xuan J; Hu Y; Luo Z
IEEE Trans Cybern; 2014 Oct; 44(10):1747-61. PubMed ID: 25222719
[TBL] [Abstract][Full Text] [Related]
30. EHHR: an efficient evolutionary hyper-heuristic based recommender framework for short-text classifier selection.
Almas B; Mujtaba H; Khan KU
Cluster Comput; 2023; 26(2):1425-1446. PubMed ID: 36247806
[TBL] [Abstract][Full Text] [Related]
31. Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.
MacLachlan J; Mei Y; Branke J; Zhang M
Evol Comput; 2020; 28(4):563-593. PubMed ID: 31730372
[TBL] [Abstract][Full Text] [Related]
32. A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.
Nguyen S; Mei Y; Xue B; Zhang M
Evol Comput; 2019; 27(3):467-496. PubMed ID: 29863420
[TBL] [Abstract][Full Text] [Related]
33. Evolutionary squeaky wheel optimization: a new framework for analysis.
Li J; Parkes AJ; Burke EK
Evol Comput; 2011; 19(3):405-28. PubMed ID: 21265626
[TBL] [Abstract][Full Text] [Related]
34. Hybridization of decomposition and local search for multiobjective optimization.
Ke L; Zhang Q; Battiti R
IEEE Trans Cybern; 2014 Oct; 44(10):1808-20. PubMed ID: 25222724
[TBL] [Abstract][Full Text] [Related]
35. Memetic algorithms for continuous optimisation based on local search chains.
Molina D; Lozano M; García-Martínez C; Herrera F
Evol Comput; 2010; 18(1):27-63. PubMed ID: 20064025
[TBL] [Abstract][Full Text] [Related]
36. Groundwater contaminant source characterization with simulation model parameter estimation utilizing a heuristic search strategy based on the stochastic-simulation statistic method.
Wang H; Lu W; Li J
J Contam Hydrol; 2020 Oct; 234():103681. PubMed ID: 32739635
[TBL] [Abstract][Full Text] [Related]
37. Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search.
Huang X; Zeng X; Han R
Comput Intell Neurosci; 2017; 2017():3235720. PubMed ID: 28634487
[TBL] [Abstract][Full Text] [Related]
38. Learning Improvement Heuristics for Solving Routing Problems.
Wu Y; Song W; Cao Z; Zhang J; Lim A
IEEE Trans Neural Netw Learn Syst; 2022 Sep; 33(9):5057-5069. PubMed ID: 33793405
[TBL] [Abstract][Full Text] [Related]
39. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
40. Efficient heuristics for maximum common substructure search.
Englert P; Kovács P
J Chem Inf Model; 2015 May; 55(5):941-55. PubMed ID: 25865959
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
