224 related articles for article (PubMed ID: 27258841)
1. 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]
2. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
Sabar NR; Ayob M; Kendall G; Qu R
IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. 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]
6. 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]
7. A heuristic approach to the task planning problem in a home care business.
Méndez-Fernández I; Lorenzo-Freire S; García-Jurado I; Costa J; Carpente L
Health Care Manag Sci; 2020 Dec; 23(4):556-570. PubMed ID: 32712791
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
Hart E; Sim K
Evol Comput; 2016; 24(4):609-635. PubMed ID: 27120113
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
Chen X; Kong Y; Dang L; Hou Y; Ye X
PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
[TBL] [Abstract][Full Text] [Related]
14. Modeling high school timetabling with bitvectors.
Demirović E; Musliu N
Ann Oper Res; 2017; 252(2):215-238. PubMed ID: 28529399
[TBL] [Abstract][Full Text] [Related]
15. Ancestral population genomics using coalescence hidden Markov models and heuristic optimisation algorithms.
Cheng JY; Mailund T
Comput Biol Chem; 2015 Aug; 57():80-92. PubMed ID: 25819138
[TBL] [Abstract][Full Text] [Related]
16. Automating the packing heuristic design process with genetic programming.
Burke EK; Hyde MR; Kendall G; Woodward J
Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
[TBL] [Abstract][Full Text] [Related]
17. Initialization strategies and diversity in evolutionary timetabling.
Burke EK; Newall JP; Weare RF
Evol Comput; 1998; 6(1):81-103. PubMed ID: 10021742
[TBL] [Abstract][Full Text] [Related]
18. A PageRank-based heuristic for the minimization of open stacks problem.
Frinhani RMD; de Carvalho MAM; Soma NY
PLoS One; 2018; 13(8):e0203076. PubMed ID: 30161217
[TBL] [Abstract][Full Text] [Related]
19. An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling.
Nand R; Sharma B; Chaudhary K
PeerJ Comput Sci; 2022; 8():e1068. PubMed ID: 36091985
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
