135 related articles for article (PubMed ID: 26241197)
1. Analysis of Randomised Search Heuristics for Dynamic Optimisation.
Jansen T; Zarges C
Evol Comput; 2015; 23(4):513-41. PubMed ID: 26241197
[TBL] [Abstract][Full Text] [Related]
2. Automated discovery of local search heuristics for satisfiability testing.
Fukunaga AS
Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
[TBL] [Abstract][Full Text] [Related]
3. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
Lissovoi A; Oliveto PS; Warwicker JA
Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
[TBL] [Abstract][Full Text] [Related]
4. An immune network inspired evolutionary algorithm for the diagnosis of Parkinson's disease.
Smith SL; Timmis J
Biosystems; 2008; 94(1-2):34-46. PubMed ID: 18619513
[TBL] [Abstract][Full Text] [Related]
5. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
Pourhassan M; Neumann F
Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
Corus D; Lehre PK; Neumann F; Pourhassan M
Evol Comput; 2016; 24(1):183-203. PubMed ID: 25700147
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Decentralized Bayesian search using approximate dynamic programming methods.
Zhao Y; Patek SD; Beling PA
IEEE Trans Syst Man Cybern B Cybern; 2008 Aug; 38(4):970-5. PubMed ID: 18632386
[TBL] [Abstract][Full Text] [Related]
10. A lifelong learning hyper-heuristic method for bin packing.
Sim K; Hart E; Paechter B
Evol Comput; 2015; 23(1):37-67. PubMed ID: 24512321
[TBL] [Abstract][Full Text] [Related]
11. Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
Coelho VN; Coelho IM; Souza MJ; Oliveira TA; Cota LP; Haddad MN; Mladenovic N; Silva RC; Guimarães FG
Evol Comput; 2016; 24(4):637-666. PubMed ID: 27258842
[TBL] [Abstract][Full Text] [Related]
12. Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces.
Malan KM; Moser I
Evol Comput; 2019; 27(2):267-289. PubMed ID: 29528726
[TBL] [Abstract][Full Text] [Related]
13. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
Drake JH; Özcan E; Burke EK
Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
[TBL] [Abstract][Full Text] [Related]
14. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Nallaperuma S; Neumann F; Sudholt D
Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
[TBL] [Abstract][Full Text] [Related]
15. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
Moreno-Scott JH; Ortiz-Bayliss JC; Terashima-Marín H; Conant-Pablos SE
Comput Intell Neurosci; 2016; 2016():7349070. PubMed ID: 26949383
[TBL] [Abstract][Full Text] [Related]
16. A dynamic hybrid framework for constrained evolutionary optimization.
Wang Y; Cai Z
IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):203-17. PubMed ID: 21824851
[TBL] [Abstract][Full Text] [Related]
17. No clock to rule them all.
Taouali W; Viéville T; Rougier NP; Alexandre F
J Physiol Paris; 2011; 105(1-3):83-90. PubMed ID: 21945195
[TBL] [Abstract][Full Text] [Related]
18. Evolutionary game based control for biological systems with applications in drug delivery.
Li X; Lenaghan SC; Zhang M
J Theor Biol; 2013 Jun; 326():58-69. PubMed ID: 23295892
[TBL] [Abstract][Full Text] [Related]
19. Analysis of an asymmetric mutation operator.
Jansen T; Sudholt D
Evol Comput; 2010; 18(1):1-26. PubMed ID: 20064023
[TBL] [Abstract][Full Text] [Related]
20. Landscape Analysis of a Class of NP-Hard Binary Packing Problems.
Alyahya K; Rowe JE
Evol Comput; 2019; 27(1):47-73. PubMed ID: 30365387
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
