129 related articles for article (PubMed ID: 32101026)
1. Inferring Future Landscapes: Sampling the Local Optima Level.
Thomson SL; Ochoa G; Verel S; Veerapen N
Evol Comput; 2020; 28(4):621-641. PubMed ID: 32101026
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty.
Moser I; Gheorghita M; Aleti A
Evol Comput; 2017; 25(3):407-437. PubMed ID: 26928851
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes.
Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K
Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. Advanced fitness landscape analysis and the performance of memetic algorithms.
Merz P
Evol Comput; 2004; 12(3):303-25. PubMed ID: 15355603
[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. 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]
10. 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]
11. Anatomy of the Attraction Basins: Breaking with the Intuition.
Hernando L; Mendiburu A; Lozano JA
Evol Comput; 2019; 27(3):435-466. PubMed ID: 29786459
[TBL] [Abstract][Full Text] [Related]
12. Hyper-heuristics with low level parameter adaptation.
Ren Z; Jiang H; Xuan J; Luo Z
Evol Comput; 2012; 20(2):189-227. PubMed ID: 22171917
[TBL] [Abstract][Full Text] [Related]
13. A new heuristic method for approximating the number of local minima in partial RNA energy landscapes.
Albrecht AA; Day L; Abdelhadi Ep Souki O; Steinhöfel K
Comput Biol Chem; 2016 Feb; 60():43-52. PubMed ID: 26657221
[TBL] [Abstract][Full Text] [Related]
14. A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems.
Kheiri A; Keedwell E
Evol Comput; 2017; 25(3):473-501. PubMed ID: 27258841
[TBL] [Abstract][Full Text] [Related]
15. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
Lim WL; Wibowo A; Desa MI; Haron H
Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Multidimensional knapsack problem: a fitness landscape analysis.
Tavares J; Pereira FB; Costa E
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):604-16. PubMed ID: 18558527
[TBL] [Abstract][Full Text] [Related]
18. Offline Learning with a Selection Hyper-Heuristic: An Application to Water Distribution Network Optimisation.
Yates WB; Keedwell EC
Evol Comput; 2021 Jun; 29(2):187-210. PubMed ID: 32567958
[TBL] [Abstract][Full Text] [Related]
19. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.
Sun J; Zhang Q; Yao X
IEEE Trans Cybern; 2014 Mar; 44(3):429-44. PubMed ID: 23757559
[TBL] [Abstract][Full Text] [Related]
20. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
Liu J; Sun Y; Li G; Song B; Huang W
Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
