A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. - Can Akkan; Ayla Gülcü (Comput. Oper. Res., 2018)

Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling. - Can Akkan; Ayla Gülcü; Zeki Kus (CEC, 2020)

Hyper-Parameter Selection in Convolutional Neural Networks Using Microcanonical Optimization Algorithm. - Ayla Gülcü; Zeki Kus (IEEE Access, 2020)

Robust university course timetabling problem subject to single and multiple disruptions. - Ayla Gülcü; Can Akkan (Eur. J. Oper. Res., 2020)

Clustering electricity market participants via FRM models. - Ayla Gülcü; Sedrettin Çaliskan (Intell. Decis. Technol., 2020)

Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions. - Can Akkan; Ayla Gülcü; Zeki Kus (Comput. Oper. Res., 2021)

Multi-objective simulated annealing for hyper-parameter optimization in convolutional neural networks. - Ayla Gülcü; Zeki Kus (PeerJ Comput. Sci., 2021)

Neural Architecture Search Using Differential Evolution in MAML Framework for Few-Shot Classification Problems. - Ayla Gülcü; Zeki Kus (MIC, 2022)

Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. - Can Akkan; Ayla Gülcü; Zeki Kus (J. Sched., 2022)

Novel Surrogate Measures Based on a Similarity Network for Neural Architecture Search. - Zeki Kus; Can Akkan; Ayla Gülcü (IEEE Access, 2023)