100 related articles for article (PubMed ID: 10021742)
1. 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]
2. 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]
3. Student timetabling genetic algorithm accounting for student preferences.
Mahlous AR; Mahlous H
PeerJ Comput Sci; 2023; 9():e1200. PubMed ID: 37346570
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Sequence-Based Deterministic Initialization for Evolutionary Algorithms.
Elsayed S; Sarker R; Coello Coello CA
IEEE Trans Cybern; 2017 Sep; 47(9):2911-2923. PubMed ID: 28114054
[TBL] [Abstract][Full Text] [Related]
6. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.
Raidl GR; Gottlieb J
Evol Comput; 2005; 13(4):441-75. PubMed ID: 16297279
[TBL] [Abstract][Full Text] [Related]
7. A Heuristic Initialized Stochastic Memetic Algorithm for MDPVRP With Interdependent Depot Operations.
Azad AS; Islam M; Chakraborty S
IEEE Trans Cybern; 2017 Dec; 47(12):4302-4315. PubMed ID: 28141540
[TBL] [Abstract][Full Text] [Related]
8. Solving a real-world problem using an evolving heuristically driven schedule builder.
Hart E; Ross P; Nelson J
Evol Comput; 1998; 6(1):61-80. PubMed ID: 10021741
[TBL] [Abstract][Full Text] [Related]
9. An evolutionary neural network approach for module orientation problems.
Funabiki N; Kitamichi J; Nishikawa S
IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):849-55. PubMed ID: 18256003
[TBL] [Abstract][Full Text] [Related]
10. Genetic algorithms, path relinking, and the flowshop sequencing problem.
Reeves CR; Yamada T
Evol Comput; 1998; 6(1):45-60. PubMed ID: 10021740
[TBL] [Abstract][Full Text] [Related]
11. Approaching the bi-objective critical node detection problem with a smart initialization-based evolutionary algorithm.
Béczi E; Gaskó N
PeerJ Comput Sci; 2021; 7():e750. PubMed ID: 34805505
[TBL] [Abstract][Full Text] [Related]
12. Better ILP models for haplotype assembly.
Etemadi M; Bagherian M; Chen ZZ; Wang L
BMC Bioinformatics; 2018 Feb; 19(Suppl 1):52. PubMed ID: 29504891
[TBL] [Abstract][Full Text] [Related]
13. An Opposition-Based Learning CRO Algorithm for Solving the Shortest Common Supersequence Problem.
Luo F; Chen C; Fuentes J; Li Y; Ding W
Entropy (Basel); 2022 May; 24(5):. PubMed ID: 35626526
[TBL] [Abstract][Full Text] [Related]
14. A hybrid evolutionary algorithm for wheat blending problem.
Li X; Bonyadi MR; Michalewicz Z; Barone L
ScientificWorldJournal; 2014; 2014():967254. PubMed ID: 24707222
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Examining the effect of initialization strategies on the performance of Gaussian mixture modeling.
Shireman E; Steinley D; Brusco MJ
Behav Res Methods; 2017 Feb; 49(1):282-293. PubMed ID: 26721666
[TBL] [Abstract][Full Text] [Related]
17. A hyper-heuristic for the Longest Common Subsequence problem.
Tabataba FS; Mousavi SR
Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. A general heuristic for genome rearrangement problems.
Dias U; Galvão GR; Lintzmayer CN; Dias Z
J Bioinform Comput Biol; 2014 Jun; 12(3):1450012. PubMed ID: 24969750
[TBL] [Abstract][Full Text] [Related]
20. Genetic diversity as an objective in multi-objective evolutionary algorithms.
Toffolo A; Benini E
Evol Comput; 2003; 11(2):151-67. PubMed ID: 12875667
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
